Abstract
Turbo coding is a powerful encoding and decoding technique that can provide highly reliable data transmission at extremely low signal-to-noise ratios. According to the computational complexity of the employed decoding algorithm, the realization of turbo decoders usually takes a large amount of memory spaces and potentially long decoding delay. Therefore, an efficient memory management strategy becomes one of the key factors toward successfully designing turbo decoders. This paper focuses on the development of general formulas for efficient memory management of turbo decoders employing the sliding-window BCJR algorithm. Three simple but general results are presented to evaluate the required memory size, throughput rate, and latency based on the speed and the number of adopted processors. The results thus provide useful and general information on practical implementations of turbo decoders.
| Original language | English |
|---|---|
| Journal | Proceedings - IEEE International Symposium on Circuits and Systems |
| Volume | 5 |
| Publication status | Published - 2002 Jan 1 |
| Event | 2002 IEEE International Symposium on Circuits and Systems - Phoenix, AZ, United States Duration: 2002 May 26 → 2002 May 29 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering
Cite this
}
Memory arrangements in turbo decoders using sliding-window BCJR algorithm. / Wu, Chien Ming; Shieh, Ming-Der; Wu, Chien Hsing.
In: Proceedings - IEEE International Symposium on Circuits and Systems, Vol. 5, 01.01.2002.Research output: Contribution to journal › Conference article
TY - JOUR
T1 - Memory arrangements in turbo decoders using sliding-window BCJR algorithm
AU - Wu, Chien Ming
AU - Shieh, Ming-Der
AU - Wu, Chien Hsing
PY - 2002/1/1
Y1 - 2002/1/1
N2 - Turbo coding is a powerful encoding and decoding technique that can provide highly reliable data transmission at extremely low signal-to-noise ratios. According to the computational complexity of the employed decoding algorithm, the realization of turbo decoders usually takes a large amount of memory spaces and potentially long decoding delay. Therefore, an efficient memory management strategy becomes one of the key factors toward successfully designing turbo decoders. This paper focuses on the development of general formulas for efficient memory management of turbo decoders employing the sliding-window BCJR algorithm. Three simple but general results are presented to evaluate the required memory size, throughput rate, and latency based on the speed and the number of adopted processors. The results thus provide useful and general information on practical implementations of turbo decoders.
AB - Turbo coding is a powerful encoding and decoding technique that can provide highly reliable data transmission at extremely low signal-to-noise ratios. According to the computational complexity of the employed decoding algorithm, the realization of turbo decoders usually takes a large amount of memory spaces and potentially long decoding delay. Therefore, an efficient memory management strategy becomes one of the key factors toward successfully designing turbo decoders. This paper focuses on the development of general formulas for efficient memory management of turbo decoders employing the sliding-window BCJR algorithm. Three simple but general results are presented to evaluate the required memory size, throughput rate, and latency based on the speed and the number of adopted processors. The results thus provide useful and general information on practical implementations of turbo decoders.
UR - http://www.scopus.com/inward/record.url?scp=0036287911&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0036287911&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:0036287911
VL - 5
JO - Proceedings - IEEE International Symposium on Circuits and Systems
JF - Proceedings - IEEE International Symposium on Circuits and Systems
SN - 0271-4310
ER -