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

6th International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Yang, Junmei Zhang, Chuan You, Xiaohu Xu, Shugong Southeast Univ Sch Informat Sci & Engn Natl Mobile Commun Res Lab Nanjing Jiangsu Peoples R China Intel Labs Intel Collaborat Res Inst Mobile Networking & Com Beijing Peoples R China

ISBN: (纸本)9781479973392

In this paper, an improved k-best algorithm, which is suitable for low-complexity MIMO detector implementation is proposed. In order to balance the detector's bit-error-rate (BER) performance and computation complexity, several techniques, such as empirical path expansion and relaxed sorting have been proposed. Simulation results have shown that the proposed algorithm can achieve better computation efficiency while keep similar BER performance compared to the state-of-the-art ones. Furthermore, the corresponding detector MIMO architecture is also proposed.

关键词： Multi-input multi-output (MIMO) detector k-best algorithm relaxed sorting

来源：评论

学校读者我要写书评

暂无评论

On an Improved k-best algorithm with High Performance and Low Complexity for MIMO Systems

On an Improved K-Best Algorithm with High Performance and Lo...

引用

International Conference on Smart Innovations in Communications and Computational Sciences (ICSICCS)

作者： Yang, Jia-lin 20th Res Inst Elect Technol Corp Xian Shaanxi Peoples R China

ISBN: (纸本)9789811089718;9789811089701

Multiple-input multiple-output (MIMO) techniques are significantly advanced in contemporary high-rate wireless communications. The computational complexity and bit-error-rate (BER) performance are main issues in MIMO systems. An algorithm is proposed based on a traditional k-best algorithm, coupling with the fast QR decomposition algorithm with an optimal detection order for the channel decomposition, the Schnorr-Euchner strategy for solving the zero floating-point and sorting all the branches' partial Euclidean distance, the sphere decoding algorithm for reducing the search space. The improved k-best algorithm proposed in this paper has the following characteristics: (i) The searching space for the closest point to a region is smaller compared to that of the traditional k-best algorithm in each dimension;(ii) it can eliminate the survival candidates at early stages, and (iii) it obtains better performance in the BER and the computational complexity.

关键词： MIMO k-best algorithm Fast QR decomposition BER performance Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Low Complexity k-best algorithm Based Iterative Detectors for MIMO-FBMC Systems

Low Complexity K-Best Algorithm Based Iterative Detectors fo...

引用

7th IEEE International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Fang, Ying Zhong, Jie Zhao, Minjian Lei, Ming Zhejiang Univ Coll Informat Sci & Elect Engn Hangzhou 310027 Zhejiang Peoples R China

ISBN: (纸本)9781467376877

Filter hank multicarrier (FBMC) modulation has many nice features compared with conventional cyclic prefix based orthogonal frequency multiplexing (CP-OFDM) and has been considered as a promising waveform candidate for future 5G wireless communication. Combining FBMC with multiple input multiple-output (MIMO) technology may achieve high data rate. In this paper, we propose the k-best algorithm based uncoded and coded iterative detectors for MIMO-FBMC systems to approach near maximum-likelihood (ML) performance with low computational complexity. The proposed coded detector is capable of supporting soft-outputs, we can concatenate it with soft-input code, such as the LDPC code, to achieve additional performance gain. Meanwhile, we propose interference cancellation method to eliminate the intrinsic interference in the MIMO-FBMC system. Simulation results prove that the proposed detectors achieve approximate ML performance with moderate complexity.

关键词： 5G waveform MIMO-FBMC k-best algorithm Interference cancellation

来源：评论

学校读者我要写书评

暂无评论

An Improved LR-aided k-best algorithm for MIMO Detection

An Improved LR-aided K-Best Algorithm for MIMO Detection

引用

4th International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Zhou, Qi Ma, Xiaoli Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA

ISBN: (纸本)9781467358293;9781467358309

Recently, lattice reduction (LR) technique has caught great attention for multi-input multi-output (MIMO) receiver because of its low complexity and high performance. However, when the number of antennas is large, LR-aided linear detectors and successive interference cancellation (SIC) detectors still exhibit considerable performance gap to the optimal maximum likelihood detector (MLD). To enhance the performance of the LR-aided detectors, the LR-aided k-best algorithm was developed at the cost of the extra complexity on the order O(N-t(2) k + Ntk2), where N-t is the number of transmit antennas and k is the number of candidates. In this paper, we develop an LR-aided k-best algorithm with lower complexity by exploiting a priority queue. With the aid of the priority queue, our analysis shows that the complexity of the LR-aided k-best algorithm can be further reduced to O(N-t(2) k + Ntk2)). The low complexity of the proposed LR-aided k-best algorithm allows us to perform the algorithm for large MIMO systems (e.g., 50x50 MIMO systems) with large candidate sizes. Simulations show that as the number of antennas increases, the error performance approaches that of AWGN channel.

关键词： Lattice reduction native lattice detection MIMO k-best algorithm

来源：评论

学校读者我要写书评

暂无评论

FIXED-POINT REALIZATION OF LATTICE-REDUCTION AIDED MIMO RECEIVERS WITH COMPLEX k-best algorithm

FIXED-POINT REALIZATION OF LATTICE-REDUCTION AIDED MIMO RECE...

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Wen, Qingsong Zhou, Qi Zhao, Chunming Ma, Xiaoli Georgia Inst Technol Sch ECE Atlanta GA 30332 USA

ISBN: (纸本)9781479903566

Multiple-input multiple-output (MIMO) techniques provide high data rates but the optimal maximum likelihood (ML) detector exhibits high complexity. Recently lattice reduction (LR) aided detectors have been proposed to achieve near-ML performance with low complexity. In this paper, we develop a LR-aided complex k-best algorithm which reduces the complexity of the existing sphere decoding based k-best algorithm. Then we provide the fixed-point design of the LR-aided k-best MIMO receiver for both coded and uncoded systems. The architecture selection of each sub-module is developed and a simulation-based wordlength optimization procedure is proposed. Simulations show that the fixed-point results can keep bit error rate degradation within 0.2dB under 8 x 8 256-QAM MIMO systems.

关键词： Fixed-point k-best algorithm lattice reduction

来源：评论

学校读者我要写书评

暂无评论

Design and FPGA-Implementation of Minimum PED Based k-best algorithm in MIMO Detector

引用

Circuits and Systems 2016年第6期7卷 612-621页

作者： Poornima Ramasamy Mahabub Basha Ahmedkhan Mounika Rangasamy Department of ECE K.S.R. College of Engineering Tiruchengode India

Minimum Partial Euclidean Distance (MPED) based k-best algorithm is proposed to detect the best signal for MIMO (Multiple Input Multiple Output) detector. It is based on Breadth-first search method. The proposed algorithm is independent of the number of transmitting/receiving antennas and constellation size. It provides a high throughput and reduced Bit Error Rate (BER) with the performance close to Maximum Likelihood Detection (MLD) method. The main innovations are the nodes that are expanded and visited based on MPED algorithm and it keeps track of finally selecting the best candidates at each cycle. It allows its complexity to scale linearly with the modulation order. Using Quadrature Amplitude Modulation (QAM) the complex domain input signals are modulated and are converted into wavelet packets and these packets are transmitted using Additive White Gaussian Noise (AWGN) channel. Then from the number of received signals the best signal is detected using MPED based k-best algorithm. It provides the exact best node solution with reduced complexity. The pipelined VLSI architecture is the best suited for implementation because the expansion and sorting cores are data driven. The proposed method is implemented targeting Xilinx Virtex 5 device for a 4 × 4, 64-QAM system and it achieves throughput of 1.1 Gbps. The results of resource utilization are tabulated and compared with the existing algorithms.

关键词： Multiple Input Multiple Output Detector k-best algorithm Partial Euclidean Distance Quadrature Amplitude Modulation Field Programmable Gate Array

来源：评论

学校读者我要写书评

暂无评论

Low Complexity k-best Decoding algorithm for MIMO Systems 2

Low Complexity K-Best Decoding Algorithm for MIMO Systems

引用

2nd International Conference on Communication and Information Systems (ICCIS)

作者： Wang, Jia-Lve Ma, Hai-Tao Jilin Univ Coll Commun Engn Changchun Jilin Peoples R China

ISBN: (纸本)9781450353489

The traditional k-best MIMO decoder retains the same number of nodes at each level of the search tree and then sorts them. These k-nodes may include unnecessary nodes which are scarcely possible to be the part of the correct path but increase the complexity. In order to reduce the complexity, a modified k-best algorithm with a re-filtrate procedure was proposed. After select k-nodes at each level, the proposed detector multiply the arithmetic mean of distance metric values of these nodes by a parameter. and set the result as the threshold value. The proposed algorithm reduce the complexity by discarding the nodes whose distance metric values are greater than the threshold value. Meanwhile, the proposed algorithm balances the performance and complexity by modifying the parameter to search the best scheme. Simulation results show that the final algorithm provides significant complexity reduction with a moderate sacrifice of the performance.

关键词： MIMO k-best algorithm tree decoder

来源：评论

学校读者我要写书评

暂无评论

Low Complexity k-best Decoding algorithm for MIMO Systems 2017

Low Complexity K-Best Decoding Algorithm for MIMO Systems

引用

Proceedings of the 2017 2nd International Conference on Communication and Information Systems

作者： Jia-Lve Wang Hai-Tao Ma College of Communication Engineering Jilin University

ISBN: (纸本)9781450353489

The traditional k-best MIMO decoder retains the same number of nodes at each level of the search tree and then sorts them. These k-nodes may include unnecessary nodes which are scarcely possible to be the part of the correct path but increase the complexity. In order to reduce the complexity, a modified k-best algorithm with a re-filtrate procedure was proposed. After select k-nodes at each level, the proposed detector multiply the arithmetic mean of distance metric values of these nodes by a parameter ρ and set the result as the threshold value. The proposed algorithm reduce the complexity by discarding the nodes whose distance metric values are greater than the threshold value. Meanwhile, the proposed algorithm balances the performance and complexity by modifying the parameter to search the best scheme. Simulation results show that the final algorithm provides significant complexity reduction with a moderate sacrifice of the performance.

关键词： k-best algorithm MIMO tree decoder

来源：评论

学校读者我要写书评

暂无评论

Research and Implementation of a Hybrid MIMO Detection algorithm

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2025年第6期38卷

作者： Li, Xinwei Chen, Wei Hu, Zhuhua Zhai, Qingbo Long, Biao Hainan Univ Informat & Commun Engn Haikou Hainan Peoples R China Hainan Univ State Key Lab South China Sea Oceanog Haikou Hainan Peoples R China

Multiple-input multiple-output (MIMO) technology plays a crucial role in the field of wireless communications. As one of the key technologies, MIMO signal detection ensures the reliability of communication systems and achieves high throughput transmission. In this paper, to find a high-performance and low-complexity detection algorithm, a hybrid detection algorithm is proposed based on the k-best detection algorithm. The hybrid algorithm employs the minimum mean square error (MMSE) linear detection algorithm combined with sorted QR decomposition (SQRD) for preprocessing, followed by signal detection using the k-best detection algorithm. Compared with the traditional k-best detection algorithm, the proposed method shows significant performance improvement. To address the computational complexity issue caused by the fixed k value in each layer of the hybrid detection algorithm, an adaptive threshold algorithm is introduced to select an appropriate k value for each layer, significantly reducing the algorithm's complexity. On the hardware implementation level, not only is the overall algorithm architecture optimized but a lookup table (LUT) based sorting algorithm is also proposed to address the sorting delay issue in the hybrid detection algorithm. Comprehensive analysis shows that this detector, implemented in a 28-nm process, achieves a throughput of 4.8 Gbps at a clock frequency of 769 MHz, presenting a significant advantage compared with other literature.

关键词： k-best algorithm MIMO VLSI wireless communication

来源：评论

学校读者我要写书评

暂无评论

Low Complexity Joint Detection and Estimation for MIMO RIS-ISAC Systems

引用

IEEE WIRELESS COMMUNICATIONS LETTERS 2025年第4期14卷 944-948页

作者： Danso-Ntiamoah, Nathanael Jayarathne, Aseni Al-Nahhal, Ibrahim Dobre, Octavia A. Shin, Hyundong Mem Univ Fac Engn & Appl Sci St John NF A1C 5S7 Canada Kyung Hee Univ Dept Elect & Informat Convergence Engn Yongin 17104 South Korea

Integrated sensing and communication (ISAC) and reconfigurable intelligent surfaces (RIS) have been identified as key technologies in the realization of next-generation wireless networks. ISAC provides spectral and hardware efficiency by integrating the communication and sensing functionalities into one system, whilst RIS is used to improve signal transmission. In this letter, a low-cost RIS-ISAC receiver is proposed for the first time in a multiple-input multiple-output (MIMO) system. A search-tree is deployed to detect the MIMO RIS-ISAC transmitted communication signals. Next, the k-best algorithm is proposed to reduce the computational complexity of maximum likelihood (ML) detection while achieving near-ML bit-error rate performance. Additionally, the minimum mean-squared error estimation technique is adopted to estimate the reflection coefficients of a nearby target. Computational complexity analysis and Monte Carlo simulations are provided to support the findings.

关键词： Reconfigurable intelligent surfaces Integrated sensing and communication Interference Wireless sensor networks Reflection Communication symbols Transmitting antennas Signal to noise ratio MIMO communication MIMO Integrated sensing and communication (ISAC) reconfigurable intelligent surfaces (RIS) k-best algorithm multiple-input multiple-output (MIMO) complexity analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：