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

Serial concatenated coding scheme with minimum shift keying

ELECTRONICS LETTERS 2001年第23期37卷 1393-1395页

作者： Altunbas, I Narayanan, KR Istanbul Tech Univ Elect & Elect Fac TR-80626 Istanbul Turkey Texas A&M Univ Dept Elect Engn College Stn TX 77843 USA

A novel serially concatenated coding scheme for use with minimum shift keying (MSK) is proposed. The novelty is to use a mixture of recursive and non-recursive realisations for the MSK modulator. It is shown that this improves the performance of iterative demodulation and decoding of convolutionally encoded MSK signals with a slight decrease in the decoder complexity.

关键词： decoder complexity recursive realisations concatenated codes iterative demodulation convolutionally encoded signals minimum shift keying Codes iterative decoding convolutional codes serially concatenated coding scheme nonrecursive realisations MSK modulator

来源：评论

学校读者我要写书评

暂无评论

Design of algebraic-geometric codes over fading channels

引用

ELECTRONICS LETTERS 2004年第21期40卷 1355-1356页

作者： Johnston, M Carrasco, RA Burrows, BL Wolverhampton Univ Sch Comp & Informat Technol Wolverhampton WV1 1SB England Staffordshire Univ Fac Comp Engn & Technol Stafford ST18 0D Staffs England

A construction and implementation of algebraic-geometric codes for use over urban single-input-single-output (SISO) channels are presented. Algebraic-geometric codes have much longer code lengths than Reed Solomon codes as well as more choice of codes for an acceptable decoder complexity. New simulation results are compared with Reed Solomon codes, showing the performance advantage of algebraic-geometric codes, particularly over fading channels.

关键词： decoder complexity algebraic geometric code simulation algebraic geometric code design single-input-single-output channels digital arithmetic channel coding Codes fading channels algebraic geometric codes Radio links and equipment decoding

来源：评论

学校读者我要写书评

暂无评论

Unitary Space-Time Pulse Position Modulation for Differential Unipolar MIMO IR-UWB Communications

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2015年第10期14卷 5602-5615页

作者： Abou-Rjeily, Chadi LAU Dept Elect & Comp Engn Lebanon NH 03756 USA

In this paper, we present a general technique for constructing minimal-delay unitary differential Space-Time (ST) block codes for Pulse Position Modulation (PPM) with an arbitrary number of transmit antennas and signal set cardinality. A typical application corresponds to Multiple Input Multiple Output (MIMO) Impulse-Radio Ultra-Wideband (IR-UWB) systems where neither the transmitter nor the receiver knows the channel. The proposed scheme is a pulse-based solution where the information is encoded differentially through the relative shifts of the pulses in one block with respect to the pulse positions in the previous block where each block extends over P symbol durations with P standing for the number of transmit antennas. This technique of time-domain encoding avoids all types of amplitude constellation expansions and achieves a full transmit diversity order while maintaining a single unipolar pulse transmission per symbol in a way that is completely equivalent to single-antenna PPM communications. We also propose a simplified decoder that can be associated with the proposed ST code and we perform a detailed complexity analysis that allows to quantify the reduction in the number of operations offered by this simplified decoding strategy. Finally, the results are validated numerically and through a semi-analytical evaluation of the conditional symbol error rate.

关键词： Ultra-Wideband (UWB) differential space-time MIMO performance analysis simplified decoding decoder complexity Pulse Position Modulation (PPM)

来源：评论

学校读者我要写书评

暂无评论

Improved Low complexity Hybrid Turbo Codes and their Performance Analysis

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2010年第6期58卷 1620-1622页

作者： Bhise, Archana Vyavahare, Prakash D. KJS Inst Engn & Informat Technol Dept Elect & Telecommun Engn Bombay Maharashtra India SGS Inst Technol & Sci Dept Elect & Telecommun Engn Indore India

This paper proposes a new class of Turbo type codes referred to as Improved Low complexity Hybrid Turbo Codes (ILCHTC). For low Bit Energy to Noise Ratio (E-b/N-o) ILCHTC shows better convergence of errors than that of Low complexity Hybrid Turbo Code (LCHTC). Simulation results show that ILCHTC achieves Bit Error Rate (BER) of 10(-5) at E-b/N-o. of 1.9 dB, which is 0.4 dB more than that for Turbo Convolutional Codes (TCC). Analysis of ILCHTC and LCHTC decoders show that the number of computations reduce by a factor of two as compared to the computations of TCC decoder.

关键词： A posteriori probability bit error rate concatenated codes decoder complexity hybrid turbo codes

来源：评论

学校读者我要写书评

暂无评论

Space-time ring TCM codes for QPSK on time-varying fast fading channels

引用

ELECTRONICS LETTERS 2001年第15期37卷 961-962页

作者： Pereira, A Carrasco, RA Staffordshire Univ Sch Engn Beaconside ST18 0AD Staffs England

Space-time codes based on rings of integers suitable for QPSK constellations are presented for time-varying flat Rayleigh fast fading channels. Furthermore, a comparison between space-time ring TCM codes and the best known space-time codes for time-varying channels has revealed that the former offers a significantly better trade-off between coding gain and decoder complexity.

关键词： decoder complexity time-varying fast fading channels trellis coded modulation Codes quadrature phase shift keying space-time ring TCM codes time-varying channels linear codes feedback Information theory QPSK constellations Rayleigh channels flat Rayleigh fast fading channels feedback structure linear space-time codes coding gain

来源：评论

学校读者我要写书评

暂无评论

Time-varying block codes for synchronisation errors: maximum a posteriori decoder and practical issues

引用

JOURNAL OF ENGINEERING-JOE 2014年第6期2014卷 340-351页

作者： Briffa, Johann A. Buttigieg, Victor Wesemeyer, Stephan Univ Surrey Dept Comp Guildford GU2 7XH Surrey England Univ Malta Dept Commun & Comp Engn Msida 2080 MSD Malta

In this study, the authors consider time-varying block (TVB) codes, which generalise a number of previous synchronisation errorcorrecting codes. They also consider various practical issues related to maximum a posteriori (MAP) decoding of these codes. Specifically, they give an expression for the expected distribution of drift between transmitter and receiver because of synchronisation errors. They determine an appropriate choice for state space limits based on the drift probability distribution. In turn, they obtain an expression for the decoder complexity under given channel conditions in terms of the state space limits used. For a given state space, they also give a number of optimisations that reduce the algorithm complexity with no further loss of decoder performance. They also show how the MAP decoder can be used in the absence of known frame boundaries, and demonstrate that an appropriate choice of decoder parameters allows the decoder to approach the performance when frame boundaries are known, at the expense of some increase in complexity. Finally, they express some existing constructions as TVB codes, comparing performance with published results and showing that improved performance is possible by taking advantage of the flexibility of TVB codes.

关键词： block codes synchronisation error correction codes maximum likelihood decoding radio transmitters radio receivers optimisation time-varying block codes synchronisation errors maximum a posteriori decoder MAP decoding error-correcting codes transmitter receiver state space limits drift probability distribution decoder complexity channel conditions optimisations frame boundaries decoder parameters

来源：评论

学校读者我要写书评

暂无评论

A new criterion to compare different LDPC codes for hardware implementation

A new criterion to compare different LDPC codes for hardware...

引用

Canadian Conference on Electrical and Computer Engineering

作者： Torbati, Amir Hosein Harati Nejad Attari, Mahnioud Ahmadian Moosavinia, Amir KN Toosi Univ Technol Tehran Iran

ISBN: (纸本)9781424416424

In this paper we propose a new combinational criterion as a mean for comparison between different LDPC codes in terms of complexity and efficiency. The main idea behind the proposed criterion is to merge different aspects of a code to a unique number. We will show that the new criterion, named "Goodness Number" or GN, is applicable, and in some circumstances it is preferred to other criteria such as complexity and error probability criteria and at the same time it maintains computational simplicity.

关键词： LDPC codes hardware implementation decoder complexity comparing different codes efficiency compression

来源：评论

学校读者我要写书评

暂无评论

Modified Viterbi Algorithm for Decoding of Block Codes 6

Modified Viterbi Algorithm for Decoding of Block Codes

引用

6th Mediterranean Conference on Embedded Computing (MECO)

作者： Zolotarev, V. V. Grinchenko, N. N. Ovechkin, G., V Ovechkin, P., V Russian Acad Sci Space Res Inst Dept 71 Moscow Russia Ryazan State Radio Engn Univ Fac Comp Engn Ryazan Russia

ISBN: (纸本)9781509067428

The paper has considered optimal methods for decoding error correction codes which allow increasing reliability of the data transmission across noisy communication channels. The purpose of work is to solve a task to increase efficiency of decoding short block codes. The paper has suggested a very simple modification of the algorithm for decoding quasicyclic block codes built on the basis of short convolutional codes. Besides, decoding is executed by the Viterbi algorithm not taking into account a block structure of the code but decoding an ordinary infinite sequence. The analysis of the suggested decoder characteristics has been performed and complexity of its implementation has been estimated. The paper has shown that by means of the suggested Viterbi decoder for the block codes it is possible to ensure a bit error rate being analogous to the bit error rate for the corresponding convolutional code under the decoding complexity increasing only in 2..3 times.

关键词： data transmission system error correction coding Viterbi algorithm convolutional code block code quasicyclic code cyclic trellis decoder complexity

来源：评论

学校读者我要写书评

暂无评论

decoder ENERGY-AWARE INTRA-CODED HEVC BIT STREAM GENERATION

DECODER ENERGY-AWARE INTRA-CODED HEVC BIT STREAM GENERATION

引用

IEEE International Conference on Multimedia & Expo (ICME)

作者： Mallikarachchi, Thanuja Talagala, Dumidu S. Arachchi, Hemantha Kodikara Fernando, Anil Univ Surrey Ctr Vis Speech & Signal Proc Guildford GU2 5XH Surrey England

ISBN: (纸本)9781467372589

The rising demand for media consumption via mobile devices and the emergence of complex video coding algorithms present an additional challenge for the energy management algorithms in resource-constrained consumer electronic devices. Thus, generating energy-optimized video bit streams will positively contribute towards overcoming this challenge. This paper introduces a novel energy model for intra-frame decoding of HEVC encoded video that predicts the decoding energy of a coding unit. Thereafter, a novel energy-rate-distortion optimized coding mode selection algorithm is proposed to generate energy-efficient bit streams using the proposed energy model within the encoder. The proposed energy model is shown to predict the decoding energy of a coding unit with an average error less than 2%. Moreover, the proposed coding mode selection algorithm achieves an average 10.8% reduction in the energy consumed at the decoder with a -0.25 dB impact to the Bjontegaard Delta-Peak Signal-to-Noise Ratio.

关键词： HEVC intra-prediction decoder complexity decoder energy optimization energy-efficient bit streams

来源：评论

学校读者我要写书评

暂无评论

Performance and complexity Analysis of Channel Coding Schemes for Multi-Gbps Wireless Communications

Performance and Complexity Analysis of Channel Coding Scheme...

引用

IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Marinkovic, Miroslav Krstic, Milos Grass, Eckhard Piz, Maxim IHP D-15236 Frankfurt Oder Germany

ISBN: (纸本)9781467325691

In this paper, a trade-off analysis between concatenated codes consisting of a convolutional (CC) followed by a Reed-Solomon (RS) code versus low-density parity-check (LDPC) codes is presented. The analysis is based on a twofold criterion: coding gain for a target bit error rate (BER) of 10(-6) and required decoder hardware complexity for a target data throughput of 10 Gbps. Furthermore, we have investigated relevant parameters which directly impact an efficient hardware implementation as well as the error correction performance of the LDPC decoder. These parameters include an attenuation factor in the min-sum layered (MSL) decoding algorithm, the finite word length of soft information and an early-termination (ET) strategy. The error correction performances are evaluated for 16-QAM modulation over an independent Rayleigh fading channel. The complexity of the RS-CC and LDPC decoders is estimated based on synthesis results using an Infineon 40 nm CMOS design kit.

关键词： Reed-Solomon LDPC convolutional code concatenated code Rayleigh fading BER performance decoder complexity data throughput

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：