|
|
|
| Practical design of distributed source coding based on random interleavers |
| ZENG Wei-chao1, YANG Sheng-tian1, 2, QIU Pei-liang1 |
(1. Department of Information Science and Electronic Engineering, Zhejiang University, Hangzhou 310027, China;
2. Key Laboratory of Information Coding and Transmission, Southwest Jiaotong University, Chengdu 610031, China) |
|
|
|
Abstract A practical scheme of symmetric Slepian-Wolf coding based on low-density parity-check (LDPC) codes and random interleavers was presented. The difference between the previous schemes and the proposed one lies in that the source nodes with the same encoding rate can use the same LDPC code but with different interleavers, so the design complexity of the system is reduced evidently, especially for a large amount of source nodes. In the scheme, progressive edge-growth (PEG) algorithm is used to optimize the Tanner graph of the LDPC code, and joint iterative decoding is performed at the decoder by exploiting the correlation among sources. The simulation for the cases of two and three correlated sources as well as the special case of one single source shows that the proposed scheme performs better than the existed schemes for the correlated non-uniform sources．
|
|
Published: 01 November 2009
|
|
|
基于随机交织的分布式信源编码的实际设计
提出一种基于低密度奇偶校验（LDPC）码和随机交织器的对称Slepian-Wolf编码的实际设计方案.与已有方案不同,该方案对于具有相同速率的信源节点可以采用相同的LDPC编码器,只须通过不同的随机交织器就可以进行区分,使得系统的实现复杂度明显降低,尤其是在节点数量较大的情况下.该方案运用渐进边增长（PEG）算法对LDPC码的Tanner图进行优化,而在译码端利用信源之间的相关性进行联合迭代译码.在2、3个相关信源以及单个信源的特殊情形下的仿真结果表明,对于相关的非均匀信源,该方案在性能上优于已有方案.
|
|
| [1] COVER T M, THOMAS J A. Elements of information theory [M]. 2nd ed. Hoboken: John Wiley & Sons Inc, 2006: 5-56．
[2] PRADHAN S S, RAMCHANDRAN K. Distributed source coding using syndromes (DISCUS): design and construction [C]∥ Proceedings of Data Compression Conference 1999. Snowbird: IEEE, 1999: 158-167．
[3] AARON A, GIROD B. Compression with side information using turbo codes [C]∥ Proceedings of Data Compression Conference 2002. Snowbird: IEEE, 2002: 252-261．
[4] GARCIA-FRIAS J, ZHONG W. LDPC codes for compression of multi-terminal sources with hidden Markov correlation [J]. IEEE Communications Letters, 2003, 7(3): 115-117．
[5] STANKOVIC V, LIVERIS A D, XIONG Z, et al. On code design for Slepian-Wolf problem and lossless multiterminal networks [J]. IEEE Transactions on Information Theory, 2006, 52(4): 1495-1507．
[6] COLEMAN T P, LEE A H, MEDARD M, et al. Low-complexity approaches to Slepian-Wolf near-lossless distributed data compression [J]. IEEE Transactions on Information Theory, 2006, 52(8): 3546-3561．
[7] 杨胜天. 关于整数编码和Slepian-Wolf编码的研究[D].杭州：浙江大学, 2005．
YANG Sheng-tian. The research on integer coding and Slepian-Wolf coding [D]. Hangzhou: Zhejiang University, 2005．
[8] GALLAGER R G. Low-density parity-check codes [D]. Cambridge: MIT Press, 1963．
[9] YANG S, QIU P. On the performance of linear Slepian-Wolf codes for correlated stationary memoryless sources [C]∥ Proceedings of Data Compression Conference 2005. Snowbird: IEEE, 2005: 53-62．
[10] KSCHISCANG F R, FREY B J, LOELIGER H. Factor graph and the sum-product algorithm [J]. IEEE Transactions on Information Theory, 2001, 47(2): 498-519．
[11] HU X Y, ELEFTHERIOU E, ARNOLD D M. Regular and irregular progressive edge-growth Tanner graphs [J]. IEEE Transactions on Information Theory, 2005, 51(1): 386-398．
[12] JIN H, KHANDEKAR A, MCELIECE R. Irregular repeat-accumulate codes [C]∥ Proceedings of the 2nd International Symposium on Turbo Codes & Related Topics. Brest: [s.n.], 2000: 1-8． |
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
| |
Shared |
|
|
|
|
| |
Discussed |
|
|
|
|
