2016
DOI: 10.1109/tvt.2015.2395382
|View full text |Cite
|
Sign up to set email alerts
|

LDPC Decoding Over Nonbinary Queue-Based Burst Noise Channels

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0
1

Year Published

2016
2016
2021
2021

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 19 publications
0
6
0
1
Order By: Relevance
“…These results consider only f D T =10 −3 , which represents a slow fading channel, but the same methodology can be applied to distinct parameters. The models developed in this work can be used in decoding schemes that employ a joint channel estimation and decoding strategy that exploits the channel memory in the decoding process . An interesting future direction is the construction of BDCs for DFCs with soft decision …”
Section: Resultsmentioning
confidence: 99%
“…These results consider only f D T =10 −3 , which represents a slow fading channel, but the same methodology can be applied to distinct parameters. The models developed in this work can be used in decoding schemes that employ a joint channel estimation and decoding strategy that exploits the channel memory in the decoding process . An interesting future direction is the construction of BDCs for DFCs with soft decision …”
Section: Resultsmentioning
confidence: 99%
“…The multitude of communication standards and protocols make the radio spectrum a highly congested resource where the number of interferers increases considerably [10]. Current techniques associated with suitable modulations and coding implementing a point-to-point link have approached the theoretical limit of Shannon [11]. However, the spectral efficiency acquired by these techniques has not yet managed to overcome the limits of the performances that they must satisfy.…”
Section: Related Workmentioning
confidence: 99%
“…For general binary-input memoryless output-symmetric channels, the general stability condition plays an important role in analyzing the upper bound on the threshold [41], and the stability condition is given in (12), as shown at the bottom of the next page. Based on this condition, we demonstrate some conclusions about the upper bound on thresholds in the following.…”
Section: A Gaussian Approximation Of Ldpc Codes Overmentioning
confidence: 99%
“…However, the concatenated structure would increase decoding complexity and delay. The other way focuses on constructing and optimizing the parity-check matrices of LDPC codes with good error-correction capabilities and large maximum resolvable erasure burst length [4], [5], [11], [12], [22]. The algebraic construction is one of the important design methods for combating the burst erasures noise.…”
Section: Introductionmentioning
confidence: 99%