Decoding Algorithms for LDPC Codes based on Convex Optimization and Its Applications
Project/Area Number |
22560370
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Single-year Grants |
Section | 一般 |
Research Field |
Communication/Network engineering
|
Research Institution | Nagoya Institute of Technology |
Principal Investigator |
|
Project Period (FY) |
2010 – 2012
|
Project Status |
Completed (Fiscal Year 2012)
|
Budget Amount *help |
¥4,030,000 (Direct Cost: ¥3,100,000、Indirect Cost: ¥930,000)
Fiscal Year 2012: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2011: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2010: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
Keywords | 符号理論 / 凸最適化 / LDPC符号 / 情報理論 / 最適化 / 内点法 / 復号法 / CDMA |
Research Abstract |
In this project, we have developed a class of decoding algorithms for LDPC codes based on convex optimization. As other applications of convex optimization based decoding, a multi-user detection algorithm for CDMA systems and a two dimensional equalization algorithm were devised. Furthermore, thorough the concept of continuous optimization, such as gradient descent method and linear programming, a novel class of bit-flipping algorithms, called GDBF algorithms, was invented.
|
Report
(4 results)
Research Products
(19 results)