您现在的位置: 首页> 研究主题> VLSI

VLSI

VLSI的相关文献在1987年到2022年内共计1285篇,主要集中在无线电电子学、电信技术、自动化技术、计算机技术、工业经济 等领域,其中期刊论文1107篇、会议论文31篇、专利文献147篇;相关期刊276种,包括电子学报、微电子技术、电子工业专用设备等; 相关会议28种,包括第十一届计算机工程与工艺全国学术年会、中国电子学会第十三届青年学术年会、中国第二十届电路与系统学术年会暨2007年港澳内地电子信息学术研讨会等;VLSI的相关文献由1934位作者贡献,包括洪先龙、章倩苓、郑南宁等。

VLSI—发文量

期刊论文>

论文:1107 占比:86.15%

会议论文>

论文:31 占比:2.41%

专利文献>

论文:147 占比:11.44%

总计:1285篇

VLSI—发文趋势图

VLSI

-研究学者

  • 洪先龙
  • 章倩苓
  • 郑南宁
  • 严晓浪
  • 林争辉
  • 曾晓洋
  • 沈绪榜
  • 朱文兴
  • 石秉学
  • 周晓方
  • 期刊论文
  • 会议论文
  • 专利文献

搜索

排序:

年份

作者

    • 刘丽君; 贺天宇
    • 摘要: 针对大规模电路存在可以被优化的逻辑门,文中提出利用演化硬件(EHW)技术对大规模电路分块优化的方法。由于EHW技术只能演化小规模的电路,因此需要对大规模电路进行分解后才可以演化。首先根据逻辑门之间的连接关系,利用层次聚类的方法对大规模电路进行分解,分解后的子电路规模要适用于EHW技术;然后利用EHW技术对分解后的子电路进行演化,演化生成多种与原始子电路功能相同的电路,从中选择逻辑门最少的电路替换原始子电路,以达到优化子电路的目的;最后将优化后的子电路按照分解前的连接关系合并,得到与原始电路功能相同而逻辑门数较少的电路。实验结果表明,利用EHW技术可对大规模电路进行再优化,不仅能够降低逻辑门的数量,还可提高其安全性。
    • Hao Chen; Mingjie Liu; Xiyuan Tang; Keren Zhu; Nan Sun; David Z.Pan
    • 摘要: Realizing the layouts of analog/mixed-signal(AMS)integrated circuits(ICs)is a complicated task due to the high design flexibility and sensitive circuit performance.Compared with the advancements of digital IC layout automation,analog IC layout design is still heavily manual,which leads to a more time-consuming and error-prone process.In recent years,significant progress has been made in automated analog layout design with emerging of several open-source frameworks.This paper firstly reviews the existing state-of-the art AMS layout synthesis frameworks with focus on the different approaches and their individual challenges.We then present recent research trends and opportunities in the field.Finally,we summaries the paper with open questions and future directions for fully-automating the analog IC layout.
    • 张金凤1; 唐金慧1; 马成英1
    • 摘要: 随着超大规模集成电路(VLSI)设计的规模和复杂性不断增加,用于测试芯片的测试向量变的非常庞大,同时测试程序设计需考虑多种因素,从而导致测试开发工作困难程度大大增加。自动测试设备(ATE)不能直接使用电子设计自动化(EDA)产生的仿真向量,需要通过转换得到ATE可识别的测试向量,测试向量的转换成为测试程序开发的关键步骤之一。本文介绍了VLSI测试向量转换的概念、向量转换的关键技术,分析了测试向量转换过程,并以可编程逻辑器件为例具体讲解VLSI测试向量转换的实现过程。另外,开发了ATE测试向量转换脚本软件,缩短了测试程序调试时间,加快了测试程序开发速度。
    • Huai-Mao Weng; Ching-Te Chiu
    • 摘要: Traffic sign recognition (TSR, or Road Sign Recognition, RSR) is one of the Advanced Driver Assistance System (ADAS) devices in modern cars. To concern the most important issues, which are real-time and resource efficiency, we propose a high efficiency hardware implementation for TSR. We divide the TSR procedure into two stages, detection and recognition. In the detection stage, under the assumption that most German traffic signs have red or blue colors with circle, triangle or rectangle shapes, we use Normalized RGB color transform and Single-Pass Connected Component Labeling (CCL) to find the potential traffic signs efficiently. For Single-Pass CCL, our contribution is to eliminate the “merge-stack” operations by recording connected relations of region in the scan phase and updating the labels in the iterating phase. In the recognition stage, the Histogram of Oriented Gradient (HOG) is used to generate the descriptor of the signs, and we classify the signs with Support Vector Machine (SVM). In the HOG module, we analyze the required minimum bits under different recognition rate. The proposed method achieves 96.61% detection rate and 90.85% recognition rate while testing with the GTSDB dataset. Our hardware implementation reduces the storage of CCL and simplifies the HOG computation. Main CCL storage size is reduced by 20% comparing to the most advanced design under typical condition. By using TSMC 90 nm technology, the proposed design operates at 105 MHz clock rate and processes in 135 fps with the image size of 1360 × 800. The chip size is about 1 mm2 and the power consumption is close to 8 mW. Therefore, this work is resource efficient and achieves real-time requirement.
    • 张为; 包娜; 祁志恒; 贾琪
    • 摘要: 提出了1种每周期处理1个(CX-D)数据对的高效的MQ编码器硬件结构.优化概率估计值表,化简了编码逻辑并节省了资源.使用1种基于预测的字节输出结构,减小了路径延时.在FPGA平台上综合该MQ编码器,吞吐率可达到151.7 Msymbols/s.%A high efficient MQ encoder is presented.Proposed MQ encoder can encode one CX-D pairs in every clock cycle.Probability estimation table (PET) is optimized to simplify the algorithm and reduce occupied memory bits.A novel BYTEOUT architecture is proposed using a prediction technique which reduces the path delay.This MQ encoder is implemented on a Xilinx FPGA,it achieves a throughput of 151.7 Msymbols/s.
    • 闫博冉; 何卫锋; 毛志刚
    • 摘要: 运动估计是HEVC中计算量最大、耗时最多的模块.为了加速编码过程,设计了适用于HEVC运动估计的六边形搜索算法的VLSI架构.该架构支持HEVC标准中的尺寸可变块设计,并且充分考虑六边形模板的数据复用特点,在PE阵列中使用流水线的组织策略,有效降低了片上缓存的访问次数.采用SMIC 65 nm工艺综合该电路,最高工作频率可迭100 MHz,电路规模101 k门,能够满足高清视频(1 920×1 080,60帧/秒)的实时编码要求.
    • 郑久寿; 徐奡; 刘帅
    • 摘要: 随着芯片制造工艺的不断发展,超大规模集成电路集成度不断提高,体积不断缩小.纳米工艺一方面带来产品规模、产品性能的提升,另一方面带来了产品可靠性,不可信制造和测试效率、测试覆盖率等诸多问题.为应对这些问题,设计工程师和测试工程师研发了很多新的方法,分析了超大规模集成电路在可靠性设计和测试技术发展的最新进展,最后指出了VLSI可靠性设计和测试技术的发展方向.
    • 陈家瑞
    • 摘要: 超大规模集成电路(VLSI)划分问题,属于NP-难问题.结合了贪心随机自适应搜索过程(GRASP)和多级聚类方法的思想,提出了一种基于多级聚类的电路划分算法.算法采用贪心随机自适应的思想改进了多级划分方法中重边粗化聚类(HEM)方法.通过对ISPD98的18个标准测试样例的测试结果表明,该方法与著名的划分工具hMetis相比,划分质量有一定的提高,最多可以改进3%左右.
    • 朱自然; 陈建利; 朱文兴
    • 摘要: Global routing is a crucial step in very large scale integration (VLSI) physical design, which will affect routability, wirelength and the number of vias of a chip. In this paper, a multistage rip-up and reroute based global routing algorithm is presented to reduce the probability of getting stuck in local optima of traditional rip-up and reroute routing algorithms. In each rip-up and reroute stage, the proposed method focuses on different aspects of overflow minimization and wirelength minimization. It constructs different cost functions, determines different orderings for rip-up and reroute, and selects different routing models and algorithms to rip-up and reroute the marked nets. Using the strategies above, the multistage rip-up and reroute based global routing algorithm can es-cape local optima effectively, and improve routing quality and speed. Experimental results on ISPD 2008 global routing contest benchmarks show that the proposed global routing algorithm can obtain less total overflow than those of NTUgr, NTHU-Route2.0 and NCTU-GR2.0 by 1.4%, 2.4% and 21.5%, respectively; and runs 10.4 times, 1.6 times and 1.3 times faster than NTUgr, NTHU-Route2.0 and NCTU-GR2.0, respectively.%超大规模集成电路总体布线是集成电路物理设计的关键环节之一,对芯片的可布线性、线长、通孔数等性能指标有重大影响.针对拆线重布方法容易陷入局部最优解的问题,提出一种基于多阶段拆线重布的总体布线算法.该算法根据不同布线阶段对最小化溢出值和最小化线长这两个目标的侧重点不同,通过构造不同的布线代价函数、确定不同的布线顺序、选取不同的布线模型及布线算法对线网进行拆线重布,使得基于多阶段拆线重布的总体布线算法可以有效地跳出局部最优解,快速地提高布线质量.采用ISPD08总体布线竞赛中的标准测试例子集的实验结果表明,与NTUgr, NTHU-Route2.0和NCTU-GR2.0相比,所提出的总体布线算法在平均总溢出方面分别减少了1.4%,2.4%和21.5%,在平均运行时间方面分别快了10.4倍,1.6倍和1.3倍.
  • 查看更多

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号