2-D FIR数字滤波的一种新结构(英文)

对2-D FIR数字滤波提出了一种有效的VLSI算法和实现结构,该算法结构在实现上大大减少了乘法器和延迟器的数目,因而有着广泛的应用前景。     

A Novel Eigenvector Technique for Large Scale Combinatorial Problems in VLSI Layout

Modern integrated circuit design involves laying out circuits which consist of millions of switching elements or transistors. Due to the sheer complexity, optimizing the connectivity between transistors is a very difficult problem. How a circuit is interconnected is the single most important factor in performance criteria such as signal delay, power dissipation, circuit size and cost. These factors dictate that interconnections—wires, be made as short as possible. The wire–minimization problem is formulated as a sequence of discrete optimization subproblems. These problems are known to be NP-hard, hence they can only be solved approximately using meta-heuristics or linear programming techniques. Nevertheless, these methods are computationally expensive and the quality of solution depends to a great extent on an appropriate choice of starting configuration. A matrix reordering technique for solving very hard discrete optimization problems in Very Large Scale Integrated (VLSI) design which overcomes some of these shortcomings is proposed. In particular, the computational cost is reasonable—of the order of n ^1.4 running time.     

采用CORDIC算法的自适应抗干扰处理

自适应阵列处理技术因为能够大大提高电子系统的抗干扰能力、可靠性、分辨能力等重要指标而得到越来越广泛的应用。但其实时处理由于算法的巨大运算量而难以实现。ＣＯＲＤＩＣ算法具有将多种复杂函数的计算转变为统一的简单的移位加法操作，并适于ＶＬＳＩ硬件实现的特点，为人们设计既面向自适应抗干扰算法结构，又面向算法基本运算的ＶＬＳＩ专用阵列处理机来完成实时自适应抗干扰处理任务提供了新的途径。本文介绍ＣＯＲＤＩＣ算法的基本原理，并研究了ＱＲ分解最小二乘算法基于ＣＯＲＤＩＣ算法芯片的实现。     

VLSI／ULSI可靠性的监测与模拟

论述分析了现代ＶＬＳＩ／ＵＬＳＩ电路可靠性监测与模拟技术的研究进展、应用趋势以及相关的新型监测分析技术，并讨论了其研究设计与发展方向。     

电子技术课程的教学改革与实践

通过教材建设、实验教学、课程设计与教学手段、师资队伍建设等方面分析了电子技术课程的改革与实践。     

动态参数模型确定SoC中异步FIFO深度的方法

针对超大规模集成电路和片上系统设计中确定异步FIFO浓度的问题,根据异步FIFO运行时的属性提出FIFO动态参数模型,该模型包括FIFO饱和度、写入端和读出端数据传输率及上溢/下溢频率。在该模型的基础之上,分析异步FIFO的深度与动态参数之间的关系,采用功能仿真方法确定片上系统中异步模块之间数据传输所需FIFO的深度。对典型实例的分析表明,采用这种方法能够在保证系统数据通信性能的前提下,获得最小的FIFO深度,优化系统资源的使用。     

计算VLSI电容方法的研究

讨论了几种VLSI版图中电容的计算方法;计算集成电路电容的方法有公式法和数值法两大类。利用数值法计算电容的方法包含有限差分法、有限元法、边界元法和格林法等,分析了以上各种方法的计算原理和优缺点。     

Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem

Given a set N of n terminals in the first quadrant of the Euclidean plane E ², find a minimum length directed tree rooted at the origin o, connecting to all terminals in N, and consisting of only horizontal and vertical arcs oriented from left to right or from bottom to top. This problem is called rectilinear Steiner arborescence problem, which has been proved to be NP-complete recently (Shi and Su, 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2000, to appear). In this paper, we present a polynomial time approximation scheme for this problem.     

新颖的余数系统到二进制系统转换方法

传统的余数系统(RNS)到二进制系统(R/B)转换电路中的大位宽操作削弱了RNS的并行特性。针对这一问题,提出了基于数值缩放(Scaling)的R/B转换算法和余数系统2k缩放并行实现的方法。同常见余数基R/B转换算法的比较分析结果表明,所提出的算法使R/B转换中的最大运算位宽限制在最大余数基位宽内,从而消除了R/B转换中可能带来的系统并行度损失;此外,该转换算法可实现有符号RNS到二进制补码系统(TCS)的转换,且不限于具体余数基形式,具有一定的通用性。     

一种串扰和时延驱动的总体布线算法

提出了一种能够同时考虑串扰和时延,作为综合性能驱动的总体布线算法。该算法由基于边串扰度、变关键路径边容量的初始布线和基于Agent技术的拆线重布两部分组成,仿真实验表明,该算法是有效的。