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

Low complexity maximum-likelihood detector for DSTTD architecture based on the qrd-m algorithm

TELECOmmUNICATION SYSTEmS 2019年第1期70卷 55-66页

作者： Cortez, Joaquin Bazdresch, miguel Ramirez, Julio Palacio, Ramon Ruiz, Erica Inst Tecnol Sonora 5 Febrero 818 Obregon Mexico Rochester Inst Technol Elect & Telecommun Engn Technol Dept 1 Lomb Mem Dr Rochester NY 14623 USA Univ Caribe SM 78Mza 1Lote 1 Cancun 77528 Mexico

This paper presents a new decoder algorithm for the double space-time transmit diversity (DSTTD) system. The decoder is based on the qrd-m algorithm, which performs a breadth-first search of possible solutions tree. The search is simplified by skipping unlikely candidates, and it is stopped when no promising candidates are left. Furthermore, the search is divided into three concurrent iterations, making possible a fast, parallel implementation either in hardware or software. After presenting an analysis of the capacity and diversity of DSTTD, we present performance results showing that the proposed decoder is capable of achieving near maximum likelihood performance. We also show that the proposed algorithm exhibits lower computational complexity than other existing maximum likelihood detectors.

关键词： Space-time codes Double space-time transmit diversity maximum-likelihood detection qrd-m algorithm

来源：评论

学校读者我要写书评

暂无评论

A V-BLAST system using modulation set selection for reduced-complexity tree searching in the qrd-m algorithm

引用

IEICE TRANSACTIONS ON COmmUNICATIONS 2007年第12期E90B卷 3665-3669页

作者： Kim, Hyounkuk Jeon, Kihwan Kang, Joonhyuk Park, Hyuncheol Informat & Commun Univ Taejon 305732 South Korea

This letter presents a new vertical Bell Labs layered space-time (V-BLAST) transmission scheme for developing low-complexity tree searching in the qrd-m algorithm. In the new V-BLAST system, we assign modulation scheme in ascending order from top to bottom tree branches. The modulation set to be assigned is decided by two criteria: minimum performance loss and maximum complexity reduction. We also propose an open-loop power allocation algorithm to surmount the performance loss. Numerical results show that the proposed V-BLAST transmission approach can significantly reduce the computational loads of the qrd-m algorithm with a slight performance degradation.

关键词： vertical Bell Labs layered space-time (V-BLAST) sphere decoding (SD) algorithm qrd-m algorithm

来源：评论

学校读者我要写书评

暂无评论

Interference cancellation and signal detection technique based on qrd-m algorithm for FTN signalling

引用

ELECTRONICS LETTERS 2017年第6期53卷 409-411页

作者： Baek, m. -S. Yun, J. Hur, N. Lim, H. ETRI Daejeon South Korea

This Letter presents interference cancellation and signal detection technique for faster-than-Nyquist (FTN) signalling. The proposed scheme uses QR decomposition (qrd)-m algorithm to execute interference cancellation and signal detection. Based on the Toeplitz structure of the inter-symbol interference coefficient matrix, the qrd-m algorithm is adopted to detect the transmitted symbols from an FTN signal. The computational complexity comparisons and numerical results demonstrate that the proposed technique can achieve the complexity <10% of Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm while maintaining BER performance similar to that of BCJR algorithm.

关键词： interference suppression signal detection intersymbol interference computational complexity matrix algebra error statistics telecommunication signalling interference cancellation signal detection technique qrd-m algorithm FTN signalling faster-than-Nyquist signalling QR decomposition Toeplitz structure inter-symbol interference coefficient matrix transmitted symbol detection computational complexity Bahl-Cocke-Jelinek-Raviv algorithm BCJR algorithm BER performance

来源：评论

学校读者我要写书评

暂无评论

Combined qrd-m and DFE Detection Technique for Simple and Efficient Signal Detection in mImO-OFDm Systems

引用

IEEE TRANSACTIONS ON WIRELESS COmmUNICATIONS 2009年第4期8卷 1632-1638页

作者： Baek, myung-Sun You, Young-Hwan Song, Hyoung-Kyu Sejong Univ uT Commun Res Inst Seoul South Korea

An efficient mImO signal detection technique with low complexity is presented for mImO-OFDm systems. The proposed technique has a feature of combined qrd-m and DFE detection. In our detection technique with m transmit antennas, after qrd-m detection is executed for first T detection steps, DFE detection is executed for last m - T detection steps. This approach is simple and has low complexity, because the computations for qrd-m is limited by the,newly adopted parameter T. From simulation results, the complexity of the proposed technique with 4 x 4 and T = 2 is reduced by 61% compared with that of the conventional qrd-m at the expense of about 0.7dB degradation of BER performance at BER=10(-4). The simulations are executed in Ricean and Rayleigh channel models. And the simulation of proposed technique is executed by using estimated channel. Through the simulations, it is ascertained that the proposed detection can be used for Ricean and Rayleigh channel models as well as estimated channel.

关键词： mImO-OFDm V-BLAST QR-decomposition DFE detector qrd-m algorithm

来源：评论

学校读者我要写书评

暂无评论

Clipping method for Adaptive qrd-m Detection 8

Clipping Method for Adaptive QRD-M Detection

引用

International Conference on Information and Communication Technology Convergence (ICTC)

作者： Lim, Hyeongyong Park, Gihong Yoon, Dongweon Hanyang Univ Dept Elect & Comp Engn Seoul South Korea

ISBN: (纸本)9781509040322

In this paper, we propose a clipping method for an adaptive QR decomposition (qrd)-m algorithm in multiple input multiple-output (mImO) systems. To reduce the computational complexity without a significant bit error rate (BER) degradation, the proposed algorithm eliminates unreliable candidate symbols using a clipping parameter. Particularly, in a low signal-to-noise ratio (SNR) regime, the proposed clipping method is effective in terms of low computational complexity since unreliable candidate symbols can be discarded by the clipping parameter. In order to validate the proposed algorithm, we present the BER and computational complexity of the proposed algorithm and compare with those of the conventional qrd-m algorithm.

关键词： Adaptive threshold clipping method qrd-m algorithm

来源：评论

学校读者我要写书评

暂无评论

Investigations on qrd-m Based Broadband VP Technique for multiuser multiantenna System 8

Investigations on QRD-M Based Broadband VP Technique for Mul...

引用

8th European Conference on Antennas and Propagation (EuCAP)

作者： Taniguchi, Tetsuki Karasawa, Yoshio UEC Adv Wireless Commun Res Ctr AWCC Dept Commun Engn & Informat Tokyo 1828585 Japan

ISBN: (纸本)9788890701849

This paper investigates on practical broadband vector perturbation (VP) method with quick wide-area search based on qrd-m algorithm for the data transmission under frequency selective propagation channel. Simultaneously, the possibility of broadband VP using channel inversion with regularization factor has been considered. The feature of the system is in time-domain processing using spatio-temporal weight. Because of the necessity of eliminating undesired signal contained in delayed waves, the perturbation can be applied only to the present signal, which brings difficulty not encountered in the narrowband case. Through computer simulations, the effectiveness and problems of the above methods are discussed;particularly, it is verified that VP with regularization factor does not have advantage.

关键词： multiuser multiantenna vector perturbation (VP) qrd-m algorithm frequency selective propagation channel

来源：评论

学校读者我要写书评

暂无评论

Block-Orthogonal Space-Time Code Structure and Its Impact on qrdm Decoding Complexity Reduction

引用

IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING 2011年第8期5卷 1438-1450页

作者： Ren, Tian Peng Guan, Yong Liang Yuen, Chau Zhang, Er Yang Natl Univ Def Technol Coll Elect Sci & Engn Changsha 410073 Hunan Peoples R China Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore Singapore Univ Technol & Design Singapore 279623 Singapore

Full-rate space time codes (STCs) with rate = number of transmit antennas have high multiplexing gain, but high decoding complexity even when decoded using reduced-complexity decoders such as sphere or qrdm decoders. In this paper, we introduce a new code property of STC called block-orthogonal property, which can be exploited by QR-decomposition-based decoders to achieve significant decoding complexity reduction without performance loss. We show that such complexity reduction principle can benefit the existing algebraic codes such as Perfect and DjABBA codes due to their inherent (but previously undiscovered) block-orthogonal property. In addition, we construct and optimize new full-rate block-orthogonal STC (BOSTC) that further maximize the qrdm complexity reduction potential. Simulation results of bit error rate (BER) performance against decoding complexity show that the new BOSTC outperforms all previously known codes as long as the qrdm decoder operates in reduced-complexity mode, and the code exhibits a desirable complexity saturation property.

关键词： Block-orthogonal space time codes (STC) decoding complexity orthogonal STC qrd-m algorithm quasi-orthogonal STC

来源：评论

学校读者我要写书评

暂无评论

Likelihood estimation for reduced-complexity mL detectors in a mImO spatial-multiplexing system

引用

IEICE TRANSACTIONS ON COmmUNICATIONS 2008年第3期E91B卷 837-847页

作者： Higashinaka, masatsugu motoyoshi, Katsuyuki Okazaki, Akihiro Nagayasu, Takayuki Kubo, Hiroshi Shibuya, Akihiro Mitsubishi Electr Corp Informat Technol R&D Ctr Kamakura Kanagawa 2478501 Japan Mitsubishi Elect ITE TCL Rennes France

This paper proposes a likelihood estimation method for reduced-complexity maximum-likelihood (mL) detectors in a multiple-input multiple-output (mImO) spatial-multiplexing (Sm) system. Reduced-complexity mL detectors, e.g., Sphere Decoder (SD) and QR decomposition (qrd)-m algorithm, are very promising as mImO detectors because they can estimate the mL or a quasi-mL symbol with very low computational complexity. However, they may lose likelihood information about signal vectors having the opposite bit to the hard decision and bit error rate performance of the reduced-complexity mL detectors are inferior to that of the mL detector when soft-decision decoding is employed. This paper proposes a simple estimation method of the lost likelihood information suitable for the reduced-complexity mL detectors. The proposed likelihood estimation method is applicable to any reduced-complexity mL detectors and produces accurate soft-decision bits. Computer simulation confirms that the proposed method provides excellent decoding performance, keeping the advantage of low computational cost of the reduced-complexity mL detectors.

关键词： mImO sphere decoding qrd-m algorithm soft-decision outputs computational complexity

来源：评论

学校读者我要写书评

暂无评论

Fast Scalable Fixed-Point Architecture Proposal of a QR Decomposition for STBC-VBLAST Receiver 16

Fast Scalable Fixed-Point Architecture Proposal of a QR Deco...

引用

16th Annual Wireless Telecommunications Symposium (WTS) - Global Wireless Communications - Present and Future

作者： Robles, Jorge Cortez, Joaquin Romero, Eduardo Ruiz, Erica Inst Tecnol Sonora Dept Elect & Elect Engn Obregon Sonora Mexico

ISBN: (纸本)9781509035991

This work presents a proposal of an implementation of a Sorted QR decomposition using fixed-point arithmetic for STBC-VBLAST space-time scheme. This proposal was verified in the context of a mImO receiver, the effects of finite-length arithmetic and limited precision are evaluated in terms of their impact on the receiver bit error rate (BER). We will define the minimum fixed-point word size required not to adversely impact performance for nt transmit antennas and nR receive antennas. Our analysis of mImO receiver under these conditions shows a strong robustness on the numerical precision, which allows to have a receiver performance very close to that obtained with floating point arithmetic in terms of BER, therefore we believe this scheme is attractive candidate for its implementation in current communications standards.

关键词： STBC-VBLAST mImO Codes Sorted QR De-composition qrd-m algorithm Givens Rotation Fixed-Point Arithmetic

来源：评论

学校读者我要写书评

暂无评论

Two-stage decoding algorithm for unmodulated parallel combinatory high-compaction multicarrier modulation signals

引用

EURASIP JOURNAL ON WIRELESS COmmUNICATIONS AND NETWORKING 2013年第1期2013卷 1页

作者： Hayashi, Ryuji Li, Yingsong Hamamura, masanori Kochi Univ Technol Grad Sch Engn Kami 7828502 Japan

A new decoding algorithm that consists of two decoding stages to reduce the computational complexity of maximum likelihood decoding for parallel combinatory high-compaction multicarrier modulation is proposed. The first decoding stage is responsible for a preliminary decision that serves to roughly find candidate messages using the qrd-m algorithm, and the second decoding stage is responsible for the final decision that reduces the error contained in the candidate and determines the message using the minimum value of the Hamming distances between the candidate and the replicas of the message. The complexity is considerably reduced by the proposed two-stage decoding algorithm at a cost of approximately 1.5 dB or less in E-b/N-0 with respect to the bit-error rate of 10(-3) under the given parameter settings.

关键词： PC signaling HC-mCm qrd-m algorithm maximum likelihood decoding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：