Design of Turbo Codes over GF(q) with q-ary Orthogonal Modulation

Kim, Yongsang; Cheun, Kyungwhoon; Yang, Kyeongcheol; Sagong, Min

doi:10.1109/tcomm.2011.012711.090402

Cited by 7 publications

(3 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kim et al [27] proposed a simple design rule. This rule was proposed for parallel concatenated Turbo codes over GF (q) with q-ary orthogonal modulation under AWGN and independent Rayleigh fading channels with coherent and noncoherent detection.…”

Section: Related Workmentioning

confidence: 99%

The A3D-TC: An Adaptive Approach for Selecting Third Component Parameters to Generate Robust Turbo Codes

Kshirsagar¹,

Nagabhooshanam²

2012

IJCA

View full text Add to dashboard Cite

In recent days, the introduction of third component in conventional turbo codes proved to be effective in improving the code performance. In such third component enabled turbo codes, the parameters such as permeability and permittivity rates seems to be very static and so such codes cannot perform under different noisy environments. In this paper, an adaptive third component turbo code (A3D-TC) is proposed to solve the aforesaid drawbacks. In A3D-TC, the third component parameters are made adaptive. This is accomplished by generating a GA-based knowledge source and feeding it to feed forward neural network. The network outputs third component parameters according to the noise and signal strengths so that bit error rate at decoding section can be minimized in an effective way. Extensive experimental results prove the performance of A3D-TC over the conventional 3D-TC under various noisy environments.

show abstract

Section: Related Workmentioning

confidence: 99%

The A3D-TC: An Adaptive Approach for Selecting Third Component Parameters to Generate Robust Turbo Codes

Kshirsagar¹,

Nagabhooshanam²

2012

IJCA

View full text Add to dashboard Cite

show abstract

“…Moreover, the performance gain grows further in coded modulation (CM) schemes with orthogonal modulation, as can be expected from the fact that the CM channel capacity is larger than the bit-interleaved coded modulation (BICM) channel capacity over AWGN and Rayleigh-fading channels [15,16]. However, the complexity of the q-ary sum-product algorithm (QSPA) for decoding NB-LDPC codes increases drastically with q.…”

Section: Introductionmentioning

confidence: 99%

“…In recent years, non‐binary LDPC (NB‐LDPC) codes over GF( q ), the finite field with q elements, have drawn much attention because of their remarkable performance gain over binary LDPC codes by increasing q [7–14]. Moreover, the performance gain grows further in coded modulation (CM) schemes with orthogonal modulation, as can be expected from the fact that the CM channel capacity is larger than the bit‐interleaved coded modulation (BICM) channel capacity over AWGN and Rayleigh‐fading channels [15, 16]. However, the complexity of the q ‐ary sum‐product algorithm (QSPA) for decoding NB‐LDPC codes increases drastically with q .…”

Section: Introductionmentioning

confidence: 99%

Low‐latency low‐complexity heap‐based extended min‐sum algorithms for non‐binary low‐density parity‐check codes

2015

Self Cite

View full text Add to dashboard Cite

The extended min-sum (EMS) and improved EMS (I-EMS) algorithms for non-binary low-density parity-check codes over GF(q) significantly reduce the decoding complexity with an acceptable performance degradation, but they suffer from high latency because of many serial computations, including a sorting process. On the other hand, the trellis-based EMS algorithm can greatly reduce the latency, but it does not solve the complexity problem in high-order fields (q ≥ 64). To improve the latency problem with low-complexity advantages, the authors propose heap-based EMS (H-EMS) and heap-based I-EMS (HI-EMS) algorithms that are modifications of the EMS and I-EMS algorithms, respectively. The authors also propose double H-EMS and double HI-EMS algorithms trading off the latency against the performance by heaping messages twice. Numerical results show that the H-EMS algorithm has 2.74-9.52 times lower latency than the EMS algorithm with a negligible performance degradation over a wide range of code rates, whereas the HI-EMS algorithm has 1.20-1.62 times lower latency than the I-EMS algorithm. Furthermore, the proposed algorithms may be employed regardless of the decoding schedules.

show abstract

FQAM : A modulation scheme for beyond 4G cellular wireless communication systems

Hong

Sagong

Lim

et al. 2013

2013 IEEE Globecom Workshops (GC Wkshps)

View full text Add to dashboard Cite

Design of Turbo Codes over GF(q) with q-ary Orthogonal Modulation

Cited by 7 publications

References 22 publications

The A3D-TC: An Adaptive Approach for Selecting Third Component Parameters to Generate Robust Turbo Codes

The A3D-TC: An Adaptive Approach for Selecting Third Component Parameters to Generate Robust Turbo Codes

Low‐latency low‐complexity heap‐based extended min‐sum algorithms for non‐binary low‐density parity‐check codes

FQAM : A modulation scheme for beyond 4G cellular wireless communication systems

Contact Info

Product

Resources

About