Pasar al contenido principal

ARQUITECTURAS DE FEC PARA SISTEMAS DE COMUNICACIONES DE MUY ALTA VELOCIDAD

TEC2008-06787

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2008
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSITAT POLITÈCNICA DE VALÈNCIA
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

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

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

Low cost hardware implementation of logarithm approximation

  • Gutiérrez Mazón, Roberto
  • Valls Coquillat, Javier|||0000-0002-9390-5022
A low cost, high-speed architecture for the computation of the binary logarithm is proposed. It is based on the Mitchell approximation with two correction stages: a piecewise linear interpolation with power-of-two slopes and truncated mantissa, and a LUT-based correction stage that correct the piecewise interpolation error. The architecture has been implemented in an FPGA device and the results are compared with other low cost architectures requiring less area and achieving high-speed. © 2006 IEEE., This research was supported by FEDER, the Spanish Ministerio de Ciencia e Innovacion, under Grant No. TEC2008-06787.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

High-Throughput Interpolator Architecture for Low-Complexity Chase Decoding of RS Codes

  • García Herrero, Francisco Miguel
  • Meher, Pramod Kumar
  • Canet Subiela, Mª José|||0000-0002-6765-9219
  • Valls Coquillat, Javier|||0000-0002-9390-5022
In this paper, a high-throughput interpolator architecture for soft-decision decoding of Reed-Solomon (RS) codes based on low-complexity chase (LCC) decoding is presented. We have formulated a modified form of the Nielson's interpolation algorithm, using some typical features of LCC decoding. The proposed algorithm works with a different scheduling, takes care of the limited growth of the polynomials, and shares the common interpolation points, for reducing the latency of interpolation. Based on the proposed modified Nielson's algorithm we have derived a low-latency architecture to reduce the overall latency of the whole LCC decoder. An efficiency of at least 39%, in terms of area-delay product, has been achieved by an LCC decoder, by using the proposed interpolator architecture, over the best of the previously reported architectures for an RS(255,239) code with eight test vectors. We have implemented the proposed interpolator in a Virtex-II FPGA device, which provides 914 Mb/s of throughput using 806 slices. © 2011 IEEE., This work was supported by FEDER and the Spanish Ministerio de Ciencia e Innovacion, under Grant TEC2008-06787.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Low-complexity low-density parity check decoding algorithm for high-speed very large scale integration implementation

  • Angarita Preciado, Fabián Enrique
  • Marín-Roig Ramón, José|||0000-0002-3436-7367
  • Almenar Terre, Vicenç|||0000-0002-8742-2315
  • Valls Coquillat, Javier|||0000-0002-9390-5022
This study proposes a new low-complexity decoding algorithm for low-density parity check codes, which is a variation of the offset min-sum algorithm and achieves a similar performance with lower hardware cost. A finite precision study is presented and the hardware cost of the implementation of three very large scale integration architectures is evaluated. As a conclusion, the proposed algorithm achieves similar performance with an area saving of around 18, 10 and 14% for the memory-based partially parallel, fully parallel and sliced message passing implementations, respectively., This research was supported by Fondo Europeo de Desarrollo Regional (FEDER), the Spanish Ministerio de Ciencia e Innovacion, under grant numbers TEC2008-06787 and TEC2011-27916.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Transmit Diversity Scheme for OFDM Systems Using the Odd DFT

  • Almenar Terre, Vicenç|||0000-0002-8742-2315
  • Girona, Amparo|||0000-0002-0736-2704
  • Flores Asenjo, Santiago J.|||0000-0002-9417-9771
  • Marín-Roig Ramón, José|||0000-0002-3436-7367
[EN] A new transmission scheme for OFDM systems that uses the odd discrete Fourier transform to provide frequency diversity gain is proposed. Odd DFT allows the transmission of data subcarriers in frequencies that are centred between those employed by the traditional DFT. This fact is exploited to transmit data subcarriers on the group of frequencies that gives better performance using either traditional DFT or odd DFT. As an example, by using this approach a diversity gain up to 5.3 dB at a BER of 10-4 in a typical indoor channel model can be achieved. © 2011 The Institute of Electronics, Information and Communication Engineers., This work was supported by the Spanish Ministerio de Ciencia e Innovacion under grant TEC2008-06787.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Tridimensional block multiword LDPC decoding on GPUs

  • Martínez Zaldívar, Francisco José|||0000-0002-7845-6273
  • Vidal Maciá, Antonio Manuel
  • Gonzalez, Alberto|||0000-0002-6984-3212
  • Almenar Terre, Vicenç|||0000-0002-8742-2315
[EN] In this paper, we describe a parallel algorithm for LDPC (Low Density Parity Check codes) decoding on a GPU (Graphics Processing Unit) using CUDA (Compute Unified Device Architecture). The strategy of the kernel grid and block design is shown and the multiword decoding operation is described using tridimensional blocks. The performance (speedup) of the proposed parallel algorithm is slightly better than the performance found in the literature when this is relatively good, and shows a great improvement in those cases with previously reported moderate or bad performance. © 2011 Springer Science+Business Media, LLC., This work was financially supported by the Spanish Ministerio de Ciencia e Innovación (Projects TIN2008-06570-C04-02, TEC2009-13741 and TEC2008-06787), Universidad Politécnica de Valencia through “Programa de Apoyo a la Investigación y Desarrollo (PAID-05-09)” and Generalitat Valenciana through project PROMETEO/2009/013.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Low Complexity Time Synchronization Algorithm for OFDM Systems with Repetitive Preambles

  • Canet Subiela, Mª José|||0000-0002-6765-9219
  • Almenar Terre, Vicenç|||0000-0002-8742-2315
  • Flores Asenjo, Santiago J.|||0000-0002-9417-9771
  • Valls Coquillat, Javier|||0000-0002-9390-5022
In this paper, a new time synchronization algorithm for OFDM systems with repetitive preamble is proposed. This algorithm makes use of coarse and fine time estimation; the fine time estimation is performed using a cross-correlation similar to previous proposals in the literature, whereas the coarse time estimation is made using a new metric and an iterative search of the last sample of the repetitive preamble. A complete analysis of the new metric is included, as well as a wide performance comparison, for multipath channel and carrier frequency offset, with the main time synchronization algorithms found in the literature. Finally, the complexity of the VLSI implementation of this proposal is discussed. © 2011 Springer Science+Business Media, LLC., This work was supported by the Spanish Ministerio de Educacion y Ciencia under grants TEC2006-14204-C02-01 and TEC2008-06787.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Improved Sliced Message Passing Architecture for High Throughput Decoding of LDPC Codes

  • Angarita Preciado, Fabián Enrique
  • Sansaloni Balaguer, Trinidad Mª|||0000-0003-1988-9607
  • Canet Subiela, Mª José|||0000-0002-6765-9219
  • Valls Coquillat, Javier|||0000-0002-9390-5022
This paper presents an architecture for high-throughput decoding of high-rate Low-Density Parity-Check (LDPC) codes. The proposed architecture is a modification of the sliced message passing (SMP) decoding architecture which overlaps the check-node and variable-node update stages, achieving a good tradeoff between area and throughput, and also, high hardware utilization efficiency (HUE). The proposed modification does not affect the performance of the SMP algorithm and yields an area reduction of 33%. As an example, SMP architecture and the proposed modification was synthesized in a 90 nm CMOS process for the 2048-bit LDPC code of the IEEE802.3an standard with 16 iterations achieving a throughput of 5.9 Gbps with 15.3 mm2 and 6.2 Gbps with 10.2 mm2, respectively., This research was supported by FEDER and Spanish Ministerio de Ciencia e Innovacion under Grant No. TEC2008-06787.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Modifed Shuffled Based Architecture for High Throughput Decoding of LDPC Codes

  • Angarita, Fabián
  • Sansaloni Balaguer, Trinidad Mª|||0000-0003-1988-9607
  • Pérez Pascual, Mª Asunción|||0000-0002-6925-6878
  • Valls Coquillat, Javier|||0000-0002-9390-5022
Low Density Parity-Check (LDPC) codes achieve the best performance when they are decoded with the sum-product (SP) algorithm. This is a two-phase iterative algorithm where two types of messages are interchanged and updated in each iteration. The group-shuffled or layered decoding schemes applied to the SP algorithm speed up its convergence by modifying its schedule, so they yield a reduction in the number of iterations required to achieve a given performance. However, the two-phase processing is still maintained. In this paper a modification of the group-shuffled scheme suitable for high-rate LDPC codes is proposed. The modification allows the overlapping of the two-phase computation, achieving a convergence speed up close to that of the group-shuffled scheme with higher throughput. Besides, high throughput architectures are presented for the modified algorithm. As an example, the proposed architecture has been implemented for the 2048-bit LDPC code of the IEEE 802.3an standard and it was synthesized in a 90 nm CMOS process achieving a throughput of 22.40 Gbps at 14 iterations with a clock frequency of 306 MHz and a total area of 10.5 mm(2). Furthermore, the decoder performs within 0.5 dB of the floating-point 100 iterations sum-product algorithm at a PER of 10(-5)., This research was supported by Fondo Europeo de Desarrollo Regional (FEDER), the Spanish Ministerio de Ciencia e Innovacion, under Grant No. TEC2008-06787.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

FPGA implementation of an OFDM-based WLAN receiver

  • Canet Subiela, Mª José|||0000-0002-6765-9219
  • Valls Coquillat, Javier|||0000-0002-9390-5022
  • Almenar Terre, Vicenç|||0000-0002-8742-2315
  • Marín-Roig Ramón, José|||0000-0002-3436-7367
This paper deals with the design and implementation on FPGA of a receiver for OFDM-based WLAN. The circuit is particularized for IEEE 802.11a/g standards. The system includes frame detection, time and frequency synchronization, demodulation, equalization and phase tracking. The algorithms to be implemented for each task are selected taking into account performance, hardware cost and latency. Also, a fixed point analysis is made for each algorithm. Our objective is to maintain the PER loss below 0.5 dB for a PER = 10 -2, 64-QAM and error correction. The whole system is composed of two main blocks (correlator and CORDIC) that are reused in different time intervals to perform all the necessary operations, so the required hardware resources are minimized. To verify it, the receiver is physically implemented and tested. © 2011 Elsevier B.V. All rights reserved., This work was supported by the Spanish Ministerio de Educacion y Ciencia under grant TEC2008-06787.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación 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
Publicación Artículo científico (JournalArticle)

Hardware architecture of a gaussian noise generator based on inversion method

  • Gutiérrez, Roberto G.
  • Torres Carot, Vicente|||0000-0002-6829-7889
  • Valls Coquillat, Javier|||0000-0002-9390-5022
In this brief, we present a hardware-based Gaussian noise generator (GNG) with low hardware cost, high generation rate, and high Gaussian tail accuracy. The proposed generator is based on a piecewise polynomial approximation of the inverse cumulative distribution function (ICDF). We propose to avoid the area-demanding barrel-shifter of the ICDF approximation by means of creating a new uniform random sequence from the uniform random number generator output. The GNG architecture has been implemented in field-programmable gate array devices, and the implementation results are compared with other published designs, achieving a higher deviation with fewer hardware resources. Our GNG generates 242 Msps of random noise and achieves a tail of 13.1 sigma with 442 slices, two multipliers, and two Block-RAM of a Virtex-II device. The generator output successfully passed commonly used statistical tests. © 2012 IEEE., This work was supported by Fondo Europeo de Desarrollo Regional and the Spanish Ministerio de Ciencia e Innovacion under Grant TEC2008-06787 and Grant TEC2011-27916. This brief was recommended by Associate Editor Y. Ha.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

High speed RS(255, 239) decoder based on LCC decoding

  • García Herrero, Francisco Miguel
  • Meher, P. K.
  • Valls Coquillat, Javier|||0000-0002-9390-5022
Algebraic Soft-Decision Decoding (ASD) of Reed-Solomon (RS) codes provides higher coding gain over the conventional hard-decision decoding (HDD), but involves high computational complexity. Among the existing ASD methods, the Low Complexity Chase (LCC) decoding is the one with the lowest implementation cost. LCC decoding is based on generating 2 ¿ test vectors, where ¿ symbols are selected as the least reliable symbols for which hard-decision or the second more reliable decision are employed. Previous decoding algorithms for LCC decoders are based on interpolation and re-encoding techniques. On the other hand, HDD algorithms such as the Berlekamp-Massey (BM) algorithm or the Euclidean algorithm, despite of their low computational complexity, are not considered suitable for LCC decoding. In this paper, we present a new approach to LCC decoding based on one of these HDD algorithms, the inversion-less Berlekamp-Massey (iBM) algorithm, where the test vectors are selected for correction during decoding on occurrence of hard-decision decoding failure. The proposed architecture when applied to a RS(255, 239) code with ¿=3, saves a 20.5% and 2% of area compared to the LCC with factorization and a factorization-free decoder, respectively. In both cases, the latency is reduced by 34.5%, which is an increase of throughput rate in the same percentage since the critical path is the same in all the competing architectures. So an efficiency of at least 56% in terms of area-delay product can be obtained, compared with previous works. A complete RS(255, 239) LCC decoder with ¿=3 has been coded in VHDL and synthesized for implementation in Vitex-5 FPGA device, and by using SAED 90 nm standard cell library as well, and find a decoding rate of 710 Mbps and 4.2 Gbps and area of 2527 slices and 0.36 mm 2, respectively. © 2011 Springer Science+Business Media, LLC., This research was supported by FEDER and the Spanish Ministerio de Ciencia e Innovacion, under Grant No. TEC2008-06787.