Challenges and Limitations for Very High Throughput Decoder Architectures for Soft-Decoding

  • Norbert Wehn
  • Stefan Scholl
  • Philipp Schläfer
  • Timo Lehnigk-Emden
  • Matthias Alles
Chapter
First Online:

Abstract

In modern communications systems the required data rates are continuously increasing. Especially consumer electronic applications like video on demand, IP-TV, or video chat require large amounts of bandwidth. Already today’s applications require throughputs in the order of Gigabits per second and very short latency. Current mobile communications systems achieve 1 Gbit/s (LTE [1]) and wired transmission enables even higher data rates of 10 Gbit/s (e.g., Thunderbolt [2], Infiniband [3]) up to 100 Gbit/s. For the future it is clearly expected that even higher data rates become necessary. Early results show throughputs in the order of 100 Tbit/s [4] for optical fiber transmissions.

Keywords

Clock Cycle LDPC Code Turbo Code Parity Check Matrix Frame Error Rate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Notes

Acknowledgements

This work has been supported by the Deutsche Forschungsgemeinschaft (DFG) within the projects “Entwicklung und Implementierung effizienter Decodieralgorithmen für lineare Blockcodes” and “Optimierung von 100 Gb/s Nahbereichs Funktransceivern unter Berücksichtigung von Grenzen für die Leistungsaufnahme.”

References

  1. 1.
    Third Generation Partnership Project (2010) 3GPP TS 36.212 V10.0.0; 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and channel coding (Release 10)Google Scholar
  2. 2.
    Intel (2014) Thunderbolt. URL http://www.thunderbolttechnology.net
  3. 3.
    Infiniband Association (2014). URL http://www.infinibandta.org
  4. 4.
    Qian D, Huang MF, Ip E, Huang YK, Shao Y, Hu J, Wang T (2011) 101.7-Tb/s (370x294-Gb/s) PDM-128QAM-OFDM transmission over 3x55-km SSMF using pilot-based phase noise mitigation. In: Optical fiber communication conference and exposition (OFC/NFOEC), 2011 and the national fiber optic engineers conference, pp 1–3Google Scholar
  5. 5.
    Wenyi J, Fossorier M (2008) Towards maximum likelihood soft decision decoding of the (255,239) Reed Solomon code. IEEE Trans Magn 44(3):423. DOI 10.1109/TMAG.2008.916381CrossRefGoogle Scholar
  6. 6.
    Jiang J (2007) Advanced channel coding techniques using bit-level soft information. Dissertation, Texas A&M UniversityGoogle Scholar
  7. 7.
    Chase D (1972) Class of algorithms for decoding block codes with channel measurement information. IEEE Trans Inf Theory 18(1):170. DOI 10.1109/TIT.1972.1054746CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    Bellorado J, Kavcic A (2006) A low-complexity method for chase-type decoding of Reed-Solomon codes. In: Proceedings of the IEEE international information theory symposium, pp 2037–2041. DOI 10. 1109/ISIT.2006.261907Google Scholar
  9. 9.
    Koetter R, Vardy A (2003) Algebraic soft-decision decoding of Reed-Solomon codes. IEEE Trans Inf Theory 49(11):2809. DOI 10.1109/ TIT.2003.819332CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    Fossorier MPC, Lin S (1995) Soft-decision decoding of linear block codes based on ordered statistics. IEEE Trans Inf Theory 41(5):1379. DOI 10.1109/18.412683CrossRefMATHGoogle Scholar
  11. 11.
    El-Khamy M, McEliece RJ (2006) Iterative algebraic soft-decision list decoding of Reed-Solomon codes. IEEE J Sel Areas Commun 24(3):481. DOI 10.1109/JSAC.2005.862399CrossRefGoogle Scholar
  12. 12.
    An W (2010) Complete VLSI implementation of improved low complexity chase Reed-Solomon decoders. Ph.D. thesis, Massachusetts Institute of TechnologyGoogle Scholar
  13. 13.
    García-Herrero F, Valls J, Meher P (2011) High-speed RS(255, 239) decoder based on LCC decoding. Circuits Syst Signal Process 30:1643. DOI 10.1007/s00034-011-9327-4. URL http://dx.doi.org/10.1007/s00034-011-9327-4
  14. 14.
    Hsu CH, Lin YM, Chang HC, Lee CY (2011) A 2.56 Gb/s soft RS (255,239) decoder chip for optical communication systems. In: Proceedings of the ESSCIRC (ESSCIRC), pp 79–82. DOI 10.1109/ ESSCIRC.2011.6044919Google Scholar
  15. 15.
    Kan M, Okada S, Maehara T, Oguchi K, Yokokawa T, Miyauchi T (2008) Hardware implementation of soft-decision decoding for Reed-Solomon code. In: Proceedings of the 5th international symposium on turbo codes and related topics, pp 73–77. DOI 10.1109/TURBOCODING. 2008.4658675Google Scholar
  16. 16.
    Heloir R, Leroux C, Hemati S, Arzel M, Gross W (2012) Stochastic chase decoder for reed-solomon codes. In: 2012 IEEE 10th international conference on new circuits and systems (NEWCAS), pp 5–8. DOI 10.1109/NEWCAS.2012.6328942Google Scholar
  17. 17.
    Scholl S, Wehn N (2014) Hardware implementation of a Reed-Solomon soft decoder based on information set decoding. In: Proceedings of the design, automation and test in Europe (DATE ’14)Google Scholar
  18. 18.
    Ahmed A, Koetter R, Shanbhag NR (2004) Performance analysis of the adaptive parity check matrix based soft-decision decoding algorithm. In: Proceedings of the conference on signals, systems and computers record of the thirty-eighth Asilomar conference, vol 2, pp 1995–1999. DOI 10.1109/ACSSC.2004.1399514Google Scholar
  19. 19.
    Dorsch B (1974) A decoding algorithm for binary block codes andJ-ary output channels (Corresp.). IEEE Trans Inf Theory 20(3):391. DOI 10.1109/TIT.1974.1055217. URL http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1055217
  20. 20.
    Lin S, Costello DJ Jr (2004) Error control coding 2nd edn. Prentice Hall PTR, Upper Saddle RiverGoogle Scholar
  21. 21.
    Scholl S, Stumm C, Wehn N (2013) Hardware implementations of Gaussian elimination over GF(2) for channel decoding algorithms. In: Proceedings of the IEEE AFRICONGoogle Scholar
  22. 22.
    Bogdanov A, Mertens M, Paar C, Pelzl J, Rupp A (2006) A parallel hardware architecture for fast Gaussian elimination over GF(2). In: 14th annual IEEE symposium on field-programmable custom computing machines, 2006 (FCCM ’06), pp 237–248. DOI 10.1109/FCCM.2006.12Google Scholar
  23. 23.
    Kung HT, Gentleman WM (1982) Matrix triangularization by systolic arrays. Technical Report Paper 1603, Computer Science Department. URL http://repository.cmu.edu/compsci/1603
  24. 24.
    Xilinx LogiCORE IP Reed-Solomon Decoder (2013). http://www.xilinx.com/products/intellectual-property/DO-DI-RSD.htm
  25. 25.
    Bahl L, Cocke J, Jelinek F, Raviv J (1974) Optimal decoding of linear codes for minimizing symbol error rate. IEEE Trans Inf Theory IT-20:284CrossRefMathSciNetGoogle Scholar
  26. 26.
    Robertson P, Villebrun E, Hoeher P (1995) A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log-domain. In: Proceedings of the 1995 international conference on communications (ICC ’95), Seattle, Washington, 1995, pp 1009–1013Google Scholar
  27. 27.
    Thul MJ, Gilbert F, Vogt T, Kreiselmaier G, Wehn N (2005) A scalable system architecture for high-throughput turbo-decoders. J VLSI Signal Process Syst (Special Issue on Signal Processing for Broadband Communications) 39(1/2):63CrossRefMATHGoogle Scholar
  28. 28.
    Mansour MM, Shanbhag NR (2003) VLSI architectures for SISO-APP decoders. IEEE Trans Very Large Scale Integr (VLSI) Syst 11(4):627CrossRefGoogle Scholar
  29. 29.
    Dielissen J, Huiskens J (2000) State vector reduction for initialization of sliding windows MAP. In: Proceedings of the 2nd international symposium on turbo codes & related topics, Brest, France, pp 387–390Google Scholar
  30. 30.
    Schurgers C, Engels M, Catthoor F (1999) Energy efficient data transfer and storage organization for a MAP turbo decoder module. In: Proceedings of the 1999 international symposium on low power electronics and design (ISLPED ’99), San Diego, California, 1999, pp 76–81Google Scholar
  31. 31.
    Sani A, Coussy P, Chavet C (2013) A first step toward on-chip memory mapping for parallel turbo and LDPC decoders: a polynomial time mapping algorithm. IEEE Trans Signal Process 61(16):4127. DOI 10.1109/TSP.2013.2264057. URL http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=6517513
  32. 32.
    Ilnseher T, Kienle F, Weis C, Wehn N (2012) A 2.12Gbit/s turbo code decoder for LTE advanced base station applications. In: 2012 7th international symposium on turbo codes and iterative information processing (ISTC) (ISTC 2012), Gothenburg, Sweden, 2012Google Scholar
  33. 33.
    Sun Y, Cavallaro J (2010) Efficient hardware implementation of a highly-parallel 3GPP LTE/LTE-advance turbo decoder. Integr VLSI J. DOI 10.1016/j.vlsi.2010.07.001Google Scholar
  34. 34.
    May M, Ilnseher T, Wehn N, Raab W (2010) A 150Mbit/s 3GPP LTE turbo code decoder. In: Proceedings of the design, automation and test in Europe, 2010 (DATE ’10), pp 1420–1425Google Scholar
  35. 35.
    Studer C, Benkeser C, Belfanti S, Huang Q (2011) Design and implementation of a parallel turbo-decoder ASIC for 3GPP-LTE. IEEE J Solid State Circuits 46(1):8CrossRefGoogle Scholar
  36. 36.
    Gallager RG (1962) Low-density parity-check codes. IRE Trans Inf Theory 8(1):21CrossRefMATHMathSciNetGoogle Scholar
  37. 37.
    IEEE 802.3an-2006 (2006) Part 3: CSMA/CD Access Method and Physical Layer Specifications - Amendment: Physical Layer and Management Parameters for 10 Gb/s Operation, Type 10GBASE-T. IEEE 802.3an-2006Google Scholar
  38. 38.
    WiMedia Alliance (2009) Multiband OFDM Physical Layer Specification, Release Candidate 1.5Google Scholar
  39. 39.
    IEEE 802.11ad (2010) Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications - Amendment: Enhancements for Very High Throughput in the 60 GHz Band. IEEE 802.11ad-draftGoogle Scholar
  40. 40.
    Kavcic A, Patapoutian A (2008) The read channel. Proc IEEE 96(11):1761. DOI 10.1109/JPROC.2008.2004310CrossRefGoogle Scholar
  41. 41.
    Guilloud F, Boutillon E, Danger J (2003) λ-min decoding algorithm of regular and irregular LDPC codes. In: Proceedings of the 3nd international symposium on turbo codes & related topics, Brest, France, pp 451–454Google Scholar
  42. 42.
    Chen J, Dholakia A, Eleftheriou E, Fossorier MPC, Hu XY (2005) Reduced-complexity decoding of LDPC codes. IEEE Trans Commun 53(8):1288CrossRefGoogle Scholar
  43. 43.
    Schläfer P, Alles M, Weis C, Wehn N (2012) Design space of flexible multi-gigabit LDPC decoders. VLSI Des J 2012. DOI 10.1155/2012/ 942893Google Scholar
  44. 44.
    Blanksby A, Howland CJ (2002) A 690-mW 1-Gb/s, rate-1/2 low-density parity-check code decoder. IEEE J Solid State Circuits 37(3):404CrossRefGoogle Scholar
  45. 45.
    Onizawa N, Hanyu T, Gaudet V (2010) Design of high-throughput fully parallel LDPC decoders based on wire partitioning. IEEE Trans Very Large Scale Integr (VLSI) Syst 18(3):482. DOI 10.1109/TVLSI.2008. 2011360CrossRefGoogle Scholar
  46. 46.
    Schläfer P, Wehn N, Lehnigk-Emden T, Alles M (2013) A new dimension of parallelism in ultra high throughput LDPC decoding. In: IEEE workshop on signal processing systems (SIPS), Taipei, TaiwanGoogle Scholar
  47. 47.
    Weiner M, Nikolic B, Zhang Z (2011) LDPC decoder architecture for high-data rate personal-area networks. In: Proceedings of the IEEE international symposium on circuits and systems (ISCAS), pp 1784–1787. DOI 10.1109/ISCAS.2011.5937930Google Scholar
  48. 48.
    Zhang Z, Anantharam V, Wainwright M, Nikolic B (2010) An efficient 10GBASE-T ethernet LDPC decoder design with low error floors. IEEE J Solid State Circuits 45(4):843. DOI 10.1109/JSSC.2010.2042255CrossRefGoogle Scholar
  49. 49.
    Calhoun B, Brooks D (2010) Can subthreshold and near-threshold circuits go mainstream? IEEE Micro 30(4):80. DOI 10.1109/MM.2010.60CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Norbert Wehn
    • 1
  • Stefan Scholl
    • 1
  • Philipp Schläfer
    • 1
  • Timo Lehnigk-Emden
    • 2
  • Matthias Alles
    • 2
  1. 1.Microelectronic System Design Research GroupUniversity of KaiserslauternKaiserslauternGermany
  2. 2.Creonic GmbHKaiserslauternGermany

Personalised recommendations