LDPC decoder with a limited-precision FPGA-based floating-point multiplication coprocessor

被引:0
作者
Moberly, Raymond [1 ]
O'Sullivana, Michael [1 ]
Waheed, Khurram [2 ]
机构
[1] San Diego State Univ, Dept Math, San Diego, CA 92182 USA
[2] San Diego State Univ, Dept Elect Engn, San Diego, CA 92182 USA
来源
ADVANCED SIGNAL PROCESSING ALGORITHMS, ARCHITECTURES, AND IMPLEMENTATIONS XVII | 2007年 / 6697卷
基金
美国国家科学基金会;
关键词
LDPC codes; sum-product algorithm; belief propagation; reconfigurable computing;
D O I
10.1117/12.733510
中图分类号
TH7 [仪器、仪表];
学科分类号
0804 ; 080401 ; 081102 ;
摘要
Implementing the sum-product algorithm, in an FPGA with an embedded processor, invites us to consider a tradeoff between computational precision and computational speed. The algorithm, known outside of the signal processing community as Pearl's belief propagation. is used for iterative soft-decision decoding of LDPC codes. We determined the feasibility of a coprocessor that will perform product computations. Our FPGA-based coprocessor (design) performs computer algebra with significantly less precision than the standard (integer, floating-point) operations of general purpose processors. Using synthesis, targeting a 3,168 LUT Xilinx FPGA, we show that key components of a decoder are feasible and that the full single-precision decoder could be constructed using a larger part. Soft-decision decoding by the iterative belief propagation algorithm is impacted both positively and negatively by a reduction in the precision of the computation. Reducing precision reduces the coding gain, but the limited-precision computation can operate faster. A proposed solution offers custom logic to perform computations with less precision, yet uses the floating-point format to interface with the software. Simulation results show the achievable coding.-am. Synthesis results help theorize the the full capacity and performance of an FPGA-based coprocessor.
引用
收藏
页数:12
相关论文
共 15 条
[1]  
ERCEGOVAC M, 2004, DIGITAL ARITHMETIC, pCH8
[2]  
FLYNN M, 2001, ADV COMPUTER ARITHME, pCH2
[3]   LOW-DENSITY PARITY-CHECK CODES [J].
GALLAGER, RG .
IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (01) :21-&
[4]  
GOKHALE M, 2005, RECONFIGURABLE COMPU, pCH1
[5]  
IEEE Computer Society, 1985, 7541985 IEEE
[6]   Periodic time-varying convolutional codes with low-density parity-check matrices [J].
Jimenez, A ;
Zigangirov, KS .
1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, :305-305
[7]  
JONES C, 2003, P MILCOM 2003
[8]  
KOREN I, 2002, COMPUTER ARITHMETIC, pCH6
[9]   Implementation of near Shannon limit error-correcting codes using reconfigurable hardware [J].
Levine, B ;
Taylor, RR ;
Schmit, H .
2000 IEEE SYMPOSIUM ON FIELD-PROGRAMMABLE CUSTOM COMPUTING MACHINES, PROCEEDINGS, 2000, :217-226
[10]   Near Shannon limit performance of low density parity check codes [J].
MacKay, DJC ;
Neal, RM .
ELECTRONICS LETTERS, 1996, 32 (18) :1645-1646