SORTING-BASED VLSI ARCHITECTURES FOR THE M-ALGORITHM AND T-ALGORITHM TRELLIS DECODERS

被引:32
作者
BENGOUGH, PA [1 ]
SIMMONS, SJ [1 ]
机构
[1] QUEENS UNIV, DEPT ELECT & COMP ENGN, KINGSTON, ON, CANADA
基金
加拿大自然科学与工程研究理事会;
关键词
D O I
10.1109/26.380070
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The well-known M-algorithm and the newer T-algorithm are two closely related reduced-complexity trellis-search algorithms that can be used for data sequence estimation in digital communication systems. VLSI implementations of these algorithms are attractive due to the parallelism and simplicity of their operation. While a small number of VLSI structures have been proposed previously, this paper describes new sorting-based architectures that can be used to realize these algorithms. Specifically, schemes based on odd-even transposition, insertion, and weavesorting techniques are presented. Structures are evaluated on the basis of area, time, and power measures. Actual VLSI implementations have been used to verify timing models.
引用
收藏
页码:514 / 522
页数:9
相关论文
共 19 条
[11]   A MULTIPROCESSOR ARCHITECTURE FOR THE (M,L)-ALGORITHM SUITABLE FOR VLSI IMPLEMENTATION [J].
MOHAN, S ;
SOOD, AK .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1986, 34 (12) :1218-1224
[12]  
SIMMONS S, 1986, THESIS QUEENS U
[13]  
Simmons S. J., 1989, IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Conference Proceeding (Cat. No.89CH2691-4), P337, DOI 10.1109/PACRIM.1989.48371
[14]   A NONSORTING VLSI STRUCTURE FOR IMPLEMENTING THE (M, L) ALGORITHM [J].
SIMMONS, SJ .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1988, 6 (03) :538-546
[15]   BREADTH-1ST TRELLIS DECODING WITH ADAPTIVE EFFORT [J].
SIMMONS, SJ .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1990, 38 (01) :3-12
[16]  
THOMPSON CD, 1983, IEEE T COMPUT, V32, P1171, DOI 10.1109/TC.1983.1676178
[17]  
THOMPSON CO, 1980, CMUCS80140 CARN MELL
[18]  
Weste N.H.E., 1988, PRINCIPLES CMOS VLSI
[19]  
1989, ICI020R0 CAN MICR CO