Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 9
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

One minimum only trellis decoder for non-binary low-density parity-check codes

  • Lacruz, Jesús Omar
  • García Herrero, Francisco Miguel
  • Declercq, David
  • Valls Coquillat, Javier|||0000-0002-9390-5022
A one minimum only decoder for Trellis-EMS (OMO T-EMS) and for Trellis-Min-max (OMO T-MM) is proposed in this paper. In this novel approach, we avoid computing the second minimum in messages of the check node processor, and propose efficient estimators to infer the second minimum value. By doing so, we greatly reduce the complexity and at the same time improve latency and throughput of the derived architectures compared to the existing implementations of EMS and Min-max decoders. This solution has been applied to various NB-LDPC codes constructed over different Galois fields and with different degree distributions showing in all cases negligible performance loss compared to the ideal EMS and Min-max algorithms. In addition, two complete decoders for OMO T-EMS and OMO T-MM were implemented for the (837,726) NB-LDPC code over GF(32) for comparison proposals. A 90 nm CMOS process was applied, achieving a throughput of 711 Mbps and 818 Mbps respectively at a clock frequency of 250 MHz, with an area of 19.02 ${rm mm}^{2}$ and 16.10 ${rm mm}^{2}$ after place and route. To the best knowledge of the authors, the proposed decoders have higher throughput and area-time efficiency than any other solution for high-rate NB-LDPC codes with high Galois field order., This work was supported in part by the Spanish Ministerio de Ciencia e Innovacion under Grant TEC2011-27916 and in part by the Universitat Politecnica de Valencia under Grant PAID-06-2012-SP20120625. The work of F. Garcia-Herrero was supported by the Spanish Ministerio de Educacion under Grant AP2010-5178. David Declercq has been funded by the Institut Universitaire de France for this project. This paper was recommended by Associate Editor Z. Zhang.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Serial symbol-reliability based algorithm for decoding non-binary LDPC codes

  • García Herrero, Francisco Miguel
  • Flanagan, Mark F.
  • Canet Subiela, Mª José|||0000-0002-6765-9219
  • Valls Coquillat, Javier|||0000-0002-9390-5022
A symbol-reliability based decoding algorithm with serial schedule for non-binary low-density parity-check (LDPC) codes is presented. Performance results, together with implementation complexity analysis, are provided for different sample codes. The proposed algorithm achieves a similar gain to the min-max algorithm for codes with column weight d(v) >= 6, with lower complexity than previous symbol-reliability based algorithms., This research was supported by FEDER and the Spanish Ministerio de Ciencia e Innovacion, under Grant No. TEC2011-27916. F. Garcia-Herrero has developed his work in this project thanks to a VALi+d grant sponsored by Generalitat Valenciana (Conselleria d'Educacio) Grant No. ACIF/2011/023, and a FPU grant sponsored by the Spanish Government Grant No. AP2010-5178. M. J. Canet has developed her work in this project thanks to Programa de Apoyo a la Investigacion y Desarrollo (PAID-00-11) sponsored by Universidad Politcenica de Valencia and Programa Nacional de Movilidad de Recursos Humanos del Plan Nacional de I-D+i 2008-2011 supported by Ministerio de Educacion.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Reduction of Complexity for Nonbinary LDPC Decoders With Compressed Messages

  • Lacruz Jucht, Jesús Omar
  • García Herrero, Francisco Miguel
  • Valls Coquillat, Javier|||0000-0002-9390-5022
In this brief, a method for compressing the messages between check nodes and variable nodes is proposed. This method is named compressed nonbinary message passing (CNBMP). CNBMP reduces the number of messages exchanged between one check node and the connected variable nodes from d(c) x q to 5 x q, and its application has a high impact on the performance of the decoder: the storage and routing areas are reduced and the throughput is increased. Unlike other methods, CNBMP does not introduce any approximation or modification in the information and the processed operations are exactly the same as those of the original decoders; hence, no performance degradation is introduced. To demonstrate its advantages, an architecture applying this CNBMP to the Trellis Min-Max algorithm was derived showing that most of the storage resources were also reduced from dc x q to 5 x q. This architecture was implemented for a (837 726) nonbinary low-density parity-check code using a 90-nm CMOS technology reaching a throughput of 981 Mb/s with an area of 10.67 mm(2), which is 3.9 more efficient than the best solution found in the literature., This work was supported by the Spanish Ministerio de Ciencia e Innovacion under Grant TEC2011-27916. The work of F. Garcia-Herrero was supported by the Spanish Ministerio de Educacion through Formacion de Profesorado Universitario (FPU) under Grant AP2010-5178.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Non-binary LDPC decoder based on simplified enhanced generalized bit flipping algorithm

  • García Herrero, Francisco Miguel
  • Canet Subiela, Mª José|||0000-0002-6765-9219
  • Valls Coquillat, Javier|||0000-0002-9390-5022
A simplified version of the enhanced serial generalized bit-flipping algorithm is proposed in this brief. This new algorithm reduces the quantity of information that is stored with a negligible performance loss of 0.05 dB compared with previous proposals. In addition, the algorithm allows us not only to save memory, but also to reduce the number of arithmetic resources needed. In addition, a new initialization of the algorithm avoids using techniques to control data growth without any performance degradation, reduces routing, increasing the maximum frequency achievable, and saves logic. The decoder derived from the simplified algorithm requires almost half the area of previous architectures, with a throughput of 716 Mbps on a 90-nm CMOS process for the (837, 723) nonbinary code over GF(32) at ten iterations., Manuscript received December 26, 2012; revised May 21, 2013; accepted July 25, 2013. Date of publication August 21, 2013; date of current version May 20, 2014. This work was supported in part by the Spanish Ministerio de Ciencia e Innovacion under Grant TEC2011-27916 and in part by the Universidad Politecnica de Valencia under Grant PAID-06-2012-SP20120625. The work of F. Garcia-Herrero was supported by the Spanish Ministerio de Educacion under Grant AP2010-5178.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Reliability-based iterative decoding algorithm for LDPC codes with low variable-node degree

  • Català Pérez, Joan Marc
  • García Herrero, Francisco Miguel
  • Liu, K.
  • Lin, S.
  • Valls Coquillat, Javier|||0000-0002-9390-5022
In this letter, a new reliability-based iterative majority-logic decoding (RBI-MLGD) algorithm that computes the extrinsic information of previous iterations of the variable node is proposed. This decoding algorithm is called historicalextrinsic reliability-based iterative decoder (HE-RBID) and improves the bit-error-rate performance of the previous RBI-MLGD. HE-RBID is particularly interesting for codes with a low degree of variable node, where traditional RBI-MLGD algorithms do not provide a good behavior. HE-RBID ensures a good performance without searching for the minimum at the check node and only by exchanging 1-bit messages between variable and check nodes., This work was supported by the Spanish Ministerio de Ciencia e Innovacion under Grant TEC2011-27916. The work of J. M. Catala-Perez was supported by an FPI grant under Grant BES-2012-052130. The work of F. Garcia-Herrero was supported by an FPU grant sponsored by the Spanish Ministerio de Educacion under Grant AP2010-5178. The associate editor coordinating the review of this paper and approving it for publication was H. Saeedi.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Simplified trellis min-max decoder architecture for nonbinary low-density parity-check codes

  • Lacruz Jucht, Jesús Omar
  • García Herrero, Francisco Miguel
  • Declercq, David
  • Valls Coquillat, Javier|||0000-0002-9390-5022
Nonbinary low-density parity-check (NB-LDPC) codes have become an efficient alternative to their binary counterparts in different scenarios, such as moderate codeword lengths, high-order modulations, and burst error correction. Unfortunately, the complexity of NB-LDPC decoders is still too high for practical applications, especially for the check node (CN) processing, which limits the maximum achievable throughput. Although a great effort has been made in the recent literature to overcome this disadvantage, the proposed decoders are still not ready for high-speed implementations for high-order fields. In this paper, a simplified trellis min max algorithm is proposed, where the CN messages are computed in a parallel way using only the most reliable information. The proposed CN algorithm is implemented using a horizontal layered schedule. The overall decoder architecture has been implemented in a 90-nm CMOS process for a ((N=837) and (K=726)) NB-LDPC code over GF(32), achieving a throughput of 660 Mb/s at nine iterations based on postlayout results. This decoder increases hardware efficiency compared with the existing recent solutions for the same code., This work was supported in part by the Spanish Ministerio de Ciencia e Innovacion under Grant TEC2011-27916; in part by the Universitat Politecnica de Valencia, Gandia, Spain, under Grant PAID-06-2012-SP20120625; and in part by the Institut Universitaire de France, Rennes, France. The work of F. Garcia-Herrero was supported in part by the Spanish Ministerio de Educacion under Grant AP2010-5178 and in part by the Institute Universitaire de France.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Non-binary LDPC decoder based on symbol flipping with multiple votes

  • García Herrero, Francisco Miguel
  • Declercq, D.
  • Valls Coquillat, Javier|||0000-0002-9390-5022
In this letter, a new algorithm to decode non-binary LDPC (NB-LDPC) codes is proposed. This algorithm is inspired from very low complexity decoders that have been proposed recently, in which only syndrome computations at the check node update are used, while performing symbol-flipping based update at the variable node. Usually, the low complexity decoders based on symbol flipping suffer from a non-negligible performance degradation compared to soft-decision NB-LDPC decoders. Our improved decoder makes use of a list of syndrome computations instead of a single one based on hard-decision, and builds soft information at the variable node input by assigning votes weighted by different amplitudes. Simulations show that using multiple votes with multiple weights yields better performance, while still maintaining the low complexity feature., This research was supported by the Institut Universitaire de France, the Spanish Ministerio de Ciencia e Innovacion, under Grant No. TEC2011-27916, and the Spanish Ministerio de Educacion (Grant No.AP2010-5178)
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Architecture of Generalized Bit-Flipping Decodingfor High-Rate Non-binary LDPC Codes

  • García Herrero, Francisco Miguel
  • Canet Subiela, Mª José|||0000-0002-6765-9219
  • Valls Coquillat, Javier|||0000-0002-9390-5022
A VLSI architecture for the generalized bit-flipping decoding algorithm for non-binary low-density parity-check codes is proposed in this paper. The tentative decoding steps of the algorithm have been modifed to avoid computing and storing a matrix of dimension N ×2q , for a code (N,K) over GF(2q ), reducing its complexity with a minimal penalization of its performance, less than 0.05 dB compared with the original algorithm. The architecture was synthesized using a 90 nm standard cell library, for the (837, 723) non-binary code over GF(25), requiring 590220 xor gates and achieving a throughput of 89Mbps. Additionally, it was implemented in a Virtex- VI FPGA device with a cost of 4070 slices and a throughput of 44.6 Mbps., This research was supported by FEDER and the Spanish Ministerio de Ciencia e Innovacion, under Grant No. TEC2008-06787 and TEC2011-27916. F. Garcia-Herrero has developed his work in this project thanks to a VALi+d grant sponsored by Generalitat Valenciana (Conselleria d'Educacio). Grant No. ACIF/2011/023 and a FPU grant sponsored by the Spanish Government Grant No. AP2010-5178.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Multiple-vote symbol flipping decoder for non-binary LDPC codes

  • García Herrero, Francisco Miguel
  • Li, Erbao
  • Declercq, David
  • Valls Coquillat, Javier|||0000-0002-9390-5022
A multiple-vote symbol-flipping (MV-SF) decoding algorithm for nonbinary low-density parity-check (NB-LDPC) codes is proposed in this paper. Our algorithm improves the generalized bit-flipping algorithm (GBFDA) by considering the multiplicity of the candidates at the check-node output, to perform a more accurate symbol-flipping decision at the variable node update. The MV-SF algorithm greatly improves the frame error rate performance of GBFDA and approaches the performance of the best state-of-the-art decoders [extended min-sum and min-max (Min-Max)] with lower complexity. For a (N = 837, K = 723) NB-LDPC code over GF(32), the decoder derived from the proposed algorithm can reach a throughput higher than 500 Mb/s and a coding gain of 0.44 dB compared with the most efficient GBFDA architecture with only twice the silicon area. Our architecture has 27% efficiency gain compared with the best Min-Max architecture found in the literature, with a performance loss of just 0.21 dB at frame error rate 10(-4), This work was supported in part by the Spanish Ministerio de Ciencia e Innovacion under Grant TEC2011-27916, in part by the Universitat Politecnica de Valencia under Grant SP20120625, and in part by the Institut Universitaire de France. The work of F. Garcia-Herrero was supported by the Spanish Government, Ministerio de Educacion, under Grant AP2010-5178.