Turbo Product Codes for Mobile Multimedia Broadcasting With Partial-Time Jamming

Xu, Chao; Liang, Ying‐Chang; Guan, Yong Liang; Leon, Wing Seng

doi:10.1109/tbc.2006.889681

Cited by 5 publications

(4 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…BP is a classical message passing algorithm which recursively exchanges the belief information between the VNs and CNs in a TG. Before BP is executed, the soft information of each VN is initialized by the channel LLR given in (4). BP iteratively propagates the belief information along the edges of TG from CNs to VNs (denoted by C cm→vn , called a C2V message), and from VNs to CNs (denoted by V vn→cm , called a V2C message).…”

Section: B Bp Decoding With Different Scheduling Strategiesmentioning

confidence: 99%

“…R EED-Solomon (RS) codes [1] and Bose-Chaudhuri-Hocquenghem (BCH) codes are high-density paritycheck (HDPC) codes with large minimum Hamming distance and no or low error floors. They have been widely applied in data transmission, broadcasting, and digital storage systems [2]- [4], etc. Recently, it has been shown that BCH codes outperform short block-length polar codes and low-density parity check (LDPC) codes, with decoding error rates close to the coding bounds in the finite block-length regime [5], [6].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Perturbed Adaptive Belief Propagation Decoding for High-Density Parity-Check Codes

Deng

Liu

Guan

et al. 2020

Preprint

Self Cite

View full text Add to dashboard Cite

Algebraic codes such as BCH code are receiving renewed interest as their short block lengths and low/no error floors make them attractive for ultra-reliable low-latency communications (URLLC) in 5G wireless networks. This paper aims at enhancing the traditional adaptive belief propagation (ABP) decoding, which is a soft-in-soft-out (SISO) decoding for high-density parity-check (HDPC) algebraic codes, such as Reed-Solomon (RS) codes, Bose-Chaudhuri-Hocquenghem (BCH) codes, and product codes. The key idea of traditional ABP is to sparsify certain columns of the parity-check matrix corresponding to the least reliable bits with small log-likelihoodratio (LLR) values. This sparsification strategy may not be optimal when some bits have large LLR magnitudes but wrong signs. Motivated by this observation, we propose a Perturbed ABP (P-ABP) to incorporate a small number of unstable bits with large LLRs into the sparsification operation of the paritycheck matrix. In addition, we propose to apply partial layered scheduling or hybrid dynamic scheduling to further enhance the performance of P-ABP. Simulation results show that our proposed decoding algorithms lead to improved error correction performances and faster convergence rates than the prior-art ABP variants.

show abstract

Section: B Bp Decoding With Different Scheduling Strategiesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Perturbed Adaptive Belief Propagation Decoding for High-Density Parity-Check Codes

Deng

Liu

Guan

et al. 2020

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…B. Partial-time Jamming [14] A partial time jammer turns on and off periodically according to the jamming factor ρ = Ton Ton+T of f , where T on and T of f denote the periods in which the jammer is on and off, respectively. In addition, the summation of T on and T of f is called the jamming duty cycle.…”

Section: Jamming Modelsmentioning

confidence: 99%

On the Antijamming Performance of the NR-DCSK System

Nguyen

Jung

Kim

2018

Security and Communication Networks

View full text Add to dashboard Cite

This paper investigates the antijamming performance of the NR-DCSK system. We consider practical jamming environments including broadband jamming (BBJ), partial-time jamming (PTJ), tone jamming (TJ), and sweep jamming (SWJ). We first analytically derived the bit error rates of the system under the BBJ and the PTJ. Our results show that the system performances under these two jamming environments are enhanced as increases, where is the parameter of the NR-DCSK modulation scheme denoting the number of times a chaotic sample is repeated. In addition, our results demonstrate that, for the PTJ, the optimal value of the jamming factor is close to zero when the jamming power is small; however, it increases and approaches one as the jamming power enlarges. We then investigate the performance of the system under the TJ and the SWJ via Monte-Carlo simulations. Our simulations show that single-tone jamming causes a more significant performance degradation than multitone jamming. Moreover, we point out that the system performance is significantly degraded when the starting frequency of the sweep jammer is close to the carrier frequency of the transmitted signals, the sweep bandwidth is small, and the sweep time is half of the transmitted bit duration.

show abstract

“…multiple input—multiple output, cooperative, channel and network coding systems [15]–[17]. Secondly, the PJ is in fact a typical interference for wireless communication systems [18]. Consequently, the effects of the PJ on the performance of DCSK system is important and worth being investigated.…”

Section: Introductionmentioning

confidence: 99%

On the performance analysis of a DCSK system under the pulse jamming environment

Khieu

Nguyen

2018

PLoS ONE

View full text Add to dashboard Cite

This paper considers the DCSK system under jamming environment. We consider both fast and slow switching pulse jamming (PJ). We derive approximations of the system bit error rates (BERs) in analytic expressions containing only well-known special functions, from which we show that for both jamming cases increasing the spreading factor can enhance the BER. In addition, we reveal that under the fast switching PJ, the BER does not depend on the jamming duty cycle ρ when ρ ≤ 0.5, however when ρ > 0.5, increasing its value degrades the BER. Moreover, we find out that under the slow switching PJ, increasing ρ may either enhance or degrade the BER.

show abstract

Turbo Product Codes for Mobile Multimedia Broadcasting With Partial-Time Jamming

Cited by 5 publications

References 24 publications

Perturbed Adaptive Belief Propagation Decoding for High-Density Parity-Check Codes

Perturbed Adaptive Belief Propagation Decoding for High-Density Parity-Check Codes

On the Antijamming Performance of the NR-DCSK System

On the performance analysis of a DCSK system under the pulse jamming environment

Contact Info

Product

Resources

About