A Low-Complexity Viterbi Decoder for Space-Time Trellis Codes

被引：11

作者：

Shr, Kai-Ting ^{[1
]}

Chen, Hong-Du ^{[2
]}

Huang, Yuan-Hao ^{[2
]}

机构：

[1] Natl Tsing Hua Univ, Dept Elect Engn, Hsinchu 30013, Taiwan

[2] Natl Tsing Hua Univ, Inst Commun Engn, Hsinchu 30013, Taiwan

来源：

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS | 2010年 / 57卷 / 04期

关键词：

Branch metrics; MIMO; space-time trellis code; Viterbi decoder; WIRELESS COMMUNICATION; POWER; DIVERSITY; IMPLEMENTATION; OPTIMIZATION; DESIGN;

D O I：

10.1109/TCSI.2009.2027648

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Space-time trellis code (STTC) has been widely applied to coded multiple-input multiple-output (MIMO) systems because of its gains in coding and diversity; however, its great decoding complexity makes it less promising in chip realization compared to the space-time block code (STBC). The complexity of STTC decoding lies in the branch metric calculation in the Viterbi algorithm and increases significantly along with the number of antennas and the modulation order. Consequently, a low-complexity algorithm to mitigate the computational burden is proposed. The results show that more than 70%, 78%, and 83% of the computational complexity is reduced for 2 x 2, 3 x 3, and 4 x 4 MIMO configurations, respectively. Based on the proposed algorithm, a reconfigurable MISO STTC Viterbi decoder is designed and implemented using 0.18 mu m 1P6M CMOS technology. The decoder achieves 11.14 Mbps, 8.36 Mbps, and 5.75 Mbps for 4-PSK, 8-PSK, and 16-QAM modulations, respectively.

引用

页码：873 / 885

页数：13

共 50 条

[1] Low-complexity branch metric calculation for decoding of space-time trellis codes
Shr, Kai-Ting
Huang, Yuan-Hao
TENCON 2007 - 2007 IEEE REGION 10 CONFERENCE, VOLS 1-3, 2007, : 220 - +
[2] Low-complexity optical space-time trellis code
Wang H.
Xiao B.
Jia F.
Cao M.
Sun J.
1600, Chinese Optical Society (36):
[3] A suboptimum iterative decoder for space-time trellis codes
Tarable, A
Montorsi, G
Benedetto, S
2004 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-7, 2004, : 3000 - 3004
[4] Improved space-time codes with low-complexity decoders
Yu, Xinying
Hughes, Brian L.
2005 39TH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, VOLS 1 AND 2, 2005, : 1263 - 1267
[5] Iterative decoding of low-complexity space-time codes
Sezgin, A
Boche, H
PIMRC 2003: 14TH IEEE 2003 INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS PROCEEDINGS, VOLS 1-3 2003, 2003, : 1683 - 1687
[6] LOW-COMPLEXITY VITERBI DECODER FOR CONVOLUTIONAL CODES IN CLASS-A NOISE
Saleh, Tarik Shehata
Marsland, Ian
El-Tanany, Mohamed
2012 25TH IEEE CANADIAN CONFERENCE ON ELECTRICAL & COMPUTER ENGINEERING (CCECE), 2012,
[7] Low-complexity branch metric calculation for space-time trellis decoding
Shr, Kai-Ting
Huang, Yuan-Hao
2007 ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS, 2007, : 73 - 76
[8] Space-Frequency Codes Based on the Space-Time Codes With Very Low Complexity for the Decoder
Shahabinejad, Mostafa
Hosseini, Fatemeh G.
Talebi, Siamak
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2013, 62 (09) : 4678 - 4684
[9] Low-complexity error selective Viterbi decoder
Sudhakar, R
Mukhtar, A
Gu, ZZ
ELECTRONICS LETTERS, 2000, 36 (02) : 147 - 148
[10] Low-Complexity Space-Time Codes for High and Low-Priority Streams
Stauffer, Erik
Hochwald, Bertrand
2009 INFORMATION THEORY AND APPLICATIONS WORKSHOP, 2009, : 138 - 146

← 1 2 3 4 5 →