Low-Complexity Decoding of Block Turbo-Coded System with Antenna Diversity
<p/> <p>The goal of this paper is to reduce the decoding complexity of space-time block turbo-coded system with low performance degradation. Two block turbo-coded systems with antenna diversity are considered. These include the simple serial concatenation of error control code with space...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2003-01-01
|
| Series: | EURASIP Journal on Advances in Signal Processing |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S1110865703305116 |
| _version_ | 1818368480869613568 |
|---|---|
| author | Chen Yanni Parhi Keshab K |
| author_facet | Chen Yanni Parhi Keshab K |
| author_sort | Chen Yanni |
| collection | DOAJ |
| description | <p/> <p>The goal of this paper is to reduce the decoding complexity of space-time block turbo-coded system with low performance degradation. Two block turbo-coded systems with antenna diversity are considered. These include the simple serial concatenation of error control code with space-time block code, and the recently proposed transmit antenna diversity scheme using forward error correction techniques. It is shown that the former performs better when compared to the latter in terms of bit error rate (BER) under the same spectral efficiency (up to 7 dB at the BER of <inline-formula><graphic file="1687-6180-2003-714697-i1.gif"/></inline-formula> for quasistatic channel with two transmit and two receive antennas). For the former system, a computationally efficient decoding approach is proposed for the soft decoding of space-time block code. Compared to its original maximum likelihood decoding algorithm, it can reduce the computation by up to 70% without any performance degradation. Additionally, for the considered outer code block turbo code, through reduction of test patterns scanned in the Chase algorithm and the alternative computation of its extrinsic information during iterative decoding, extra 0.3 dB to 0.4 dB coding gain is obtained if compared with previous approaches with negligible hardware overhead. The overall decoding complexity is approximately ten times less than that of the near-optimum block turbo decoder with coding gain loss of 0.5 dB at the BER of <inline-formula><graphic file="1687-6180-2003-714697-i2.gif"/></inline-formula> over AWGN channel.</p> |
| first_indexed | 2024-12-13T23:08:37Z |
| format | Article |
| id | doaj.art-518f71eb8a194fb987428a3d7fcc6c10 |
| institution | Directory Open Access Journal |
| issn | 1687-6172 1687-6180 |
| language | English |
| last_indexed | 2024-12-13T23:08:37Z |
| publishDate | 2003-01-01 |
| publisher | SpringerOpen |
| record_format | Article |
| series | EURASIP Journal on Advances in Signal Processing |
| spelling | doaj.art-518f71eb8a194fb987428a3d7fcc6c102022-12-21T23:28:10ZengSpringerOpenEURASIP Journal on Advances in Signal Processing1687-61721687-61802003-01-01200313714697Low-Complexity Decoding of Block Turbo-Coded System with Antenna DiversityChen YanniParhi Keshab K<p/> <p>The goal of this paper is to reduce the decoding complexity of space-time block turbo-coded system with low performance degradation. Two block turbo-coded systems with antenna diversity are considered. These include the simple serial concatenation of error control code with space-time block code, and the recently proposed transmit antenna diversity scheme using forward error correction techniques. It is shown that the former performs better when compared to the latter in terms of bit error rate (BER) under the same spectral efficiency (up to 7 dB at the BER of <inline-formula><graphic file="1687-6180-2003-714697-i1.gif"/></inline-formula> for quasistatic channel with two transmit and two receive antennas). For the former system, a computationally efficient decoding approach is proposed for the soft decoding of space-time block code. Compared to its original maximum likelihood decoding algorithm, it can reduce the computation by up to 70% without any performance degradation. Additionally, for the considered outer code block turbo code, through reduction of test patterns scanned in the Chase algorithm and the alternative computation of its extrinsic information during iterative decoding, extra 0.3 dB to 0.4 dB coding gain is obtained if compared with previous approaches with negligible hardware overhead. The overall decoding complexity is approximately ten times less than that of the near-optimum block turbo decoder with coding gain loss of 0.5 dB at the BER of <inline-formula><graphic file="1687-6180-2003-714697-i2.gif"/></inline-formula> over AWGN channel.</p>http://dx.doi.org/10.1155/S1110865703305116block turbo codespace-time block codelow-complexity decodingsoft decoding |
| spellingShingle | Chen Yanni Parhi Keshab K Low-Complexity Decoding of Block Turbo-Coded System with Antenna Diversity EURASIP Journal on Advances in Signal Processing block turbo code space-time block code low-complexity decoding soft decoding |
| title | Low-Complexity Decoding of Block Turbo-Coded System with Antenna Diversity |
| title_full | Low-Complexity Decoding of Block Turbo-Coded System with Antenna Diversity |
| title_fullStr | Low-Complexity Decoding of Block Turbo-Coded System with Antenna Diversity |
| title_full_unstemmed | Low-Complexity Decoding of Block Turbo-Coded System with Antenna Diversity |
| title_short | Low-Complexity Decoding of Block Turbo-Coded System with Antenna Diversity |
| title_sort | low complexity decoding of block turbo coded system with antenna diversity |
| topic | block turbo code space-time block code low-complexity decoding soft decoding |
| url | http://dx.doi.org/10.1155/S1110865703305116 |
| work_keys_str_mv | AT chenyanni lowcomplexitydecodingofblockturbocodedsystemwithantennadiversity AT parhikeshabk lowcomplexitydecodingofblockturbocodedsystemwithantennadiversity |