Density evolution-based analysis and design of LDPC codes with a priori information

Martalò, Marco; Ferrari, Gianluigi; Abrardo, Andrea; Franceschini, Michele; Raheli, R.

doi:10.1109/ita.2010.5454106

Cited by 9 publications

(36 citation statements)

References 26 publications

(38 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the decoding block, the JCD algorithm is used. As anticipated in Subsection III-B.1, all curves reach, for large values of γ b , the floor predicted by (16). In particular, since for p 0 = p 1 = 1/2 the fusion rule does not improve (in terms of the floor) when n increases from an odd value (e.g., 3) to the next even value (4), no improvement is observed for the limiting performance values in Fig.…”

Section: B Complete Performance Analysis: Decoding and Fusionsupporting

confidence: 70%

“…Therefore, the probability (16) corresponds to a floor. Moreover, the final expression (16) shows that the limiting probability of decision error does not depend on the particular decoding scheme (either JCD or SCD). However, as will be shown in Section V, the chosen decoding scheme will affect the behavior of the probability of decision error above the limiting floor.…”

Section: òò ð× öóñmentioning

confidence: 98%

“…In this section, following the approaches introduced in [15], [16] (AWGN scenario) and in [17] (block fading), we try to gain insight on the impact of the number of correlated observations on the performance of JCD. This is expedient to understand the benefits (performance-wise) of the use of correlation in the decoding phase, before fusion.…”

Section: Theoretical Performance Limits With Jcd (Pre-fusion)mentioning

confidence: 99%

“…This is expedient to understand the benefits (performance-wise) of the use of correlation in the decoding phase, before fusion. In order to derive theoretical performance limits, in the AWGN case we utilize the concept of feasible capacity region introduced in [15], [16], whereas in the block fading case we introduce the concept of outage feasible capacity region, which represents the feasible capacity region for a given (acceptable) outage probability.…”

Section: Theoretical Performance Limits With Jcd (Pre-fusion)mentioning

confidence: 99%

See 3 more Smart Citations

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

Section: B Complete Performance Analysis: Decoding and Fusionsupporting

confidence: 70%

Section: òò ð× öóñmentioning

confidence: 98%

Section: Theoretical Performance Limits With Jcd (Pre-fusion)mentioning

confidence: 99%

Section: Theoretical Performance Limits With Jcd (Pre-fusion)mentioning

confidence: 99%

See 2 more Smart Citations

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

show abstract

“…(28) Therefore, expression (24) for the PO in the ideal case can be directly extending by considering proper integration extremes: 3 In Section II, {λ k } are capacities. Here, they are the feasible rates for the considered JCD schemes.…”

Section: B Exit Chart-based Performance Analysis Of Jcd Schemes Withmentioning

confidence: 99%

On Non-Cooperative Block-Faded Orthogonal Multiple Access Schemes with Correlated Sources

Abrardo¹,

Ferrari

Martalò

2011

IEEE Trans. Commun.

View full text Add to dashboard Cite

Abstract-In this paper, we study the performance of noncooperative multiple access systems with noisy separated channels, where correlated sources communicate to an access point (AP) through block-faded links. In the considered scenario, perfect channel state information (CSI) is assumed at the receiver while no CSI is available at the transmitters. We first consider uncoded transmissions from the sources to the AP, which exploits the source correlation to carry out joint channel detection (JCD). In this scenario, we propose an analytical approach to evaluate the achievable performance in terms of average bit error rate (BER). We then investigate the impact of coding, considering the same fixed coding scheme at each source. Then, we consider an extrinsic information transfer (EXIT) chart-based framework to optimize the design of concatenated and low-density parity-check (LDPC) codes for JCD schemes.

show abstract

Universality for the noisy Slepian-Wolf problem via spatial coupling

Yedla

Pfister

Narayanan

2011

2011 IEEE International Symposium on Information Theory Proceedings

View full text Add to dashboard Cite

Abstract-We consider a noisy Slepian-Wolf problem where two correlated sources are separately encoded and transmitted over two independent binary memoryless symmetric channels. Each channel capacity is assumed to be characterized by a single parameter which is not known at the transmitter. The receiver has knowledge of both the source correlation and the channel parameters. We call a system universal if it retains near-capacity performance without channel knowledge at the transmitter.Kudekar et al. recently showed that terminated low-density parity-check (LDPC) convolutional codes (a.k.a. spatially-coupled LDPC ensembles) can have belief-propagation thresholds that approach their maximum a-posteriori thresholds. This was proven for binary erasure channels and shown empirically for binary memoryless symmetric channels. They also conjectured that the principle of spatial coupling is very general and the phenomenon of threshold saturation applies to a very broad class of graphical models. In this work, we derive an area theorem for the joint decoder and empirically show that threshold saturation occurs for this problem. As a result, we demonstrate near-universal performance for this problem using the proposed spatiallycoupled coding system. A similar result is also discussed briefly for the 2-user multiple-access channel.

show abstract

Density evolution-based analysis and design of LDPC codes with a priori information

Cited by 9 publications

References 26 publications

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

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

On Non-Cooperative Block-Faded Orthogonal Multiple Access Schemes with Correlated Sources

Universality for the noisy Slepian-Wolf problem via spatial coupling

Contact Info

Product

Resources

About