Low-Density Parity-Check Matrices for Coding of Correlated Sources

Muramatsu, Jun; Uyematsu, Tomohiko; Wadayama, Tadashi

doi:10.1109/tit.2005.855604

Cited by 76 publications

(78 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As in a standard density evolution analysis for turbo codes [24], it can happen that the SNR goes to infinity or there can be a finite equilibrium point. In both cases, we denote by SNR s the final SNR which is achieved by iteratively solving (16). The SNR of the extrinsic information messages which are passed to the other turbo decoder can be finally expressed as…”

Section: A a Two-dimensional Exit Chart-inspired Approachmentioning

confidence: 99%

“…2 has already converged and, hence, it passes a very reliable a priori information to the other decoder (SNR e = ∞). In this case, referring to (16) and (15), we can test the single turbo decoder convergence by setting SNR e = ∞ and by showing the output SNR of decoder G 1 versus its input SNR (i.e., the curve Z 1 ) and the input SNR of decoder G 2 versus its output SNR (i.e., the curve Z −1…”

Section: ) Single Turbo Decoder Convergence In the Presence Of A Primentioning

confidence: 99%

See 1 more Smart Citation

Optimizing channel coding for orthogonal multiple access schemes with correlated sources

Abrardo

Ferrari

Martalò

et al. 2009

2009 Information Theory and Applications Workshop

View full text Add to dashboard Cite

Abstract-In this paper, we consider multiple access schemes with correlated sources. Distributed source coding is not used; rather, the correlation is exploited at the access point (AP). In particular, we assume that each source uses a channel code to transmit, through an additive white Gaussian noise (AWGN) channel, its information to the AP, where component decoders, associated with the sources, iteratively exchange soft information by taking into account the correlation. The key goal of this paper is to investigate whether there exist optimized channel codes for this scenario, i.e., channel codes which guarantee a desired performance level (in terms of average bit error rate, BER) at the lowest possible signal-to-noise ratio (SNR). A twodimensional extrinsic information transfer (EXIT) chart-inspired optimization approach is proposed. Our results suggest that by properly designing serially concatenated convolutional codes (SCCCs), the theoretical performance limits can be approached better than by using parallel concatenated convolutional codes (PCCCs) or low-density parity-check (LDPC) codes. It is also shown that irregular LDPC codes tend to perform better than regular LDPC codes, so that the design of appropriate LDPC codes remains an open issue.

show abstract

Section: A a Two-dimensional Exit Chart-inspired Approachmentioning

confidence: 99%

Section: ) Single Turbo Decoder Convergence In the Presence Of A Primentioning

confidence: 99%

Optimizing channel coding for orthogonal multiple access schemes with correlated sources

Abrardo

Ferrari

Martalò

et al. 2009

2009 Information Theory and Applications Workshop

View full text Add to dashboard Cite

show abstract

“…Note that encoding in step 5 and decoding in step 6 are implementable by using low-density parity check codes [13], [14].…”

Section: Alice and Bob Send Sequencesmentioning

confidence: 99%

Secret Key Agreement by Soft-Decision of Signals in Gaussian Maurer's Model

Naito

Watanabe

Matsumoto

et al. 2009

IEICE Trans. Fundamentals

View full text Add to dashboard Cite

Masashi NAITO†a) , Nonmember, Shun WATANABE † †b) , Ryutaroh MATSUMOTO † †c) , and Tomohiko UYEMATSU † †d) , Members SUMMARYWe consider the problem of secret key agreement in Gaussian Maurer's Model. In Gaussian Maurer's model, legitimate receivers, Alice and Bob, and a wire-tapper, Eve, receive signals randomly generated by a satellite through three independent memoryless Gaussian channels respectively. Then Alice and Bob generate a common secret key from their received signals. In this model, we propose a protocol for generating a common secret key by using the result of soft-decision of Alice and Bob's received signals. Then, we calculate a lower bound on the secret key rate in our proposed protocol. As a result of comparison with the protocol that only uses hard-decision, we found that the higher rate is obtained by using our protocol.

show abstract

“…For this reason, this approach is also referred to as joint channel decoding (JCD) [8]- [10]. In this scenario, the presence of block-faded channels may dramatically degrade the performance, unless some countermeasures are taken to protect highly-faded links.…”

Section: Introductionmentioning

confidence: 99%

Orthogonal multiple access and information fusion: How many observations are needed?

Ferrari

Martalò

Abrardo³

et al. 2012

2012 Information Theory and Applications Workshop

View full text Add to dashboard Cite

Abstract-In this paper, we consider a central estimating officer (CEO) scenario, where sensors observe a noisy version of a binary sequence generated by a single hidden source (the phenomenon). Distributed source coding is not used; rather, the correlation is exploited at the access point (AP), whose goal is to estimate, by properly fusing the data received through AWGN or block fading channels, this sequence. We assume that each node uses a classical channel code to transmit its information to the AP, where decoding is followed by fusion. In the decoding block, joint channel decoding (JCD) or separate channel decoding (SCD) are considered: in the former case, correlation is exploited in the decoding process, whereas in the latter case it is not. We first investigate the ultimate achievable performance limits with JCD (i.e., considering the multiple access channel), in terms of: (i) feasible capacity region in the additive white Gaussian noise (AWGN) channel case; (ii) outage feasible capacity region, in block faded channel case. This analysis provides preliminary insights on the impact of the number of observations. Then, we investigate the overall system performance in terms of bit error rate (BER), probability of outage (only in the block faded case), and probability of decision error (after fusion).

show abstract

Low-Density Parity-Check Matrices for Coding of Correlated Sources

Cited by 76 publications

References 24 publications

Optimizing channel coding for orthogonal multiple access schemes with correlated sources

Optimizing channel coding for orthogonal multiple access schemes with correlated sources

Secret Key Agreement by Soft-Decision of Signals in Gaussian Maurer's Model

Orthogonal multiple access and information fusion: How many observations are needed?

Contact Info

Product

Resources

About