DocumentCode
2079286
Title
Repeat-accumulate codes for block-fading channels
Author
Kadel, R. ; Lechner, Gottfried
Author_Institution
Univ. of South Australia, Adelaide, SA, Australia
fYear
2013
fDate
Jan. 29 2013-Feb. 1 2013
Firstpage
37
Lastpage
42
Abstract
We design systematic and regular repeat-accumulate (RA) codes for non-ergodic block-fading channels. An encoder structure of RA codes for block-fading channels with an arbitrary number of fading blocks is proposed. Simulation results show that the proposed RA codes achieve full-diversity word error rate (WER) performance over block-fading channels. In addition, the WER performance of the proposed RA codes is superior to the root-low-density parity-check (LDPC) and repeat and blockwise accumulate (RBA) codes. Furthermore, the gap from the outage probability remains constant with increasing block length for the proposed RA codes. Besides an easy encoding structure, the proposed RA codes have notably less ones in the parity-check matrix compared to corresponding root-LDPC codes. Therefore, the decoding complexity of the proposed RA codes is significantly less than the corresponding root-LDPC codes.
Keywords
block codes; channel coding; decoding; fading channels; parity check codes; probability; LDPC codes; RA codes; WER performance; block length; decoding complexity; encoder structure; full-diversity word error rate; nonergodic block-fading channels; outage probability; parity-check matrix; regular repeat-accumulate codes; repeat and blockwise accumulate codes; root-low-density parity-check codes; Decoding; Encoding; Error analysis; Fading; Parity check codes; Repeaters; Systematics;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications Theory Workshop (AusCTW), 2013 Australian
Conference_Location
Adelaide, SA
Print_ISBN
978-1-4673-4673-3
Electronic_ISBN
978-1-4673-4674-0
Type
conf
DOI
10.1109/AusCTW.2013.6510041
Filename
6510041
Link To Document