Recovering the interleaver of an unknown turbo-code

Tillich, Jean–Pierre; Tixier, Audrey; Sendrier, Nicolas

doi:10.1109/isit.2014.6875341

Cited by 15 publications

(19 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, it is always mandatory to design an intelligent receiver system which adapts itself to any specific application [5,6]. The parameter estimation techniques is also useful in the study of DNA sequences to identify possible error correcting codes in the genetic code as reported in [7,8] apart from the mentioned applications.…”

Section: Introductionmentioning

confidence: 99%

Blind recognition of LDPC code parameters over erroneous channel conditions

Swaminathan

Kumar

Wang

et al. 2019

IET signal process.

View full text Add to dashboard Cite

Blind reconstruction of channel coding parameters plays a significant role in non-cooperative military and spectrum surveillance applications. Further, it also gives additional advantages in applications such as cognitive radio, adaptive modulation and coding, and so on. In this study, blind estimation algorithms are proposed to identify code dimension and codeword length parameters of low-density parity-check (LDPC) codes at the receiver over noisy or erroneous channel conditions assuming a non-cooperative scenario. The proposed algorithms are validated using different test cases. Moreover, the accuracy of estimation of code dimension and codeword length parameters of LDPC codes using the proposed algorithms is also given for different M-ary phase-shift keying schemes. From the simulation results, it is observed that the accuracy of estimation improves with decrease in code rate, codeword length, and modulation order.

show abstract

Section: Introductionmentioning

confidence: 99%

Blind recognition of LDPC code parameters over erroneous channel conditions

Swaminathan

Kumar

Wang

et al. 2019

IET signal process.

View full text Add to dashboard Cite

show abstract

“…The design of practical algorithms for the above version of blind detection of channel codes has drawn significant attention in the past years. For example, various heuristic methods have been proposed for the blind detection of Hamming and BCH codes [1], [2], convolutional codes [3], [4], Turbo codes [5], [6], LDPC codes [7], [8], and polar codes [9]- [12]. In contrast, comparatively little is known about the fundamental computational complexity of the blind code detection problem.…”

Section: Introductionmentioning

confidence: 99%

On the Computational Complexity of Blind Detection of Binary Linear Codes

Balatsoukas‐Stimming

Filos-Ratsikas

2019

2019 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

In this work, we study the computational complexity of the MINIMUM DISTANCE CODE DETECTION problem. In this problem, we are given a set of noisy codeword observations and we wish to find a code in a set of linear codes C of a given dimension k, for which the sum of distances between the observations and the code is minimized. We prove that, for the practically relevant case when the set C only contains a fixed number of candidate linear codes, the detection problem is NPhard and we identify a number of interesting open questions related to the code detection problem.

show abstract

“…The blind code detection task has been shown to be NP-hard in general [1], [2], so that heuristic algorithms are used in practice. For example, various methods have been proposed for the blind detection of Hamming and BCH codes (e.g., [3], [4] and references therein), convolutional codes (e.g., [5], [6] and references therein), Turbo codes (e.g., [7], [8] and references therein), and LDPC codes (e.g., [9], [10] and references therein). However, so far, the blind detection of polar codes, which were recently included in the 5G standard, has received little attention [11]- [13].…”

Section: Introductionmentioning

confidence: 99%

On the Tradeoff Between Accuracy and Complexity in Blind Detection of Polar Codes

Giard

Balatsoukas‐Stimming

Burg

2018

2018 IEEE 10th International Symposium on Turbo Codes &Amp; Iterative Information Processing (ISTC)

View full text Add to dashboard Cite

Polar codes are a recent family of error-correcting codes with a number of desirable characteristics. Their disruptive nature is illustrated by their rapid adoption in the 5 th -generation mobile-communication standard, where they are used to protect control messages. In this work, we describe a two-stage system tasked with identifying the location of control messages that consists of a detection and selection stage followed by a decoding one. The first stage spurs the need for polar-code detection algorithms with variable effort to balance complexity between the two stages. We illustrate this idea of variable effort for multiple detection algorithms aimed at the first stage. We propose three novel blind detection methods based on belief-propagation decoding inspired by early-stopping criteria. Then we show how their reliability improves with the number of decoding iterations to highlight the possible tradeoffs between accuracy and complexity. Additionally, we show similar tradeoffs for a detection method from previous work. In a setup where only one block encoded with the polar code of interest is present among many other blocks, our results notably show that, depending on the complexity budget, a variable number of undesirable blocks can be dismissed while achieving a missed-detection rate in line with the block-error rate of a complex decoding algorithm.

show abstract

Recovering the interleaver of an unknown turbo-code

Cited by 15 publications

References 18 publications

Blind recognition of LDPC code parameters over erroneous channel conditions

Blind recognition of LDPC code parameters over erroneous channel conditions

On the Computational Complexity of Blind Detection of Binary Linear Codes

On the Tradeoff Between Accuracy and Complexity in Blind Detection of Polar Codes

Contact Info

Product

Resources

About