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

Low-Complexity Near-Optimal Demodulation for Spatial modulation Based on m-algorithm

IEEE WIRELESS COmmUNICATIONS LETTERS 2025年第3期14卷 571-575页

作者： Zheng, Jian Sun, Yutai Zhou, Huayi Zhang, Chuan Southeast Univ Natl Mobile Commun Res Lab LEADS Nanjing 211189 Peoples R China Southeast Univ Frontiers Sci Ctr Mobile Informat Commun & Secur Nanjing 211189 Peoples R China Purple Mt Labs Nanjing 211100 Peoples R China

Spatial modulation (Sm), renowned for its high energy efficiency, stands as a pivotal massive mImO transmission technique. Leveraging the parallel processing capability and superior error rate performance, the m-algorithm to maximum likelihood (mmL) algorithm has emerged as a competitive demodulation method for Sm systems. In mmL, judicious configuration of layer widths can effectively diminish complexity. Nevertheless, existing literature, to the best of our knowledge, relies on empirical settings for layer widths, lacking a formal optimization strategy. In this letter, we propose a layer width optimization algorithm based on mathematical analysis and monte Carlo simulations. Numerical results have demonstrated that the mmL algorithm coupled with our proposed layer width configuration method yields the symbol vector error rate (SVER) comparable to the state-of-the-art optimal demodulation, while achieving a noteworthy complexity reduction.

关键词： Demodulation modulation Symbols Transmitting antennas Vectors monte Carlo methods measurement Complexity theory Receiving antennas Optimization Spatial modulation (Sm) m-algorithm near-optimal demodulation low-complexity

来源：评论

学校读者我要写书评

暂无评论

SORTING-BASED VLSI ARCHITECTURES FOR THE m-algorithm AND T-algorithm TRELLIS DECODERS

引用

IEEE TRANSACTIONS ON COmmUNICATIONS 1995年第2-4期43卷 514-522页

作者： BENGOUGH, PA SImmONS, SJ QUEENS UNIV DEPT ELECT & COMP ENGN KINGSTON ON CANADA

The well-known m-algorithm and the newer T-algorithm are two closely related reduced-complexity trellis-search algorithms that can be used for data sequence estimation in digital communication systems. VLSI implementations of these algorithms are attractive due to the parallelism and simplicity of their operation. While a small number of VLSI structures have been proposed previously, this paper describes new sorting-based architectures that can be used to realize these algorithms. Specifically, schemes based on odd-even transposition, insertion, and weavesorting techniques are presented. Structures are evaluated on the basis of area, time, and power measures. Actual VLSI implementations have been used to verify timing models.

关键词： ARCHITECTURE parallelism decoders algorithms Very large scale integration m-algorithm

来源：评论

学校读者我要写书评

暂无评论

BETTER RATE 1/2 CODED CONTINUOUS-PHASE mODULATION SCHEmES AND THE m-algorithm

引用

IEEE TRANSACTIONS ON INFORmATION THEORY 1993年第5期39卷 1687-1694页

作者： BALACHANDRAN, K ANDERSON, JB FINAmORE, WA PImENTEL, CJL RENSSELAER POLYTECH INST TROYNY 12180 PONTIFICIA UNIV CATOLICA RIO DE JANEIRO CTR STUDIES TELECOMMUNBR-22453 RIO JANEIRORJBRAZIL

Continuous phase modulation (CPm) signals may be precoded by a convolutional code followed by a mapping rule. Better codes may, however, be obtained by a more general code formed by a finite state machine. We provide improved codes for one such finite state machine. A new description of codes and design rules are presented. Better results are demonstrated for the partial response CPm schemes and previous optimum results are matched for the full response case. Tests of an m-algorithm decoder achieve near maximum-likelihood performance with only a fraction of the complexity of the Viterbi algorithm.

关键词： TRELLIS CODES CONVOLUTIONALLY CODED CPm CONSTANT ENVELOPE mODULATION SEQUENTIAL DECODING m-algorithm

来源：评论

学校读者我要写书评

暂无评论

Reduced complexity decoding of convolutional codes based on the m-algorithm and the minimal trellis

引用

ANNALS OF TELECOmmUNICATIONS 2012年第11-12期67卷 537-545页

作者： Souza, Richard Demo Pimentel, Cecilio muniz, Daiana Nascimento Fed Univ Technol Parana UTFPR Curitiba Parana Brazil Fed Univ Pernambuco UFPE Recife PE Brazil

In this paper, we propose three new sub-optimum, reduced complexity decoding algorithms for convolutional codes. The algorithms are based on the minimal trellis representation for the convolutional code and on the m-algorithm. Since the minimal trellis has a periodically time-varying state profile, each algorithm has a different strategy to select the number of surviving states in each trellis depth. We analyse both the computational complexity, in terms of arithmetic operations, and the bit error rate performance of the proposed algorithms over the additive white Gaussian noise channel. Results demonstrate that considerable complexity reductions can be obtained at the cost of a small loss in the performance, as compared to the Viterbi decoder.

关键词： Convolutional codes minimum trellis m-algorithm Viterbi decoding

来源：评论

学校读者我要写书评

暂无评论

A simplified noise-predictive partial response maximum likelihood detection using m-algorithm for perpendicular magnetic recording channels

引用

IEEE TRANSACTIONS ON mAGNETICS 2005年第2期41卷 1064-1066页

作者： Lee, J Lee, J Dongguk Univ Dept Elect Engn Seoul 100715 South Korea

We propose a simplified noise-predictive partial response maximum likelihood (NPmL) system in conjunction with m-algorithm for dual-layered perpendicular magnetic recording channels. The complexity, which is increased by the construction of noise prediction filter, can be reduced through the m-algorithm. Despite the complexity of the proposed scheme (m = 4) is decreased to 1/4 than one of the full NP(12321)mL system, two Systems maintain almost the same bit-error rate and the detection performance of the noise-predictive maximum likelihood is better than that of the conventional PRmL.

关键词： hard disk drive m-algorithm noise-predictive partial response maximum likelihood (NPmL) detection perpendicular magnetic recording

来源：评论

学校读者我要写书评

暂无评论

Adaptive Selection of Surviving Symbol Replica Candidates for Quasi-maximum Likelihood Detection Using m-algorithm with QR-Decomposition for OFDm mImO multiplexing

引用

IEICE TRANSACTIONS ON COmmUNICATIONS 2009年第4期E92B卷 1258-1271页

作者： Higuchi, Kenichi Kawai, Hiroyuki Taoka, Hidekazu maeda, Noriyuki Sawahashi, mamoru Tokyo Univ Sci Dept Elect Engn Noda Chiba 2788510 Japan NTT DOCOMO INC Radio Access Network Dev Dept Yokosuka Kanagawa 2398536 Japan Musashi Inst Technol Dept Informat Network Engn Tokyo 1588557 Japan

This paper proposes an adaptive selection algorithm for the surviving symbol replica candidates (ASESS) based on the maximum reliability in maximum likelihood detection with QR decomposition and the m-algorithm (QRm-mLD) for Orthogonal Frequency Division multiplexing (OFDm) multiple-input multiple-output (mImO) multiplexing. In the proposed algorithm, symbol replica candidates newly-added at each stage are ranked for each surviving symbol replica from the previous stage using multiple quadrant detection. Then, branch metrics are calculated only for the minimum number of symbol replica candidates with a high level of reliability using an iterative loop based on symbol ranking results. Computer simulation results show that the computational complexity of the QRm-mLD employing the proposed ASESS algorithm is reduced to approximately 1/4 and 1/1200 compared to that of the original QRm-mLD and that of the conventional mLD with squared Euclidian distance calculations for all symbol replica candidates, respectively, assuming the identical achievable average packet error rate (PER) performance in 4-by-4 mImO multiplexing with 16QAm data modulation. The results also show that 1-Gbps throughput is achieved at the average received signal energy per bit-to-noise power spectrum density ratio (E-b/N-0) per receiver antenna of approximately 9 dB using the ASESS algorithm in QRm-mLD associated with 16QAm modulation and Turbo coding with the coding rate of 8/9 assuming a 100-mHz bandwidth for a 12-path Rayleigh fading channel (root mean square (r.m.s.) delay spread of 0.26 mu s and maximum Doppler frequency of 20 Hz).

关键词： OFDm mImO spatial multiplexing maximum likelihood detection m-algorithm

来源：评论

学校读者我要写书评

暂无评论

Reduced Complexity Path Selection Networks for m-algorithm Read Channel Detectors

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEmS I-REGULAR PAPERS 2008年第9期55卷 2924-2933页

作者： Power, martin Tosi, Sebastien Conway, Thomas Univ Limerick Dept Elect & Comp Engn Limerick Ireland

The m-algorithm is a reduced complexity, breadth-first, trellis search alternative to the Viterbi algorithm. It is particularly useful when the number of trellis states is so large as to render Viterbi detection impractical. When dealing with complex or long target responses, values of m >= 16 may be required in order to approach mLD performance. Performing path selection for m >= 16 using previously reported methods can be computationally complex and prohibitive to practical hardware implementation. This paper details reduced complexity path selection networks for use with large values of m. A strategy for the construction of reduced complexity networks is presented and can be used to create networks for a variety of values of m and for other applications where m-algorithm detection can be employed. The use of these networks will allow for practical realisable hardware implementations of m-algorithm detectors for m >= 16.

关键词： magnetic storage m-algorithm read channel detectors sorting networks Viterbi detection

来源：评论

学校读者我要写书评

暂无评论

EXIT analysis of m-algorithm based mImO detectors and LDPC code design optimization

引用

Science in China(Series F) 2009年第12期52卷 2248-2258页

作者： YOU mingHou1,2, TAO XiaoFeng1,2, CUI Qimei1,2 & ZHANG Ping1,2 1 Wireless Technology Innovation Institute, Beijing University of Posts and Telecommunications, Beijing 100876, China 2 Key Laboratory of Universal Wireless Communications, (Beijing University of Posts and Telecommunications), ministry of Education, Beijing 100876, China Wireless Technology Innovation Institute Beijing University of Posts and Telecommunications Beijing 100876 China Key Laboratory of Universal Wireless Communications (Beijing University of Posts and Telecommunications) Ministry of Education Beijing 100876 China

This paper investigates joint design and optimization of both low density parity check （LDPC） codes and m-algorithm based detectors including iterative tree search （ITS） and soft-output m-algorithm （SOmA） in multiple-input multiple-output （mImO） systems via the tool of extrinsic information transfer （EXIT） charts. First, we present EXIT analysis for ITS and SOmA. We indicate that the extrinsic information transfer curves of ITS obtained by monte Carlo simulations based on output log-likelihood rations are not true EXIT curves, and the explanation for such a phenomenon is given, while for SOmA, the true EXIT curves can be computed, enabling the code design. Then, we propose a new design rule and method for LDPC code degree profile optimization in mImO systems. The algorithm can make the EXIT curves of the inner decoder and outer decoder match each other properly, and can easily attain the desired code with the target rate. Also, it can transform the optimization problem into a linear one, which is computationally simple. The significance of the proposed optimization approach is validated by the simulation results that the optimized codes perform much better than standard non-optimized ones when used together with SOmA detector.

关键词： mImO systems iterative receiver LDPC codes code optimization EXIT charts m-algorithm

来源：评论

学校读者我要写书评

暂无评论

Robust Bit-Level m-algorithm for mImO Detection

引用

CHINESE JOURNAL OF ELECTRONICS 2009年第4期18卷 719-723页

作者： Yang Yuan Zhang Hailin Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Peoples R China

This paper presents a robust and efficient detection algorithm for mImO wireless systems. The proposed scheme employs a novel combination of bit-level signal representation, mmSE-preprocessing and m-algorithm. The proposed bit-level algorithm exploits the structure of the QAm constellation by separating each bit of the signal to reduce the associated complexity of the listing and metric updating steps. In the joint detection/decoding systems, the proposed scheme visits less number of nodes by exploiting the extrinsic information obtained by the decoder. Our scheme may be employed in the rank-deficient system. Simulation results demonstrate that the bit-level detector achieves almost the same performance as the existing m-algorithm and it achieves a more significant gain in terms of complexity reduction.

关键词： multiple-input multiple-output (mImO) Iterative detection m-algorithm Bit-level

来源：评论

学校读者我要写书评

暂无评论

LOW-COmPLEXITY AND HIGH-PERFORmANCE SOFT mImO DETECTION BASED ON DISTRIBUTED m-algorithm THROUGH TRELLIS-DIAGRAm

LOW-COMPLEXITY AND HIGH-PERFORMANCE SOFT MIMO DETECTION BASE...

引用

2010 IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Sun, Yang Cavallaro, Joseph R. Rice Univ Dept Elect & Comp Engn Houston TX 77005 USA

ISBN: (纸本)9781424442966

This paper presents a novel low-complexity multiple-input multiple-output (mImO) detection scheme using a distributed m-algorithm (Dm) to achieve high performance soft mImO detection. To reduce the searching complexity, we build a mImO trellis graph and split the searching operations among different nodes, where each node will apply the m-algorithm. Instead of keeping a global candidate list as the traditional detector does, this algorithm keeps multiple small candidate lists to generate soft information. Since the Dm algorithm can achieve good BER performance with a small m, the sorting cost of the Dm algorithm is lower than that of the conventional K-best mImO algorithm. The proposed algorithm is very suitable for high speed parallel processing.

关键词： mImO m-algorithm Soft Detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：