发明申请
US20090177869A1 EFFICIENT CHECK NODE MESSAGE TRANSFORM APPROXIMATION FOR LDPC DECODER
有权
有效检查LDPC解码器的节点信息变换近似
- 专利标题: EFFICIENT CHECK NODE MESSAGE TRANSFORM APPROXIMATION FOR LDPC DECODER
- 专利标题(中): 有效检查LDPC解码器的节点信息变换近似
-
申请号: US12348674申请日: 2009-01-05
-
公开(公告)号: US20090177869A1公开(公告)日: 2009-07-09
- 发明人: Vladimir Novichkov , Tom Richardson
- 申请人: Vladimir Novichkov , Tom Richardson
- 申请人地址: US CA San Diego
- 专利权人: QUALCOMM Incorporated
- 当前专利权人: QUALCOMM Incorporated
- 当前专利权人地址: US CA San Diego
- 主分类号: G06F9/302
- IPC分类号: G06F9/302 ; H03M13/05 ; G06F11/10
摘要:
In modern iterative coding systems such as LDPC decoder and turbo-convolutional decoder in which the invention may be used, the core computations can often be reduced to a sequence of additions and subtractions alternating between logarithm and linear domains A computationally efficient and robust approximation method for log and exp functions is described which involves using a simple bit mapping between fixed point fractional data format and floating point format. The method avoids costly lookup tables and complex computations and further reduces the core processing to a sequence of additions and subtractions using alternating fixed point and floating point processing units. The method is well suited for use in highly optimized hardware implementations which can take advantage of modern advances in standard floating point arithmetic circuit design as well as for software implementation on a wide class of processors equipped with FPU where the invention avoids the need for a typical multi-cycle series of log/exp instructions and especially on a SIMD FPU-equipped processors where log/exp functions are typically scalar.
公开/授权文献
信息查询