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

ALTERNATIVE TRELLIS DECODING FOR CODED QAm IN THE PRESENCE OF ISI

IEEE TRANSACTIONS ON COmmUNICATIONS 1994年第2-4期42卷 1455-1459页

作者： SImmONS, SJ Department of Electrical Engineering Queen's University Kingston ONT Canada

In this letter it is shown, for a set of trial ISI channels, that two reduced-search breadth-first trellis decoders, namely the m-algorithm and the newer T-algorithm, can provide performance equivalent to RSSE but at a substantially reduced computational load. These algorithms allow the optional use of powerful codes and/or Tomlinson precoding.

关键词： prediction coding ISIS SATELLITES decoders Quadrature amplitude modulation RSSE DECODING m-algorithm

来源：评论

学校读者我要写书评

暂无评论

Blind acquisition of short burst with per-survivor processing

引用

IEEE TRANSACTIONS ON WIRELESS COmmUNICATIONS 2007年第2期6卷 429-432页

作者： mohammad, maruf Tranter, William Virginia Tech Mobile & Portable Radio Res Grp MPRG Blacksburg VA 24061 USA

In this letter, the blind acquisition performance of PSP is discussed. Based on the theory of indistinguishable sequences [4], modifications to conventional PSP are suggested that improve acquisition performance significantly. The effects of tree search and list-based algorithms on PSP are also discussed. In blind channel estimation, the performance of list-based algorithms is better than trellis-based algorithms and can be further,enhanced using the proposed techniques. The blind acquisition techniques described here can be used for other applications like multi-user detection or space-time trellis codes.

关键词： blind acquisition per-survivor processing (PSP) Viterbi algorithm m-algorithm generalized Viterbi algorithm

来源：评论

学校读者我要写书评

暂无评论

Iterative Overlap QRm-mL Block Detection for Single-Carrier mImO Transmission Without CP Insertion

引用

WIRELESS PERSONAL COmmUNICATIONS 2014年第4期74卷 1163-1177页

作者： moroga, Hideyuki Yamamoto, Tetsuya Adachi, Fumiyuki Tohoku Univ Grad Sch Engn Dept Commun Engn Aoba Ku Sendai Miyagi 9808579 Japan

QR decomposition and m-algorithm based near maximum likelihood block detection (QRm-mLBD) significantly improves the single-carrier (SC) multiple-input multiple-output (SC-mImO) transmission performance in a frequency-selective fading channel. In the conventional QRm-mLBD, the cyclic prefix (CP) is inserted in order to avoid the inter-block interference (IBI). However, CP insertion reduces the transmission efficiency. In this paper, an iterative overlap QRm-mLBD is proposed for SC-mImO transmission with no CP insertion. It is confirmed by computer simulation that the iterative overlap QRm-mLBD with no CP insertion provides improved throughput performance while reducing the computational complexity over the conventional QRm-mLBD with CP insertion.

关键词： Single-carrier mImO No cyclic prefix QR decomposition m-algorithm

来源：评论

学校读者我要写书评

暂无评论

An orthogonal space-time coded partial response CPm system with fast decoding for two transmit antennas

引用

IEEE TRANSACTIONS ON WIRELESS COmmUNICATIONS 2005年第5期4卷 2410-2422页

作者： Wang, D Wang, GY Xia, XG Univ Delaware Dept Elect & Comp Engn Newark DE 19716 USA

In this paper, an orthogonal space-time coded partial response continuous phase modulation (OST-PCPm) system with two transmit antennas is proposed. It can achieve full diversity with arbitrary inner memory length and phase smoothing functions of CPm schemes. Based on the orthogonality between signals from two transmit antennas and the proposed differential encoding scheme, a fast decoding algorithm is developed for some special cases. Simulation results show that this scheme can provide much better performance with a reasonable complexity, as compared to one transmit antenna CPm scheme. We also give a suboptimal decoding method that provides a tradeoff between complexity and performance.

关键词： continuous phase modulation differential encoding m-algorithm orthogonal space-time coding

来源：评论

学校读者我要写书评

暂无评论

Simplification of strip-wise algorithms applied for two-dimensional intersymbol interference detection

引用

IET COmmUNICATIONS 2014年第2期8卷 242-249页

作者： Lee, Chang-ming Wu, Tsung-Che Lin, Jian-Ren Natl Chung Cheng Univ Dept Commun Engn Chiayi 621 Taiwan

With the development of the high-speed communication channel or high-capacity storage device, the intersymbol interference (ISI) occurs more frequently in the condensed data. The traditional Bahl – Cocke – Jelineu – Raviv (BCJR) method is capable of solving the two-dimensional (2D) symbol influence problem with extremely high cost. By analysing the complexity in terms of branch, state and path in the 2D trellis-based ISI detection, the authors verify that the system complexity is mainly dominated by the window size. To reduce the detection complexity, the conventional simplifications are applied in the 2D strip-wise ISI detection. In addition, a two-phase strip-wise detection is proposed to achieve a lower complexity than that of the conventional simplifications. In this system, the first detector can be realised by a low-complexity method (like the hard detection or Viterbi algorithm) to provide the mask shrinking with predicted data. After reducing the mask size, the second detector can detect the main portion of ISI by the trellis-based detection (like BCJR algorithm) with a small mask. Under the similar detection performance, the proposed scheme can achieve more than 91.76% saving in the metric computation compared with the 5 × 3-window IRCSDFA (iterative row–column soft-decision feedback algorithm) simplified by the m -algorithm with m = 8.

关键词： intersymbol interference iterative methods wireless channels strip-wise algorithms two-dimensional intersymbol interference detection high-speed communication channel high-capacity storage device BCJR method 2D intersymbol interference detection 2D trellis-based ISI detection 2D strip-wise ISI detection two-phase strip-wise detection low-complexity method IRCSDFA iterative row-column soft-decision feedback algorithm m-algorithm

来源：评论

学校读者我要写书评

暂无评论

A Reduced-Complexity Tree Search Detection algorithm for mImO Systems

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2009年第6期57卷 2420-2424页

作者： Kim, Yongsang Cheun, Kyungwhoon Pohang Univ Sci & Technol POSTECH Div Elect & Comp Engn Pohang 790784 South Korea

In this correspondence, we propose a simplified QR-decomposition-m algorithm for coded multiple-input multiple-output systems based on the idea of selective branch extension. The proposed algorithm results in significant complexity reductions without observable performance losses, especially for large modulation orders where complexity reduction is most important.

关键词： m-algorithm mImO systems tree search detection

来源：评论

学校读者我要写书评

暂无评论

Parallel detection algorithm using multiple QR decompositions with permuted channel matrix for SDm/OFDm

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2008年第4期57卷 2578-2582页

作者： Ahn, Chang-Jun Hiroshima City Univ Fac Informat Sci Hiroshima 7313194 Japan

Space division multiplexing (SDm)/orthogonal frequency division multiplexing (OFDm) systems transmit different data using the same frequency, so it is necessary to separate the simultaneously received signals in the receiver. Previous studies have shown that maximum likelihood detection (mLD) provides the best bit error rate (BER) performance. However, the complexity of mLD exponentially increases with the constellation size and the number of transmit antenna branches. Therefore, it is impractical to use a full mLD without reducing its computational complexity, because it would be prohibitively large for implementation. Recently, the use of QR decomposition with an m-algorithm (QRD-m) has been proposed to reduce the system complexity while maintaining the performance of the system. However, the QRD-m performance depends on the number of surviving symbol replica candidates. When QRD-m is used with a small number of surviving symbol replica candidates, the performance declines, but when there is a large number of surviving symbol replica candidates and the transmitter antenna branches, QRD-m requires a large memory to maintain their branch metrics, and a long latency time is also required. To reduce these problems, in this paper, we propose a parallel detection algorithm using multiple QR decompositions with permuted channel matrices for SDm/OFDm systems.

关键词： m-algorithm maximum likelihood detection (mLD) multiple-input multiple-output (mImO) orthogonal frequency division multiplexing (OFDm) QR decomposition QR decomposition with an m-algorithm (QRD-m) space division multiplexing (SDm)

来源：评论

学校读者我要写书评

暂无评论

Sequence error probability lower bounds for joint detection and estimation

引用

IEEE TRANSACTIONS ON COmmUNICATIONS 2003年第3期51卷 347-351页

作者： Anastasopoulos, A Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA

A commonly used lower bound on the probability of error of joint detection and estimation (JDE) algorithms is derived under the assumption that estimation is performed using the transmitted sequence, in a genie-aided fashion. Although it seems reasonable that this genie-aided receiver performs better than the original receiver, a proof of this fact is not available in the literature. In this letter, the validity of this bound is established for a general class of JDE algorithms, as well as for an important special case when the maximum-likelihood sequence detection criterion is used. The results are then extended to a well-known suboptimal JDE algorithm, namely, the T-algorithm. It is shown, however, that the technique used to prove this bound is not sufficient for establishing the validity of the bound for the m-algorithm and the per-survivor processing algorithm.

关键词： correct decision feedback generalized-likelihood ratio test joint detection estimation lower bounds m-algorithm per-survivor processing sequence error probability T-algorithm

来源：评论

学校读者我要写书评

暂无评论

A Reduced Complexity algorithm of the Butterfly Trellis Unit for the Viterbi Decoder

引用

JOURNAL OF AERONAUTICS ASTRONAUTICS AND AVIATION 2022年第2期54卷 147-159页

作者： Rashid, Ruhaida Abdul Harun, Harlisya Ayob, mohd Zaki Shamsudin, Norfadilah Nor, Sahzilawati mohamed UniKL MIAT Satellite Commun & Av Syst Integrat SCASI Res Lab Avion Sect Lot 2891Jalan Jenderam Hulu Dengkil 43800 Selangor Malaysia Univ Kuala Lumpur British Malaysian Inst UniKL BMI Batu 8Jalan Sungai Pusu Bangi 53100 Selangor Malaysia

Together with convolutional encoders, Viterbi decoders are commonly used to provide an excellent probability of error correction in wireless transmission. The encoder constraint length k must be set at higher values to achieve an improved bit error rate. With the growth of the Internet of Things (IoT) in recent years, there is inevitable demand for low-power IoT applications. Unfortunately, an increase in the value of k causes the complexity of the algorithm to increase exponentially. Consequently, the Viterbi decoder's power consumption will increase exponentially, which is a detriment to many wireless communication devices. many of the Viterbi decoder's reduced complexity decoding approaches discussed in the past concentrated on the particular level of algorithms and architectures. most of the studies focused on the difficulty of the decoder's Add-Compare Select Unit (ACSU) repetitive processing. This paper analyzes many variations carried out in the ACSU of the Viterbi algorithm. Several separate algorithms were compared and an approach to a combined algorithm was suggested. This paper offered an in-depth description of the reduced computation and its design for the proposed algorithm. Each algorithm and reduced complexity are compared with the conventional VD. The impact of power consumption is evaluated through the bit-error-rate (BER) vs Signal-to-Noise ratio (SNR), such that the proposed algorithm was found to have the best dB gain between 0 dB and 5 dB, indicating a significant power improvement over the other algorithms.

关键词： Adaptive Viterbi decoder Adaptive m-algorithm Convolutional encoder m-algorithm Viterbi algorithm

来源：评论

学校读者我要写书评

暂无评论

Simplified Receiver Design for WLAN Systems with Packet Binary Convolutional Coding (PBCC) Transmission

Simplified Receiver Design for WLAN Systems with Packet Bina...

引用

3rd International Conference on Wireless Communications, Networking and mobile Computing (WiCOm 2007)

作者： ma Wen Luo Hanwen Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China

ISBN: (纸本)9781424413119

For WLAN systems that adopt PBCC modulation, the receiver is composed of two parts: the pre-filter and the reduced-state equalizer. Whitened matched filter (WmF) is usually designed as the pre-filter, but the calculation of the coefficients is complex. In order to reduce the computation burden of the prefiltering process, a new pre-filter design method is proposed, which uses the zero-forcing rule to calculate the pre-filter coefficients. m-algorithm is adopted to finish the following equalization, which only chooses m best nodes among all the possible states. Computer simulation results indicate that when such receiver design is adopted, the complexity of the receiver is decreased greatly, while the receiver performance is comparative with the traditional design method.

关键词： PBCC pre-filter zero-forcing rule m-algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：