Binary Wyner–Ziv code design based on compound LDGM–LDPC structures

Nangir, Mahdi; Ahmadian-Attari, Mahmoud; Asvadi, Reza

doi:10.1049/iet-com.2017.0032

Cited by 9 publications

(11 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This process continues until values of all the variable nodes are fixed. Details of the BiP algorithm including update equations and damping process are presented in [19] and [20].…”

Section: B Message-passing Algorithmsmentioning

confidence: 99%

“…We do this process of quantize and bin by employing a compound LDGM-LDPC code. It is notable that the total length of the obtained syndrome equals n − m 1 + k 1 , where its first n − m 1 bits are zero because the LDPC code is nested in the LDGM code [20]. Hence, only k 1 non-zero bits are sent to the decoder and the total rate is R 1 = R 1,1 − R 1,2 = k 1 n .…”

Section: A Coding Scheme For the Corner Pointsmentioning

confidence: 99%

See 1 more Smart Citation

Analysis and Code Design for the Binary CEO Problem Under Logarithmic Loss

Nangir

Asvadi

Ahmadian-Attari

2018

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

In this paper, we propose an efficient coding scheme for the binary Chief Executive Officer (CEO) problem under logarithmic loss criterion. Courtade and Weissman obtained the exact ratedistortion bound for a two-link binary CEO problem under this criterion. We find the optimal test-channel model and its parameters for the encoder of each link by using the given bound.Furthermore, an efficient encoding scheme based on compound LDGM-LDPC codes is presented to achieve the theoretical rates. In the proposed encoding scheme, a binary quantizer using LDGM codes and a syndrome-decoding employing LDPC codes are applied. An iterative decoding is also presented as a fusion center to reconstruct the observation bits. The proposed decoder consists of a sum-product algorithm with a side information from other decoder and a soft estimator.The output of the CEO decoder is the probability of source bits conditional to the received sequences of both links. This method outperforms the majority-based estimation of the source bits utilized in the prior studies of the binary CEO problem. Our numerical examples verify a close performance of the proposed coding scheme to the theoretical bound in several cases.M. Nangir and M. Ahmadian-Attari are with the ⋆ CEO if |Q| ≤ 4 and |U i | ≤ |Y i | = 2, for i = 1, 2, are satisfied. To find a complete characterization of the sumrate-distortion function for the two-link binary CEO problem, we should solve the following DRAFT

show abstract

“…This process continues until values of all the variable nodes are fixed. Details of the BiP algorithm including update equations and damping process are presented in [19] and [20].…”

Section: B Message-passing Algorithmsmentioning

confidence: 99%

Section: A Coding Scheme For the Corner Pointsmentioning

confidence: 99%

Analysis and Code Design for the Binary CEO Problem Under Logarithmic Loss

Nangir

Asvadi

Ahmadian-Attari

2018

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The employed degree distributions are optimized over BSC using the density evolution technique [17]. Furthermore, the degree distributions of the LDGM codes are designed using the method described in [8]. The following source splitting rules are utilized in our implementations:…”

Section: Results and Performance Analysismentioning

confidence: 99%

“…Hence, an efficient design of the source and the channel codes leads to a good performance in the original multi-terminal coding problem. Nested LDPC and LDGM codes form a structure which efficiently performs close to the ratedistortion bound of the binary WZ problem [7], [8]. For instance, consider a source code with the rate-distortion relation R s = 1 − h b (d) + ǫ s for a target distortion d and a channel code of rate R c = 1 − h b (p * d) − ǫ c are utilized in the compound coding scheme for sufficiently small positive values ǫ s and ǫ c .…”

Section: Introductionmentioning

confidence: 99%

Successive Wyner-Ziv Coding for the Binary CEO Problem under Log-Loss

Nangir

Asvadi

Ahmadian-Attari

2018

2018 29th Biennial Symposium on Communications (BSC)

Self Cite

View full text Add to dashboard Cite

An l-link binary CEO problem is considered in this paper. We present a practical encoding and decoding scheme for this problem employing the graphbased codes. A successive coding scheme is proposed for converting an l-link binary CEO problem to the (2l − 1) single binary Wyner-Ziv (WZ) problems. By using the compound LDGM-LDPC codes, the theoretical bound of each binary WZ is asymptotically achievable. Our proposed decoder successively decodes the received data by employing the well-known Sum-Product (SP) algorithm and leverages them to reconstruct the source. The sum-rate distortion performance of our proposed coding scheme is compared with the theoretical bounds under the logarithmic loss (log-loss) criterion.

show abstract

“…At present, the more classical distributed codec solutions mainly include the Wyner-Ziv video coding proposed by Stanford University Girod and Aaron [10][11][12][13][14][15][16][17][18], and PRISM video coding by Ramchandran et al, University of California, Berkeley [19][20][21]. The proposed layered Wyner-Ziv video coding [23] and the state-free distributed video coding proposed by Umar et al [24] distributed video coding based on wavelet coding and multi-view distributed video coding.…”

Section: Introductionmentioning

confidence: 99%

Distributed video coding scheme of multimedia data compression algorithm for wireless sensor networks

2019

J Wireless Com Network

View full text Add to dashboard Cite

The emergence of multimedia data has enriched people's lives and work and has penetrated into education, finance, medical, military, communications, and other industries. The text data takes up a small space, and the network transmission speed is fast. However, due to its richness, the multimedia data makes it occupy an ample space. Some high-definition multimedia information even reaches the GB level, and the multimedia data network transmission is relatively slow. Compared with the traditional scalar data, the multimedia data better describes the characteristics of the transaction, but at the same time, the multimedia data itself has a large capacity and must be compressed. Nodes of wireless multimedia sensor networks have limited ability to process data. Traditional data compression schemes require high processing power of nodes and are not suitable for sensor networks. Therefore, distributed video codec scheme in recent years becomes one of the hot multimedia sensor network technologies, which is a simple coding scheme, coding complexity of decoding performance. In this paper, distributed video codec and its associated knowledge based on the study present a distributed video coding scheme and its improvements. Aiming at the problem that the traditional distributed video coding scheme cannot accurately decode the motion severe region and the boundary region, a distributed video coding algorithm based on gradient-domain ROI is proposed, which can enhance the coding efficiency of the severe motion region and improve the decoded image while reducing the code rate and quality, ultimately reducing sensor node energy consumption.

show abstract

Binary Wyner–Ziv code design based on compound LDGM–LDPC structures

Cited by 9 publications

References 18 publications

Analysis and Code Design for the Binary CEO Problem Under Logarithmic Loss

Analysis and Code Design for the Binary CEO Problem Under Logarithmic Loss

Successive Wyner-Ziv Coding for the Binary CEO Problem under Log-Loss

Distributed video coding scheme of multimedia data compression algorithm for wireless sensor networks

Contact Info

Product

Resources

About