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

A fast sphere decoding algorithm for space-frequency block codes

EURASIP JOURNAL ON APPLIED SIGNAL PROCESSING 2006年第1期2006卷 097676-097676页

作者： Safar, Zoltan Su, Weifeng Liu, K. J. Ray Univ Maryland Dept Elect & Comp Engn A James Clark Sch Engn College Pk MD 20742 USA Univ Maryland Syst Res Inst College Pk MD 20742 USA Nokia Modern Syst Design Technol Platforms DK-1790 Copenhagen Denmark SUNY Buffalo Dept Elect Engn Sch Engn & Appl Sci Buffalo NY 14260 USA

The recently proposed space-frequency-coded MIMO-OFDM systems have promised considerable performance improvement over single-antenna systems. However, in order to make multiantenna OFDM systems an attractive choice for practical applications, implementation issues such as decoding complexity must be addressed successfully. In this paper, we propose a computationally efficient decoding algorithm for space-frequency block codes. The central part of the algorithm is a modulation-independent sphere decoding framework formulated in the complex domain. We develop three decoding approaches: a modulation-independent approach applicable to any memoryless modulation method, a QAM-specific and a PSK-specific fast decoding algorithm performing nearest-neighbor signal point search. The computational complexity of the algorithms is investigated via both analysis and simulation. The simulation results demonstrate that the proposed algorithm can significantly reduce the decoding complexity. We observe up to 75% reduction in the required FLOP count per code block compared to previously existing methods without noticeable performance degradation. Copyright (C) 2006 Hindawi Publishing Corporation. All rights reserved.

关键词： Spheres decoding algorithm performance boost degradation of performance algorithms decoding complexity classes central portion Block codes

来源：评论

学校读者我要写书评

暂无评论

The syndromes decoding algorithm in group codes

引用

FINITE FIELDS AND THEIR APPLICATIONS 2023年第1期89卷

作者： Martinez, Consuelo Molina, Fabian Univ Oviedo Dept Matemat Oviedo Spain

Our aim is the design of an efficient decoding algorithm in group codes. The algorithm is inspired by the well known syndrome decoding algorithm for linear codes and uses the decomposition of a semisimple group algebra KG as a direct sum of two-sided ideals, each of them generated by a central idempotent of KG. When G is an abelian group the algorithm can be modified to make it very simple and efficient. Some illustrative examples are presented.(c) 2023 Elsevier Inc. All rights reserved.

关键词： Linear code decoding algorithm Group algebra Semisimple algebra Group code

来源：评论

学校读者我要写书评

暂无评论

Geometrical decoding algorithm and the correcting limit of high-dimensional hypercubic ring code:: Correction ability at 20^-1 to 10^-2

引用

ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE 2001年第5期84卷 75-85页

作者： Kuroda, S Yamaguchi, E Takumi, I Hata, M Nagoya Inst Technol Dept Artificial Intelligence & Comp Sci Nagoya Aichi 466 Japan

In this paper, a new decoding algorithm is proposed in which high-dimensional coding is done in a parity check code (high-dimensional ring code). The decoding method for the previously reported ring code has a complex correcting algorithm and requires much calculation time. We have focused on the point that a high-dimensional ring code can be divided into a number of two-dimensional ring codes, and by repeating the error correction of two-dimensional ring codes that requires small computation, we can perform error correction of high-dimensional ring codes. This decoding algorithm has a correction ability similar to the conventional decoding algorithms but with less computation. Moreover, when the error rate is high, random error and burst errors are mixed and an error correcting code is needed. However, since the decoding algorithm of the proposed code has a provision for dimensional division and the error generated on the transmitted block can be uniformly distributed on each two-dimensional plane, the error on the channel in the two-dimensional plane becomes random and error correction can be done efficiently. Moreover, if analysis or simulation increases the number of dimensions, then the correction ability is increased and the limit of the correction ability is determined from the size m of the code. The performance of convolutional codes and Reed Solomon codes is compared and it is shown that the ring code has high processing gain of error correction and that if the threshold point of correction lies in the high-error-rate region, then the decoding error rate is small and this code can be applied to high-error-rate correction. (C) 2001 Scripta Technica.

关键词： error correcting code high error rate high-dimensional ring code decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

A decoding algorithm for Cyclic Codes over Symbol-Pair Read Channels

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2015年第12期E98A卷 2415-2422页

作者： Takita, Makoto Hirotomo, Masanori Morii, Masakatu Kobe Univ Grad Sch Engn Kobe Hyogo 6578501 Japan Saga Univ Grad Sch Sci & Engn Saga 8408502 Japan

Cassuto and Blaum presented a new coding framework for channels whose outputs are overlapping pairs of symbols in storage applications. Such channels are called symbol-pair read channels. Pair distance and pair error are used in symbol-pair read channels. Yaakobi et al. proved a lower bound on the minimum pair distance of cyclic codes. Furthermore, they provided a decoding algorithm for correcting pair errors using a decoder for cyclic codes, and showed the number of pair errors that can be corrected by their algorithm. However, their algorithm cannot correct all pair error vectors within half of the minimum pair distance. In this paper, we propose an efficient decoding algorithm for cyclic codes over symbol-pair read channels. It is based on the relationship between pair errors and syndromes. In addition, we show that the proposed algorithm can correct more pair errors than Yaakobi's algorithm.

关键词： symbol-pair read channel cyclic code pair error decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Two-staged Weighted Bit Flipping (WBF) decoding algorithm for LDPC codes

Two-staged Weighted Bit Flipping (WBF) decoding algorithm fo...

引用

IEEE International Workshop on Anti-counterfeiting, Security, Identification, ASID

作者： Kexiang Ma Jing Jin Wei Li Peng Zhang China Academy of Electronics and Information Technology Beijing China Beijing Institute of Astronautical Systems Engineering Beijing China Beijing Institute of Nearspace Vehicle's Systems Engineering Beijing China Northwest Regional Air Traffic Management Bureau of CAAC Xi'an China

In this paper, a two-staged decoding strategy which can be used for the Weighted Bit Flipping (WBF) based decoding algorithm for LDPC codes is presented. At the two stages, a parallel WBF and bit-flipping (BF) algorithms are adopted separately. Correspondingly, by the study of the iterative decoding process of the PWBF algorithm, a simple function is introduced to dynamically implement the switch of two decoding stages. The proposed algorithm can noticeably lower the error floor of PWBF algorithm with a modest increase in computation complexity and hardware cost. The validation of the proposed algorithm is verified by simulation.

关键词： LDPC error floor weighted bit flipping low density parity check codes error floor decoding algorithm bit flipping

来源：评论

学校读者我要写书评

暂无评论

Research on 4-D 8PSK TCM decoding algorithm

Research on 4-D 8PSK TCM Decoding Algorithm

引用

International Conference on Computer Science and Network Technology

作者： Lei Huang Jintao Wang Jun Zhu Jianxin Yang Fei Ren Xiaohong Liu Dept. of Electronic Engineering Tsinghua University Nanjing Research Institute of Electronic Technology Sichuan Changhong Electronic Co.LTD

ISBN: (纸本)9781467329637

The bit error performance of four states 8PSK trellis coding modulation Viterbi decoding was deduced using the iterative calculation method with the probability density function measured by the path. The results show that in the condition of very low signal-to-noise ratio, when the BER is 10~(-5), E_b/N_0 of the 4-D 8PSK TCM system is 3 dB smaller than the QPSK system without coding at the same modulation efficiency.

关键词： TCM Viterbi Modulation 8-PSK Probability density function computational methods modulation efficiency Bit error rate trellis coded modulation decoding algorithm error performance signal to noise ratios low SNR

来源：评论

学校读者我要写书评

暂无评论

A decoding algorithm for Spinal Codes over Fading Channel 23

A Decoding Algorithm for Spinal Codes over Fading Channel

引用

Proceedings of the 2023 9th International Conference on Communication and Information Processing

作者： Zixuan Zhang Ling Zhao Jiaming Bai Beihang University China

ISBN: (纸本)9798400708909

The quality of wireless channels between mobile vehicles can vary greatly, resulting in significant differences in the quality of received symbols. Additionally, Spinal codes decode sequentially, which means that a single poor quality symbol can cause the entire message to fail to decode. To address this issue, a dynamic stack decoding algorithm is proposed in this paper. By leveraging equalization results at the receiver, the decoder can make approximate assessments of symbol quality, enabling targeted adjustments of the search range for each layer. This approach reduces decoding redundancy by narrowing the search range for layers with better received symbol quality, while expanding the search range for layers with poorer quality, making it easier to capture the correct path. Simulation results validate the effectiveness of the proposed algorithm in improving rate performance and concurrently reducing computation cost.

关键词： decoding algorithm fading channel rateless coding spinal codes

来源：评论

学校读者我要写书评

暂无评论

Inplementation of PCM Coding and decoding algorithm Based on C Language

Inplementation of PCM Coding and Decoding Algorithm Based on...

引用

Advanced Electronic Materials, Computers and Software Engineering (AEMCSE), International Conference on

作者： Yue Wang Zhenyu Wang Xiaozhuo Li Jianghuan Xie Kai Qu Kunming University of Science and Technology Kunming China Xi'an University of posts and Telecommunications Xi'an China North Western University Xi'an China

ISBN: (数字)9781728181431

ISBN: (纸本)9781728181448

In order to solve the problem that the A-law 13 polyline coding algorithm lacks a specific programming language simulation, C language is used to implement the algorithm in this paper. First, the polar code is obtained according to the positive and negative sample values. Then the paragraph code and the inner code are obtained and finally decoded. Experimental results show that the program can realize A-law 13 polyline encoding and decoding, and for a given sample value, it can obtain its 8-bit encoding. Compared with the bit-wise encoding method, the program is more efficient.

关键词： PCM coding C language C language decoding algorithm coding Pulse code modulation Broken line decoding

来源：评论

学校读者我要写书评

暂无评论

A Modified Fixed Sphere decoding algorithm for Under-Determined MIMO Systems

A Modified Fixed Sphere Decoding Algorithm for Under-Determi...

引用

IEEE Global Communications Conference

作者： Chen Qian Jingxian Wu Yahong Rosa Zheng Zhaocheng Wang Tsinghua National Laboratory for Information Science and Technology (TNList) Dept. of Electronic Engineering Tsinghua University Dept. of Electrical Engineering University of Arkansas Dept. of Electrical & Computer Eng. Missouri University of Science & Technology

ISBN: (纸本)9781467309202

A modified FSD algorithm is proposed for under-determined (UD) multiple-input multiple-output (MIMO) systems with N transmit antennas and M < N receive antennas. This paper focuses on the low-complexity detection of coded UD-MIMO systems with iterative turbo detection, where a soft-input soft-output (SISO) MIMO detector exchanges soft information with a SISO decoder. In the first iteration, a modified fixed complexity sphere decoding (FSD) method is developed by utilizing the structure of a UD-MIMO system. The modified FSD employs a new detection ordering scheme that has a lower complexity but a better performance compared to the conventional ordering scheme. From the second iteration and beyond, the MEMO detector is implemented with a generalized serial interference cancelation (GSIC) scheme and a block decision feedback e-qualizer (BDFE) to further reduce the complexity. Simulation results show that the newly proposed FSD-GSIC-BDFE structure can achieve significant performance gains over existing schemes, especially for systems with high level modulations.

关键词： multiple input multiple output systems flying spot digitizer transmitting antennas decoding algorithm Spheres Modified

来源：评论

学校读者我要写书评

暂无评论

A constellation design based on direct insertion and decoding algorithm for noncoherent unitary space-time codes

A constellation design based on direct insertion and decodin...

引用

International Conference on Cyberspace Technology (CCT 2014)

作者： Dongsheng Han Wei Yang Yinghai Xie School of Electrical and Electronic Engineering North China Electric Power University Baoding 071003 China School of Electronic and Information Engineering Beijing Jiaotong University 100044 China

ISBN: (纸本)9781510802704

A novel scheme of unitary space-time constellations generation based on zero vectors adding are proposed for the multiple-antenna communication system. In the scheme, T 2 zero row vectors are added into conventional unitary matrices directly, and the number of new unitary matrices obtained by different positions of the added zero vectors in T symbol duration is ⌊T/T 2 |⌋ times larger than that of conventional unitary matrices. According to the special construction, a corresponding decoding algorithm is proposed with low complexity in flat fading channel. Simulation results show that the proposed the constellation outperform the conventional constellations and the proposed decoding algorithm is efficient and simple.

关键词： Multiple-input multiple output system constellation decoding algorithm unitary space-time constellations zero vector decoding algorithm Zero vector CONSTELLATIONS constellation design Unitary Unitary space-time modulation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：