Practical Slepian-Wolf Coding System by using LDPC matrices
| Project/Area Number |
22560362
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Communication/Network engineering
|
|---|
| Research Institution | Tokyo Institute of Technology |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2010 – 2012
|
| Project Status |
Completed (Fiscal Year 2012)
|
| Budget Amount *help |
¥3,250,000 (Direct Cost: ¥2,500,000、Indirect Cost: ¥750,000)
Fiscal Year 2012: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2011: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
Fiscal Year 2010: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
|
|---|
| Keywords | Slepian-Wolf 符号化 / LDPC 符号 / 情報源符号化 / Slepian-Wolf符号化 / LDPC符号 / 情報理論 / ユニバーサル符号 |
|---|
| Research Abstract |
This research investigates some practical codes for Slepian-Wolf system by using LDPC(Low Density Parity Check) matrices, and obtains the following codes. (1) The code which can be constructed without any statistical property of sources, and can achieve arbitrarily small error probability. (2) The variable rate code which can be decoded with linear complexity of its length. (3) The asynchronous Slepian-Wolf code.
|
Report
(4 results)
Research Products
(5 results)
