检索结果-内蒙古大学图书馆

Reduced complexity hard- and soft-input BCH decoding with applications in concatenated codes

IET CIRCUITS DEVICES & SYSTEMS 2021年第3期15卷 284-296页

作者： Freudenberger, Juergen Bailon, Daniel Nicolas Safieh, Malek Univ Appl Sci Inst Syst Dynam ISD HTWG Konstanz Constance Germany

Error correction coding for optical communication and storage requires high rate codes that enable high data throughput and low residual errors. Recently, different concatenated coding schemes were proposed that are based on binary BCH codes with low error correcting capabilities. In this work, low-complexity hard- and soft-input decoding methods for such codes are investigated. We propose three concepts to reduce the complexity of the decoder. For the algebraic decoding we demonstrate that Peterson's algorithm can be more efficient than the Berlekamp-Massey algorithm for single, double, and triple error correcting BCH codes. We propose an inversion-less version of Peterson's algorithm and a corresponding decoding architecture. Furthermore, we propose a decoding approach that combines algebraic hard-input decoding with soft-input bit-flipping decoding. An acceptance criterion is utilised to determine the reliability of the estimated codewords. For many received codewords the stopping criterion indicates that the hard-decoding result is sufficiently reliable, and the costly soft-input decoding can be omitted. To reduce the memory size for the soft-values, we propose a bit-flipping decoder that stores only the positions and soft values of a small number of code symbols. This method significantly reduces the memory requirements and has little adverse effect on the decoding performance.

关键词： decoding approach Berlekamp-Massey algorithm error correction coding triple error correcting BCH codes soft-input BCH decoding optical communication low error correcting capabilities double error correcting BCH codes error correction BCH codes decoding concatenated coding schemes soft-values bit-flipping decoder binary codes Peterson's algorithm high data throughput low-complexity hard-input decoding methods error correction codes single error correcting BCH codes low residual errors concatenated codes soft values reduced complexity hard-input BCH decoding soft-input bit-flipping decoding low-complexity soft-input decoding methods code symbols algebraic hard-input decoding high rate codes binary BCH codes decoding architecture decoding performance soft-input decoding parity check codes algebraic decoding

来源：评论

学校读者我要写书评

暂无评论

Huffman tree based metric derivation for a low-complexity sequential soft VLC decoding

Huffman tree based metric derivation for a low-complexity se...

引用

IEEE International Conference on Communications

作者： Perros-Meilhac, L Lamy, C PRF F-92156 Suresnes France

ISBN: (纸本)0780374002

This paper considers VLC decoding algorithms based on MAP sequence estimation techniques, using residual source redundancy to provide channel error correction. These algorithms rely on soft values available at the entrance of the VLC decoder. We present here a new soft VLC decoding algorithm based on a sequential decoding technique that is very efficient in terms of decoding complexity. The application of the considered soft decoding algorithms to practical decoding of MPEG-4 texture Information packets under the assumption of an unequal protection scheme is investigated. Algorithm performance is evaluated on the well-known "Foreman" video sequence. Simulation results show that the proposed algorithm provides approximately the same performance as all existing soft decoding algorithms while exhibiting a significantly lower complexity.

关键词： sequential decoding MAP estimation soft-input decoding variable length codes

来源：评论

学校读者我要写书评

暂无评论

PAPER Low Complexity Overloaded MIMO Non-Linear Detector with Iterative LLR Estimation

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2024年第3期E107B卷 339-348页

作者： Denno, Satoshi Makabe, Shuhei Hou, Yafei Okayama Univ Fac Environm Life Nat & Technol Okayama 7008530 Japan

This paper proposes a non -linear overloaded MIMO detector that outperforms the conventional soft -input maximum likelihood detector (MLD) with less computational complexity. We propose iterative log-likelihood ratio (LLR) estimation and multi stage LLR estimation for the proposed detector to achieve such superior performance. While the iterative LLR estimation achieves better BER performance, the multi stage LLR estimation makes the detector less complex than the conventional soft -input maximum likelihood detector (MLD). The computer simulation reveals that the proposed detector achieves about 0.6 dB better BER performance than the soft -input MLD with about half of the soft -input MLD's complexity in a 6 x 3 overloaded MIMO OFDM system.

关键词： overloaded MIMO non-linear detector soft-input decoding noise cancellation ordering complexity reduction

来源：评论

学校读者我要写书评

暂无评论

New Coding Techniques for Codes over Gaussian Integers

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2013年第8期61卷 3114-3124页

作者： Freudenberger, Juergen Ghaboussi, Farhad Shavgulidze, Sergo Univ Appl Sci Inst Syst Dynam HTWG Konstanz Constance Germany

This work presents block codes over Gaussian integers. We introduce Gaussian integer rings which extend the number of possible signal constellations over Gaussian integer fields. Many well-known code constructions can be used for codes over Gaussian integer rings, e.g., the Plotkin construction or product codes. These codes enable low complexity decoding in the complex domain. Furthermore, we demonstrate that the concept of set partitioning can be applied to Gaussian integers. This enables multilevel code constructions. In addition to the code constructions, we present a low complexity soft-input decoding algorithm for one Mannheim error correcting codes. The presented decoding method is based on list decoding, where the list of candidate codewords is obtained by decomposing the syndrome into two sub-syndromes. Considering all decompositions of the syndrome we construct lists of all possible errors of Mannheim weight two. In the last decoding step the squared Euclidean distance is used to select the best codeword from the list. Simulation results for the additive white Gaussian noise channel demonstrate that the proposed decoding method achieves a significant coding gain compared with hard-input decoding.

关键词： Gaussian integers set partitioning quadrature amplitude modulation Plotkin construction product codes soft-input decoding

来源：评论

学校读者我要写书评

暂无评论

Probability density function of reliability metrics in BICM with arbitrary modulation: Closed-form through algorithmic approach

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2008年第5期56卷 736-742页

作者： Szczecinski, Leszek Bettancourt, Rolando Feick, Rodolfo Univ Quebec Inst Natl Rech Sci INRS EMT Montreal PQ H5A 1K6 Canada Univ Tecn Federico Santa Maria Dept Elect Engn Valparaiso Chile

In the popular bit-interleaved coded modulation (BICM) the output of the channel encoder and the input of the modulator are separated by a bit-level interleaver. From the decoder's point of view, the modulator, the transmission channel, and the demodulator (calculating bits' reliability metrics) become a memoryless BICM channel with binary inputs and real outputs. In unfaded channels, the BICM channel's outputs (reliability metrics) are known to be Gaussian for binary- or quaternary phase shift keying but their probability density function (PDF) is not known for higher-order modulation. We fill this gap by presenting an algorithmic method to calculate closed-form expressions for the PDF of reliability metrics in BICM with arbitrary modulation and bits-to-symbol mapping when the so-called max-log approximation is applied. Such probabilistic description of BICM channel is useful to analyze, from an information- theoretic point of view, any BICM constellation/mapping design.

关键词： logarithmic likelihood ratios L-values bitinterleaved coded modulation probability density functions soft-input decoding LLR BICM PDF

来源：评论

学校读者我要写书评

暂无评论

Probability density function of reliability metrics in BICM with arbitrary modulation: Closed-form through algorithmic approach

Probability density function of reliability metrics in BICM ...

引用

IEEE Global Telecommunications Conference (GLOBECOM 06)

作者： Szczecinski, Leszek Bettancourt, Rolando Feick, Rodolfo Univ Quebec Inst Natl Rech Sci INRS EMT Montreal PQ H5A 1K6 Canada Univ Tecn Federico Santa Maria Dept Elect Engn Valparaiso Chile

ISBN: (纸本)142440357X

关键词： logarithmic likelihood ratios L-values bitinterleaved coded modulation probability density functions soft-input decoding LLR BICM PDF

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：