Low Latency Algorithms for Iterative Codes

  • 최석순 (한국해양대학교 전파공학과 위성통신연구실) ;
  • 정지원 (한국해양대학교 전파공학과 위성통신연구실) ;
  • 배종태 (한국해양대학교 전파공학과 위성통신연구실) ;
  • 김민혁 (한국해양대학교 전파공학과 위성통신연구실) ;
  • 최은아 (한국전자통신연구원 광대역 무선 멀티미디어연구팀)
  • Published : 2007.03.31

Abstract

This paper presents low latency and/or computation algorithms of iterative codes of turbo codes, turbo product codes and low density parity check codes for use in wireless broadband communication systems. Due to high coding complexity of iterative codes, this paper focus on lower complexity and/or latency algorithms that are easily implementable in hardware and further accelerate the decoding speed.

Keywords

References

  1. C. Berrou, A. Glavieux, and P.Thitimajshima, 'Near Shannon Limit Error-Correcting Code and Decoding : Turbo Codes', IEEE Trans. Commun., vol. 44, pp.1261-1271,1998 https://doi.org/10.1109/26.539767
  2. D. J. C. Mackay and R. M. Neal, 'Near Shannon Limit Performance of Low-Density Parity-Check Codes,'Electron. Letter, Vol.32, PP. 1645-1646,Aug.1996 https://doi.org/10.1049/el:19961141
  3. R.M. Pyndiah, 'Near-optimum decoding of product codes: Block turbo codes,' IEEE Trans. Commun., vol. 46, pp1003-1010, Aug. 1998 https://doi.org/10.1109/26.705396
  4. S.S. Pietroloon, 'Implementation and Performance of a Turbo/MAP Decoder', International Journal of Satellite Communication vol. 16, pp.23-46, 1998 https://doi.org/10.1002/(SICI)1099-1247(199801/02)16:1<23::AID-SAT590>3.0.CO;2-W
  5. J.Zhang and M.Fossorier, ' Shuffled Belief Propagation Decoding,' IEEE Trans. Commun., Feb. 2005
  6. D.Chase, 'A class of algorithms for decoding block codes with channel measurement information,' IEEE Trans.Inform. Theory, vol. IT-18,pp.170-182,Jan.1972