Performance characteristics of parallel SOVA Algorithm
Turbo coding is a powerful encoding and decoding technique that can provide highly reliable data transmission at extremely low signal-to-noise ratio. According to the computational complexity/delay of the employed decoding algorithms, such as maximum a posteriori algorithm (MAP), log maximum a poste...
Saved in:
| Published in: | I-Manager's Journal on Future Engineering and Technology Vol. 2; no. 3; pp. 63 - 71 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Nagercoil
iManager Publications
01.02.2007
|
| Subjects: | |
| ISSN: | 0973-2632, 2230-7184 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Turbo coding is a powerful encoding and decoding technique that can provide highly reliable data transmission at extremely low signal-to-noise ratio. According to the computational complexity/delay of the employed decoding algorithms, such as maximum a posteriori algorithm (MAP), log maximum a posteriori algorithm (Log-MAP) and Soft Output Viterbi Algorithm (SOVA), the realization of turbo decoders usually takes a large amount of memory space and potentially long decoding delay. Therefore, an efficient method to reduce decoding complexity/delay becomes one of the key factors toward successfully designing turbo decoders. In this paper, reducing decoding complexity/delay of turbo decoding algorithms is approached by parallel SOVA (T-SOVA) scheme. The best schemes are presented for various variables considering trade-off between decoder performance and complexity. This method will reduce the decoding complexity/delay by at least 50% without big impact on the system performance. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
| ISSN: | 0973-2632 2230-7184 |
| DOI: | 10.26634/jfet.2.3.826 |