Skip to main content
Erschienen in: Wireless Personal Communications 2/2015

01.01.2015

A Modified Optimally Quantized Offset Min-Sum Decoding Algorithm for Low-Complexity LDPC Decoder

verfasst von: Michaelraj Kingston Roberts, Ramesh Jayabalan

Erschienen in: Wireless Personal Communications | Ausgabe 2/2015

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper, A Modified Optimally Quantized Offset Min-Sum Decoding Algorithm for low complexity, low-density parity-check decoder is proposed. In the proposed algorithm, more effective adjustment for the check node and variable node updating process is achieved by introducing optimally quantized adaptive offset correction factors. Unlike the conventional Offset Min-Sum algorithm and its variants, the offset correction factor of the proposed algorithm can self adapt itself according to the state of both the check node and variable node during each iteration. Simulation results show that the proposed decoding algorithm achieves significant coding gain improvement over other Min-Sum algorithms without additional hardware complexity. In addition to the coding gain improvement, the proposed algorithm can reducing up to 8–14 % of the decoding iterations required to correct the channel errors at relatively low Signal-to-noise ratio. Furthermore, in the proposed algorithm the finite word length effects are reduced by utilizing a 6-bit non-uniform quantization scheme. The proposed algorithm with a 6-bit non-uniform quantization scheme is shown to achieve about 21.6 % reduction in the total number of memory bits required to store the processed data without degradation in the decoding performance.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
2.
Zurück zum Zitat Luby, M. G., Mitzenmacher, M., Shokrollahi, M. A., & Spielman, D. A. (2001). Improved low-density parity-check codes using irregular graphs. IEEE Transactions on Information Theory, 47(2), 585–598.CrossRefMATHMathSciNet Luby, M. G., Mitzenmacher, M., Shokrollahi, M. A., & Spielman, D. A. (2001). Improved low-density parity-check codes using irregular graphs. IEEE Transactions on Information Theory, 47(2), 585–598.CrossRefMATHMathSciNet
3.
Zurück zum Zitat Richardson, T. J., & Urbanke, R. (2001). The capacity of low-density parity check codes under message passing decoding. IEEE Transactions on Information Theory, 47(2), 599–618.CrossRefMATHMathSciNet Richardson, T. J., & Urbanke, R. (2001). The capacity of low-density parity check codes under message passing decoding. IEEE Transactions on Information Theory, 47(2), 599–618.CrossRefMATHMathSciNet
4.
Zurück zum Zitat Anastasopoulos, A. (2001). A comparison between the sum-product and the min-sum iterative detection algorithms based on density evolution. In IEEE global telecommunication conference, 2001 GLOBECOM ’01, (pp. 1021–1025) IEEE. Anastasopoulos, A. (2001). A comparison between the sum-product and the min-sum iterative detection algorithms based on density evolution. In IEEE global telecommunication conference, 2001 GLOBECOM ’01, (pp. 1021–1025) IEEE.
5.
Zurück zum Zitat Fossorier, M., Mihalijevic, M., & Imai, H. (1999). Reduced complexity iterative decoding of low-density parity-check codes based on belief propagation. IEEE Transactions on Communications, 47(5), 673–680.CrossRef Fossorier, M., Mihalijevic, M., & Imai, H. (1999). Reduced complexity iterative decoding of low-density parity-check codes based on belief propagation. IEEE Transactions on Communications, 47(5), 673–680.CrossRef
6.
Zurück zum Zitat Fang, Y., Chen, P., Wang, L., & Lau, F. (2012). Design of protograph LDPC codes for partial response channels. IEEE Transactions on Communications, 60(10), 2809–2819.CrossRef Fang, Y., Chen, P., Wang, L., & Lau, F. (2012). Design of protograph LDPC codes for partial response channels. IEEE Transactions on Communications, 60(10), 2809–2819.CrossRef
7.
Zurück zum Zitat Varnica, N., & Kavcic, A. (2003). Optimized low-density parity-check codes for partial response channels. IEEE Communication Letters, 7(4), 168–170.CrossRef Varnica, N., & Kavcic, A. (2003). Optimized low-density parity-check codes for partial response channels. IEEE Communication Letters, 7(4), 168–170.CrossRef
8.
Zurück zum Zitat Chen, J., & Fossorier, M. P. C. (2002). Near-optimum universal belief propagation based decoding of low density parity check codes. IEEE Transactions on Communications, 50(3), 406–414.CrossRef Chen, J., & Fossorier, M. P. C. (2002). Near-optimum universal belief propagation based decoding of low density parity check codes. IEEE Transactions on Communications, 50(3), 406–414.CrossRef
9.
Zurück zum Zitat Chen, J., Dholakia, A., Eleftheriou, E., Fossorier, M. P. C., & Hu, X. Y. (2005). Reduced complexity decoding of LDPC codes. IEEE Transactions on Communications, 53(8), 1288–1299.CrossRef Chen, J., Dholakia, A., Eleftheriou, E., Fossorier, M. P. C., & Hu, X. Y. (2005). Reduced complexity decoding of LDPC codes. IEEE Transactions on Communications, 53(8), 1288–1299.CrossRef
10.
Zurück zum Zitat Zhang, J., Fossorier, M., & Gu, D. (2006). Two-dimensional correction for min-sum decoding of irregular LDPC codes. IEEE Transactions on Communication Letters, 10(3), 180–182.CrossRef Zhang, J., Fossorier, M., & Gu, D. (2006). Two-dimensional correction for min-sum decoding of irregular LDPC codes. IEEE Transactions on Communication Letters, 10(3), 180–182.CrossRef
11.
Zurück zum Zitat Ming, Jiang, Chunming, Zhao, Li, Zhang, & Enyang, Xu. (2006). Adaptive Offset min-sum algorithm for low-density parity check codes. IEEE Communication Letters, 10(6), 483–485.CrossRef Ming, Jiang, Chunming, Zhao, Li, Zhang, & Enyang, Xu. (2006). Adaptive Offset min-sum algorithm for low-density parity check codes. IEEE Communication Letters, 10(6), 483–485.CrossRef
12.
Zurück zum Zitat Zarubica, R., Hinton, R., Wilson, S. G., & Hall, E. K. (2008). Efficient quantization schemes for LDPC decoders. In IEEE conference on military communications, 2008 MIL COM’08, (pp. 1–5) IEEE. Zarubica, R., Hinton, R., Wilson, S. G., & Hall, E. K. (2008). Efficient quantization schemes for LDPC decoders. In IEEE conference on military communications, 2008 MIL COM’08, (pp. 1–5) IEEE.
13.
Zurück zum Zitat Howard, S.L., Schmidt, G., Bossert, M., & Costa, E. (2005). A degree-matched check node approximation for LDPC decoding. In IEEE international symposium on information theory, 2005 (pp. 1131–1135) IEEE. Howard, S.L., Schmidt, G., Bossert, M., & Costa, E. (2005). A degree-matched check node approximation for LDPC decoding. In IEEE international symposium on information theory, 2005 (pp. 1131–1135) IEEE.
14.
Zurück zum Zitat Masera, G., Quaglio, F., & Vacca, F. (2005). Finite precision implementation of LDPC decoders. IEE Transations on Communications, 152(6), 1098–1102. Masera, G., Quaglio, F., & Vacca, F. (2005). Finite precision implementation of LDPC decoders. IEE Transations on Communications, 152(6), 1098–1102.
15.
Zurück zum Zitat IEEE P802.11 wireless LANs TGn Sync Proposal: TGnSync Proposal Technical Specification, IEEE 11–04-0889-06-000n, May 2005. IEEE P802.11 wireless LANs TGn Sync Proposal: TGnSync Proposal Technical Specification, IEEE 11–04-0889-06-000n, May 2005.
Metadaten
Titel
A Modified Optimally Quantized Offset Min-Sum Decoding Algorithm for Low-Complexity LDPC Decoder
verfasst von
Michaelraj Kingston Roberts
Ramesh Jayabalan
Publikationsdatum
01.01.2015
Verlag
Springer US
Erschienen in
Wireless Personal Communications / Ausgabe 2/2015
Print ISSN: 0929-6212
Elektronische ISSN: 1572-834X
DOI
https://doi.org/10.1007/s11277-014-2026-2

Weitere Artikel der Ausgabe 2/2015

Wireless Personal Communications 2/2015 Zur Ausgabe

Neuer Inhalt