DocumentCode
1823179
Title
The SPC technique and low complexity turbo codes
Author
Ping, Li
Author_Institution
Dept. of EE, City Univ. of Hong Kong, Hong Kong
Volume
5
fYear
1999
fDate
1999
Firstpage
2592
Abstract
This paper proposes a family of modified turbo codes, referred to as single parity check (SPC) turbo codes. The decoding cost, in terms of both operation number and storage usage, of the proposed scheme is significantly lower (5-10 times) than the standard turbo codes with similar performance. The scheme can also be used to alleviate the error floor problem and is very flexible for median to high rate code designs.
Keywords
computational complexity; concatenated codes; convolutional codes; iterative decoding; turbo codes; APP decoding; SPC codes; a posteriori probability decoding; error floor problem; iterative decoding; low complexity; multidimensional concatenation; single parity check codes; turbo codes; Code standards; Convolutional codes; Costs; Decoding; Encoding; Parity check codes; Termination of employment; Turbo codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 1999. GLOBECOM '99
Print_ISBN
0-7803-5796-5
Type
conf
DOI
10.1109/GLOCOM.1999.831769
Filename
831769
Link To Document