arrow
Return

GaussianSource Coding Based on P-LDPC Code

delete2023-04-01
delete2
PRE
AI
D
Dan Song
J
Jinkai Ren
王琳 cover
王琳 (Lin Wang) *
陈光荣 (Guanrong Chen)
DOI:10.1109/TCOMM.2023.3245660delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
A lossy source coding system based on the protograph low-density parity-check (P-LDPC) code is proposed for Gaussian source compression. In the proposed system, the conventional belief propagation (BP) algorithm is modified to be a concatenated BP-inverse BP (BP-iBP) for encoding and decoding, where the iBP is constructed by a fully-connected layer of a neural network. Compared to the existing approximate message passing algorithm, the proposed BP-iBP realizes a float to-bit compression with low complexity for arbitrary Gaussian sources. The BP-iBP is implemented based on the linking relation of the protograph; therefore, it is necessary to optimally design the protograph to obtain better rate-distortion function (RDF) performance. Regarding the coding optimal procedure, a mutual information iteration convergence (MIIC) algorithm is designed as the optimal criterion to determine the source P-LDPC code with minimum distortion. Inspired by the plane construction of quantum stabilizer code, a lattice topological splicing (LTS) algorithm is proposed for regularly building the protograph to reduce the code searching complexity. By using the MIIC and the LTS algorithms, the BP-iBP based on the designed P-LDPC code maintains good distortion performance close to the RDF limit.
Keywords:
Codes
Source coding
Encoding
Distortion
Open area test sites
Decoding
Resource description framework
Lossy source coding
P-LDPC code
belief propagation algorithm
rate-distortion function
optimal coding algorithm

Journal

IEEE Transactions on Communications cover
IEEE Transactions on Communications
IF:
8.3
Papers:
1.2W
Citations:
3.6W

Organization

C
City University of Hong Kong
Scholars:
2.3W
Papers: 3.0W
Citations: 6.1W
X
xiamen university
Scholars:
5.8W
Papers: 3.8W
Citations: 67