Power-efficient decoder implementation based on state transparent convolutional codes

被引:6
作者
Shiau, Y. -H. [1 ]
Yang, H. -Y. [2 ]
Chen, P. -Y. [2 ]
Huang, S. -G. [2 ]
机构
[1] Natl Yunlin Univ Sci & Technol, Dept Elect Engn, Touliu, Taiwan
[2] Natl Cheng Kung Univ, Dept Comp Sci & Informat Engn, Tainan 70101, Taiwan
关键词
LIKELIHOOD SEQUENCE DETECTION; ADAPTIVE VITERBI DECODER; REGISTER-EXCHANGE; DESIGN;
D O I
10.1049/iet-cds.2011.0055
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this study, a power-efficient very large-scale integration (VLSI) implementation for the convolutional code decoder is presented. Based on the state transparent convolutional code definition, the receiving codewords are classified into non-erroneous and erroneous segments separately. Different from the conventional Viterbi decoder (VD), the authors use a low-complexity decoder, denoted as bit reverse decoder, to recover the non-erroneous segments using reverse operation with a little power consumption and present the segment-based VD to decode the erroneous codeword segments. Then, the clock-gating technique is employed to switch between segment-based VD and bit reverse decoder for power saving. To further reduce the power consumption, the authors group registers into several segments in the survivor memory unit of the segment-based VD and also apply clock gating to each segment individually. According to the number of consecutive erroneous codeword segments, the corresponding numbers of register segments in the survivor memory unit are enabled and other register segments are clock-gated to reduce the switching activities. Besides, our design determines the start and terminal states of the survivor path to obtain correct results of erroneous segments without bit-error rate degradation. As compared with other decoders, our design requires less power without decreasing the decoding performance.
引用
收藏
页码:227 / 234
页数:8
相关论文
共 17 条
[1]   LIMITED SEARCH TRELLIS DECODING OF CONVOLUTIONAL-CODES [J].
ANDERSON, JB .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (05) :944-955
[2]   Breadth-first maximum-likelihood sequence detection: Geometry [J].
Aulin, TA .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2003, 51 (12) :2071-2080
[3]   Breadth-first maximum likelihood sequence detection: Basics [J].
Aulin, TM .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1999, 47 (02) :208-216
[4]   Adaptive Viterbi decoding of convolutional codes over memoryless channels [J].
Chan, F ;
Haccoun, D .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1997, 45 (11) :1389-1400
[5]   An area-efficient variable length decoder IP core design for MPEG-1/2/4 video coding applications [J].
Chien, Chih-Da ;
Lu, Keng-Po ;
Chen, Yu-Min ;
Guo, Jiun-In ;
Chu, Yuan-Sun ;
Su, Ching-Lung .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2006, 16 (09) :1172-1178
[6]  
ELIAS P, 1954, IEEE T INFORM THEORY, V4, P29
[7]   Low-power limited-search parallel state Viterbi decoder implementation based on scarce state transition [J].
Jin, Jie ;
Tsui, Chi-Ying .
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2007, 15 (10) :1172-1176
[8]   Survivor path processing in Viterbi decoders using register exchange and traceforward [J].
Kamuf, Matthias ;
Owall, Viktor ;
Anderson, John B. .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2007, 54 (06) :537-541
[9]   Low-power Viterbi decoder for CDMA mobile terminals [J].
Kang, IY ;
Willson, AN .
IEEE JOURNAL OF SOLID-STATE CIRCUITS, 1998, 33 (03) :473-482
[10]  
Lin Dahua., 2007, P IEEE C COMPUTER VI, P1