0.13μm CMOS下的1000Base-T联合解码均衡器

分析了0.13 μm CMOS工艺下适合于IEEE 802.3 ab标准1000Base-T千兆以太网收发器的联合解码均衡器结构。通过分析适用于1000 Base-T的超前计算技术,对超前计算结构进行了优化,降低了现有联合解码均衡器在0.13 μm工艺下的硬件复杂度。通过物理设计确定了优化的联合解码均衡器的算法与结构。优化后,14抽头MA4在0.13 μm工艺下门数减少了8.7 k,约9%,14抽头并行判决反馈解码器门数减少了9.5 k,约6%。     

字符二维码的编码模式选择算法

字符二维码的编码通过针对特定字符集划分模式来编码, 各个模式之间需要转换以达到最高的编码效率. 首先研究DataMatrix国际标准“向前检验”算法, 发现“向前检验”算法具有局限性, 并不能直接应用与字符二维码的模式选择. 因此, 本文在“向前检验”的基础上, 结合了多阶段决策方法的原理, 引入混合模式计数的方法, 提出了一种字符二维码的“向前检验”算法, 并应用于字符二维码的模式选择. 实验表明, 该算法有效的进行了字符二维码的模式选择, 很好的解决字符二维码的模式选择问题.     

Smooth feedrate planning for continuous short line tool path with contour error constraint

In the machining program for free form surfaces, the tool path is usually represented as continuous short lines. For the computer numerical control, the feedrate profile for short line tool path should be smooth and optimized in order to achieve high machining quality and high speed. In high speed machining, the feedrate profile also has a strong influence on contour accuracy. This paper presents a new real-time smooth feedrate planning algorithm for short line tool path, in which the contour error constraint is included. To realize contour error control, the feedrate is adaptively adjusted based on the curvature radius of the tool path, which is directly estimated from the short lines. The 7-phase jerk-limited look-ahead planning is employed to generate a smooth feedrate profile. The target feedrate filter (TFF) and planning units merging techniques are developed to improve the smoothness of the feedrate profile and reduce the overhead on look-ahead. The advantage of the proposed algorithm is that it is not only convenient to achieve the balance among accuracy, smoothness and productivity by adjusting parameters, but also efficient in design, which makes it possible to be implemented on low cost hardware platforms. Experiment results demonstrate the feasibility of the proposed algorithm on smooth feedrate planning and contour error control for continuous short line tool path.     

基于多词汇树的对话语音识别搜索策略

在查询类对话语音识别系统中,词汇中的少数几类词往往占有词汇量的很大部分,利用这一重要特点,可以对传统的基于单树结构的搜索算法进行改进。本文在采用基于类的语言模型的条件下,在查询类对话语音识别系统中,对词汇中的若干大类单独建树,从而免除了多数词汇的语言模型look-ahead计算时间和存储空间,并实现了语言分的提前精确运用。针对机票预订口语对话系统的实验表明,该搜索策略与单树方法相比,在同样的计算资源条件下,时间效率有显著提高。     

High-performance, low-cost joint equalizer and trellis decoder for 1000BASE-T gigabit Ethernet transceiver

This article presents an M-algorithm (MA) decoder with 4 survival paths (MA4) for Institute of Electrical and Electronics Engineers (IEEE) 802.3ab 1000BASE-T gigabit Ethernet (GbE) transceiver. To fulfill the entire requirements, various methods were introduced to accelerate the MA4 decoder while retaining the desired high performance and low complexity. Optimized look-ahead architecture was employed to solve the critical path problem with minimal gate consumption. Symbol compression methods saved registers during pipeline stages. A sorting network accelerated the kernel sorting operation at low hardware cost by utilizing the special characteristics of MA4. Simulations and synthesis results show that the proposed decoder achieves 125 MHz clock frequency and 1 Gb/s throughput in 1.8 V 0.18 μm standard cell complementary metal-oxide-semiconductor (CMOS) process. It achieves additional 0.4 dB coding gain over 14tap parallel decision feedback decoder (PDFD) with 39% area reduction.     

性能改进的16位超前进位加法器

加法运算是最重要最基本的运算,所有的其他基本算术运算,减、乘、除、模乘运算最终都能归结为加法运算。在不同的场合使用的加法器对其要求也不同,有的要求速度更快,有的要求面积更小。基于速度更快的要求,对3种常用加法器从结构与性能上进行比较,给出了综合面积与速度的比较。进而对超前进位加法器进行了进一步改进,加入了流水线结构设计,大大提高了其速度性能。     

高速高精度CORDIC处理器的ASIC实现

针对数字信号处理领域复数运算的要求,实现了一种16位高速高精度复数运算的通用CORDIC处理器。电路采用半定制设计流程,在200M时钟频率下通过Nanosim后仿真表明,电路达到了高速高精度的设计要求。可广泛应用于雷达、信号处理、通信等涉及到复数运算的领域。     

基于干涉预处理的NURBS曲线前瞻插补算法

鉴于直接自适应插补容易在加工过程中引起较大的速度波动,而按曲率极值点对NURBS曲线进行分段插补造成加减速过程中加速度和加加速度超限,提出一种基于干涉预处理的非均匀有理B样条曲线前瞻控制插补算法。首先对曲线进行自适应处理,得到各自适应插补点的运动参数;然后找出其中加速度或加加速度超限的点(即危险点),并对这些点的速度进行前瞻控制,根据前瞻控制信息对相邻危险点进行干涉处理,最终得到用来对曲线分段的危险点信息和相应的控制策略;最后根据各危险点之间的干涉类型对曲线进行实时插补。仿真实验表明,该算法能够在保证加工精度的前提下,实现进给速度的平滑过渡,并且能够保证加速度和加加速度不超限。     

一种优化的NURBS曲线插补算法

为弥补目前非均匀有理B样条插补算法的不足,提出一种优化的非均匀有理B样条曲线插补算法。算法采用插补前S曲线加减速方法,不仅优化了前瞻过程,而且在回溯过程中考虑了短样条的情况。算法对长样条和短样条非均匀有理B样条曲线能用统一的方法进行插补,通过引入环形缓冲区和预插补(非离线),提高了加工效率,同时合理地安排插补任务增强了系统的实时性。通过MATLAB仿真,验证了算法的有效性。     

A Look-Ahead Routing Procedure for Machine Selection in a Highly Informative Manufacturing System

Many dispatching rules have been developed for the on-line control of product flow in a job shop. The introduction of a highly informative manufacturing system (HIMS) has added a new requirement to a classical job-shop control problem: the selection of machines by parts of different types. An HIMS can keep a great deal of information on the status of the system, such as information on what is scheduled in the near future with great accuracy, which can be used for shop floor control. For example, the knowledge of the time when the next parts arrive at the machines can be used for better routing. This article tests the effect of the use of this knowledge for part routing on the part's flow time and tardiness under a look-ahead routing procedure (LARP). LARP assigns a new part to a machine so that the assignment minimizes the flow time or tardiness of the current part and the next N parts arriving after the current part. A test shows that the reduction of part flow time is up to 11% and the reduction of tardiness is up to 21% for the cases with this procedure.