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

High-Rate and Full-Diversity Space-Time Block Codes with Low complexity Partial Interference Cancellation Group decoding

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2011年第5期59卷 1201-1207页

作者： Shi, Long Zhang, Wei Xia, Xiang-Gen Univ New S Wales Sch Elect Engn & Telecommun Sydney NSW 2052 Australia Univ Delaware Dept Elect & Comp Engn Newark DE 19716 USA

In this letter, we propose a systematic design of space-time block codes (STBC) which can achieve high rate and full diversity when the partial interference cancellation (PIC) group decoding is used at receivers. The proposed codes can be applied to any number of transmit antennas and admit a low decoding complexity while achieving full diversity. For M transmit antennas, in each codeword real and imaginary parts of PM complex information symbols are parsed into P diagonal layers and then encoded, respectively. With PIC group decoding, it is shown that the decoding complexity can be reduced to a joint decoding of M/2 real symbols. In particular, for 4 transmit antennas, the code has real symbol pairwise (i.e., single complex symbol) decoding that achieves full diversity and the code rate is 4/3. Simulation results demonstrate that the full diversity is offered by the newly proposed STBC with the PIC group decoding.

关键词： MIMO systems Space-time block codes partial interference cancellation decoding complexity

来源：评论

学校读者我要写书评

暂无评论

complexity Modeling of Spatial and Temporal Compensations in H.264/AVC decoding

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2010年第5期20卷 706-720页

作者： Lee, Szu-Wei Kuo, C. -C. Jay Univ So Calif Dept Elect Engn Los Angeles CA 90089 USA Univ So Calif Signal & Image Proc Inst Los Angeles CA 90089 USA

H.264/advanced video coding (AVC) decoding complexity modeling and applications are examined in this paper. We focus on complex modeling of spatial and temporal compensations achieved by a rich set of inter and intra-prediction modes of H.264/AVC. We study the relationship between motion vectors (MV), frame sizes, and distributions of selected reference frames, which are highly related to cache management efficiency and, thus, the decoding complexity. An H.264/AVC encoder equipped with the complexity models can choose the best inter or intra-prediction mode and the best MV or intra-prediction direction while meeting the decoding complexity constraint of the target receiver platform. The proposed complexity models are accurate. The application of complexity models to the H.264/AVC decoding complexity reduction is demonstrated.

关键词： decoding complexity H.264/advanced video coding (AVC) motion compensation rate-distortion optimization (RDO)

来源：评论

学校读者我要写书评

暂无评论

On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1998年第1期44卷 162-171页

作者： Banihashemi, AH Khandani, AK Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain gamma of L, and are obtained based on a decoding algorithm Which is an improved version of Kannan's method, The tatter is currently the fastest known method for the decoding of a general lattice, For the decoding of a point x, the proposed algorithm recursively searches inside an n-dimensional rectangular parallelepiped (cube), centered at x, With its edges along the Gram-Schmidt vectors of a proper basis of L. We call algorithms of this type recursive cube search (RCS) algorithms. It is shown that Kannan's algorithm also belongs to this category, The complexity of RCS algorithms is measured in terms of the number of lattice points that need to be examined before a decision is made, To tighten the upper bound on the complexity, We select a lattice basis which is reduced in the sense of Korkin-Zolotarev, It is shown that for any selected basis, the decoding complexity (using RCS algorithms) of any sequence of lattices with possible application in communications (gamma greater than or equal to 1) grows at least exponentially with n and gamma. It is observed that the densest lattices, and almost all of the lattices used in communications, e.g., Barnes-Wall lattices and the Leech lattice, have equal successive minima (ESR I). For the decoding complexity of ESM lattices, a tighter upper bound and a stronger loner bound result are derived.

关键词： coding gain decoding algorithms decoding complexity densest lattices Korkin-Zolotarev reduction lattices successive minima

来源：评论

学校读者我要写书评

暂无评论

Low-complexity decoding of partial unit memory codes on preceded partial-response channels

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1997年第3期43卷 1052-1058页

作者： Hole, MF Hole, KJ Department of Informatics University of Bergen Bergen Norway

Cosets of convolutional codes can be used to obtain large free Euclidean distances and short maximum zero-run lengths at the output of the 1 - D partial-response channel (PRC). We present a new soft-decision decoding technique for cosets of convolutional codes on the preceded 1 - D PRC. The decoding technique is especially well suited for cosets of partial unit memory (PUM) convolutional codes. A connection between the decoder trellises for cosets of block codes and PUM codes on the 1 - D PRC is exploited to obtain a small number of operations per decoded information bit. We prove that the new decoding technique needs fewer operations than the Viterbi algorithm for any (n, n - r), r greater than or equal to 1, PUM code coset with n less than or equal to 2(nu-r) where nu is the constraint length. It is also indicated how to prove the same result for other classes of codes. For many of the best known PUM code cosets, the new decoding technique requires both fewer operations per decoded information bit and smaller path memories than the Viterbi algorithm needs for comparable cosets of punctured convolutional codes.

关键词： convolutional codes decoding complexity partial-response channels trellis structure

来源：评论

学校读者我要写书评

暂无评论

Reduced-complexity decoding implementation of QC-LDPC codes with modified shuffling

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2021年第1期2021卷 1-14页

作者： Hasani, Alireza Lopacinski, Lukasz Kraemer, Rolf IHP Leibniz Inst Innovat Mikroelekt Frankfurt Oder Germany Brandenburg Tech Univ Cottbus Dept Elect & Comp Engn Cottbus Germany

Layered decoding (LD) facilitates a partially parallel architecture for performing belief propagation (BP) algorithm for decoding low-density parity-check (LDPC) codes. Such a schedule for LDPC codes has, in general, reduced implementation complexity compared to a fully parallel architecture and higher convergence rate compared to both serial and parallel architectures, regardless of the codeword length or code-rate. In this paper, we introduce a modified shuffling method which shuffles the rows of the parity- check matrix (PCM) of a quasi- cyclic LDPC (QC-LDPC) code, yielding a PCM in which each layer can be produced by the circulation of its above layer one symbol to the right. The proposed shuffling scheme additionally guarantees the columns of a layer of the shuffled PCM to be either zero weight or single weight. This condition has a key role in further decreasing LD complexity. We show that due to these two properties, the number of occupied look-up tables (LUTs) on a field programmable gate array (FPGA) reduces by about 93% and consumed on- chip power by nearly 80%, while the bit error rate (BER) performance is maintained. The only drawback of the shuffling is the degradation of decoding throughput, which is negligible for low values of E-b/N-0 until the BER of 1e-6.

关键词： Quasi-cyclic low-density parity-check code Layered decoding decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Turbo decoding Using the Sectionalized Minimal Trellis of the Constituent Code: Performance-complexity Trade-Off

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2013年第9期61卷 3600-3610页

作者： Moritz, Guilherme Luiz Souza, Richard Demo Pimentel, Cecilio Pellenz, Marcelo Eduardo Uchoa-Filho, Bartolomeu F. Benchimol, Isaac Fed Univ Technol Parana UTFPR CPGEI Curitiba Parana Brazil Fed Univ Pernambuco UFPE CODEC DES Recife PE Brazil Pontifical Catholic Univ PUC PR PPGIA Curitiba Parana Brazil Univ Fed Santa Catarina GPqCom EEL Florianopolis SC Brazil Fed Inst Amazonas IFAM CMDI Manaus Amazonas Brazil

The performance and complexity of turbo decoding using rate k/n constituent codes are investigated. The conventional, minimal and sectionalized trellis modules of the constituent convolutional codes are utilized. The performance metric is the bit error rate (BER), while complexity is analyzed based on the number of multiplications, summations and comparisons required by the max-log-MAP decoding algorithm. Our results show that the performance depends on how the systematic bits are grouped in a trellis module. The best performance is achieved when the k systematic bits are grouped together in the same section of the module, so that the log-likelihood ratio (LLR) of the k-bit vector is calculated at once. This is a characteristic of the conventional trellis module and of some of the sectionalizations of the minimal trellis module. Moreover, we show that it is possible to considerably reduce the decoding complexity with respect to the conventional trellis if a particular sectionalization of the minimal trellis module is utilized. In some cases, this sectionalization is found within the best performing group, while in some other cases a small performance loss can be traded off for a large complexity reduction.

关键词： Convolutional codes turbo codes decoding complexity minimal trellis

来源：评论

学校读者我要写书评

暂无评论

On the complexity of bounded distance decoding for the AWGN channel

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2002年第5期48卷 1046-1060页

作者： Anderson, JB Lund Univ Dept Informat Technol S-22100 Lund Sweden

Earlier work has derived the storage complexity of the bounded distance decoder (BDD) for binary-channel convolutional codes. We extend this work to the Gaussian noise channel and to partial-response codes. We show that the storage requirement similar to(2(1-R) - 1)(-t) paths for rate-R convolutional codes over the binary channel becomes similar to2(2Rt) over the Gaussian channel, where the decoder must correct t errors. Thus, convolutional coding over the Gaussian channel is not only 3 dB more energy efficient, but its decoding is simpler as well. Next, we estimate the path storage for partial-response codes, i.e., real-number convolutional codes, over the Gaussian channel. The growth rate depends primarily on the bandwidth of the code. A new optimization procedure is devised to measure the maximum storage requirement in Gaussian noise for these two code types. An analysis based on difference equations predicts the asymptotic storage growth for partial response codes.

关键词： convolutional coding decoding decoding complexity intersymbol interference reduction partial response coding

来源：评论

学校读者我要写书评

暂无评论

Reduced-complexity decoding of LT Codes

引用

WIRELESS PERSONAL COMMUNICATIONS 2017年第3期94卷 969-975页

作者： Albayrak, Cenk Turk, Kadir Karadeniz Tech Univ Dept Elect Elect Engn TR-61080 Trabzon Turkey

In this paper, the belief propagation (BP) based approximation methods for low-density parity-check codes are adapted to the Luby transform soft decoder structure in order to reduce its computational complexity. Moreover, the log-likelihood ratio based adaptive demodulation algorithm is combined with the BP and BP-based algorithms to further reduce the computational complexities and optimum key parameters are determined for normalized min-sum and offset min-sum algorithms. The bit error rate performances of the algorithms over the binary input additive white Gaussian noise channel are obtained by both theoretically and simulations. For theoretical analysis, the Monte-Carlo based density evolution method is used. In addition, computational complexity analyzes of methods are presented. Results show that the computational complexity can be reduced significantly by using combined methods which cost limited signal to noise ratio loss.

关键词： Rateless codes BP-based approximations decoding complexity Adaptive demodulation

来源：评论

学校读者我要写书评

暂无评论

Minimizing the complexity of Fast Sphere decoding of STBCs

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2013年第12期12卷 6142-6153页

作者： Jithamithra, G. R. Rajan, B. Sundar Indian Inst Sci Dept Elect Commun Engn Bangalore 560012 Karnataka India

decoding of linear space-time block codes (STBCs) with sphere-decoding (SD) is well known. A fast-version of the SD known as fast sphere decoding (FSD) was introduced by Biglieri, Hong and Viterbo. Viewing a linear STBC as a vector space spanned by its defining weight matrices over the real number field, we define a quadratic form (QF), called the Hurwitz-Radon QF (HRQF), on this vector space and give a QF interpretation of the FSD complexity of a linear STBC. It is shown that the FSD complexity is only a function of the weight matrices defining the code and their ordering, and not of the channel realization (even though the equivalent channel when SD is used depends on the channel realization) or the number of receive antennas. It is also shown that the FSD complexity is completely captured into a single matrix obtained from the HRQF. Moreover, for a given set of weight matrices, an algorithm to obtain an optimal ordering of them leading to the least FSD complexity is presented. The well known classes of low FSD complexity codes (multi-group decodable codes, fast decodable codes and fast group decodable codes) are presented in the framework of HRQF.

关键词： decoding complexity fast sphere decoding Hurwitz-Radon quadratic form (HRQF) space-time block codes (STBC) sphere decoder

来源：评论

学校读者我要写书评

暂无评论

Noncoherent Alamouti Phase-Shift Keying With Full-Rate Encoding and Polynomial-complexity Maximum-Likelihood decoding

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2017年第10期16卷 6688-6697页

作者： Markopoulos, Panos P. Karystinos, George N. Rochester Inst Technol Dept Elect & Microelect Engn Rochester NY 14623 USA Tech Univ Crete Sch Elect & Comp Engn Khania 73100 Greece

We consider Alamouti encoding that draws symbols from phase-shift keying and develop a new differential modulation scheme that attains full rate for any constellation order. In contrast to past work, the proposed scheme guarantees that the encoded matrix maintains the characteristics of the initial codebook and, at the same time, attains full rate so that all possible sequences of space-time matrices become valid. Surprisingly, although the validity of all sequences could be thought as a drawback with respect to the cost of noncoherent sequence decoding, in fact it turns out to be an advantage. Based on recent results in the context of quadratic-form maximization over finite alphabets, we exploit the full-rate property of the proposed scheme to develop a polynomial-complexity maximum-likelihood noncoherent sequence decoder whose order is solely determined by the number of receive antennas. Numerical studies show the superiority of the proposed scheme in comparison with contemporary alternatives in terms of encoding rate, decoding complexity, bandwidth efficiency, and throughput.

关键词： decoding complexity differential decoding full-rate encoding phase-shift keying space-time block codes transmit diversity unique decodability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：