On parallelized serially concatenated codes


Creative Commons License

GAZİ O., YILMAZ A.

IEEE Wireless Communications and Networking Conference, Hong Kong, PEOPLES R CHINA, 11 - 15 March 2007, pp.714-715 identifier identifier

  • Publication Type: Conference Paper / Full Text
  • Doi Number: 10.1109/wcnc.2007.137
  • City: Hong Kong
  • Country: PEOPLES R CHINA
  • Page Numbers: pp.714-715
  • Middle East Technical University Affiliated: Yes

Abstract

Serial concatenated codes show very good performance at low signal to noise ratios. However, large decoding delays due to long input frame lengths constitute a major disadvantage for these type of codes. In this study we introduce a new class of concatenated convolutional codes which are very suitable for parallel decoding, thus have much less decoding delays and also show comparable performance to that of classical serial concatenated convolutional codes. The analytical upper bound expressions for performance of the proposed structures are derived using the uniform interleaver concept.