The complexities and latencies of iterative belief propagation ( BP) and threshold decoding techniques for a new class of convolutional self- orthogonalcodes are analysed using forward- only pipeline architectures. C...
详细信息
The complexities and latencies of iterative belief propagation ( BP) and threshold decoding techniques for a new class of convolutional self- orthogonalcodes are analysed using forward- only pipeline architectures. Computer simulation results show that over the additive white Gaussian noise channel at moderate signal-to-noise ratios, BP decoding yields one half the decoding delay when compared with threshold decoding at essentially the same error performances. However, the reduction in the decoding delay using BP is obtained at the cost of an increase of the implementation complexity.
Iterative decoding of orthogonal convolutional code is widely used for its excellent performance. However, the iterations lead to high complexity and long decoding delay, which is unsuitable for low-rate voice service...
详细信息
ISBN:
(纸本)9781479980918
Iterative decoding of orthogonal convolutional code is widely used for its excellent performance. However, the iterations lead to high complexity and long decoding delay, which is unsuitable for low-rate voice service in mobile satellite communications with on-board processing. In this paper, a novel scheme of orthogonalconvolutional coding as well as an associated non-iterative joint decoding algorithm based on factor graph are proposed. Due to its non-iterative nature, this novel scheme has low decoding complexity and short latency, which indicates its potential on-board use in the low-rate satellite voice service, or other kinds of services with a high bit error rate (BER) tolerance and a tight delay requirement. Simulation results demonstrate the efficacy of the proposed novel coding scheme and non-iterative decoding algorithm in both AWGN and Rician channels.
Iterative decoding of orthogonal convolutional code is widely used for its excellent performance. However, the iterations lead to high complexity and long decoding delay, which is unsuitable for low-rate voice service...
详细信息
ISBN:
(纸本)9781479980925
Iterative decoding of orthogonal convolutional code is widely used for its excellent performance. However, the iterations lead to high complexity and long decoding delay, which is unsuitable for low-rate voice service in mobile satellite communications with on-board processing. In this paper, a novel scheme of orthogonalconvolutional coding as well as an associated non-iterative joint decoding algorithm based on factor graph are proposed. Due to its non-iterative nature, this novel scheme has low decoding complexity and short latency, which indicates its potential on-board use in the low-rate satellite voice service, or other kinds of services with a high bit error rate (BER) tolerance and a tight delay requirement. Simulation results demonstrate the efficacy of the proposed novel coding scheme and non-iterative decoding algorithm in both AWGN and Rician channels.
暂无评论