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

IEEE International Symposium on Information Theory (ISIT)

作者： Pimentel, Cecilio Souza, Richard Demo Uchoa-Filho, Bartolomeu F. Benchimol, Isaac Univ Fed Pernambuco DES CODEC Recife PE Brazil UTFPR CPGEI Curitiba Parana Brazil Univ Fed Santa Catarina GPqCom EEL CTC Florianopolis SC Brazil IFAM CMDI Manaus Amazonas Brazil

ISBN: (纸本)9781457705953

We consider high-rate systematic recursive convolutional encoders to be adopted as constituent encoders in turbo schemes. It has been shown by Douillard and Berrou that the construction of high-rate turbo codes by means of high-rate constituent encoders offers several advantages over the typical construction based on the puncturing of rate-1/2 constituent encoders. To reduce the decoding complexity associated with high-rate codes, we adopt the "minimal" trellis representation of convolutional codes introduced by McEliece and Lin. While in the literature this trellis has been obtained for nonrecursive nonsystematic generator matrices, we herein introduce the construction of the "minimal" trellis for a systematic recursive convolutional encoding matrix. We also derive expressions for the arithmetic decoding complexity when the max-log-map algorithm is applied over the conventional and the "minimal" trellises. Examples are provided, which show that significant savings in decoding complexity are obtained, while keeping the same error performance of conventional schemes, when the minimal trellis is used. Finally, a code search is conducted and examples are provided which indicate that a refinement in terms of decoding complexity-error performance trade-off is obtained.

关键词： Complexity theory Convolutional codes Decoding Matrix decomposition Systematics Turbo codes arithmetic decoding complexity communication complexity complexity-error performance convolutional codes decoding decoding complexity high-rate turbo code matrix algebra max-log-map algorithm maximum likelihood estimation minimal trellis nonrecursive nonsystematic generator matrix recursive estimation systematic recursive convolutional encoder trellis codes turbo codes

来源：评论

学校读者我要写书评

暂无评论

Fast Joint Source-Channel Decoding of Convolutional Coded Markov Sequences with Monge Property

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2010年第1期58卷 128-135页

作者： Dumitrescu, Sorina McMaster Univ ECE Dept Hamilton ON L8S 4L8 Canada

This work addresses the problem of joint source-channel decoding of a Markov sequence which is first encoded by a source code, then encoded by a convolutional code, and sent through a noisy memoryless channel. It is shown that for Markov sources satisfying the so-called Monge property, both the maximum a posteriori probability (map) sequence decoding, as well as the soft output max-log-map decoding can be accelerated by a factor of K without compromising the optimality, where K is the size of the Markov source alphabet. The key to achieve a higher decoding speed is a convenient organization of computations at the decoder combined with a fast matrix search technique enabled by the Monge property. The same decrease in complexity follows, as a by-product of the development, for the soft output max-log-map joint source channel decoding in the case when the convolutional coder is absent, result which was not known previously.

关键词： Joint source-channel decoding maximum a posteriori probability sequence estimation max-log-map algorithm Markov sequence Monge property

来源：评论

学校读者我要写书评

暂无评论

An Efficient FPGA-based Turbo Decoder and Its Application in FH-SS System

An Efficient FPGA-based Turbo Decoder and Its Application in...

引用

4th International Conference on Wireless Communications, Networking and Mobile Computing

作者： Bu, Xiang-yuan Yang, Guo-ying Liu, Ce-lun Zhou, Rong-hua Beijing Inst Technol Dept Elect Engn Beijing 100081 Peoples R China

ISBN: (纸本)9781424421077

This paper focuses on implementing an efficient and simplified turbo decoder with FPGA. The max-log-map algorithm is employed and a simplified and improved max-log-map algorithm is present. By carefully manipulating hardware, we implement the whole turbo decoder with a single-RSC structure. Comparing with the conventional decoder, our turbo decoder reduces about 60% hardware cost and operates up to 2Mbit/s. Finally, we investigate the performance of our FPGA-based turbo decoder in a FH-SS system with partial band jamming. The results drawn from this code are compared with a RS code. Results show that the turbo code significantly outperforms the RS code.

关键词： max-log-map algorithm FPGA Turbo Decoder FH-SS

来源：评论

学校读者我要写书评

暂无评论

A Programmable max-log-map Turbo Decoder Implementation

引用

VLSI DESIGN 2008年第unknown期2008卷

作者： Salmela, Perttu Sorokin, Harri Takala, Jarmo Tampere Univ Technol Dept Comp Syst POB 553 FIN-33101 Tampere Finland

In the advent of very high data rates of the upcoming 3G long-term evolution telecommunication systems, there is a crucial need for efficient and flexible turbo decoder implementations. In this study, a max-log-map turbo decoder is implemented as an application-specific instruction-set processor. The processor is accompanied with accelerating computing units, which can be controlled in detail. With a novel memory interface, the dual-port memory for extrinsic information is avoided. As a result, processing one trellis stage with max-log-map algorithm takes only 1.02 clock cycles on average, which is comparable to pure hardware decoders. With six turbo iterations and 277MHz clock frequency 22.7Mbps decoding speed is achieved on 130nm technology. Copyright (C) 2008 Perttu Salmela et al.

关键词： .clock cycles decoders clock frequency extrinsic memory interface VLSI Design dual-port turbo decoder implementations max-log-map algorithm pure hardware

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Different Equalization algorithms in A Modified Iterative Scheme

Performance Analysis of Different Equalization Algorithms in...

引用

2008 the IET 2ND International Conference on Wireless,Mobile & Multimedia Networks

作者： Shuangshuang Han Dongfeng Yuan Xiang Cheng School of Information Science and Engineering Shandong University Joint Research Institute for Signal and Image Processing School of EPSHeriot-Watt University

This paper proposes a modified iterative scheme(MI) for the data transmitted by more efficient way over inter-symbol interference(ISI) channels,then compares and analyzes the performance for three equalization algorithms in MI: improved max-log-map(I-MLM) algorithm,maximum a posteriori(map) algorithm and linear minimum meansquared error(LMMSE) *** we analyze and compare these three algorithms in traditional turbo equalization(TE) ***,according to the good understanding of the aforementioned algorithms and the novel iterative(NI) scheme which combines parallel with serial concatenation turbo-like scheme,we propose the MI scheme and compare the performance of three algorithms in MI, named as MI-I-MLM,MI-map and MI-LMMSE *** analytical and simulation results demonstrate that the performance of MI-I-MLM is very close to MI-map and much better than MI-LMMSE while its computational complexity is much lower.

关键词： Linear minimum mean-squared error(LMMSE) maximum a posteriori(map) max-log-map algorithm turbo equalization(TE)

来源：评论

学校读者我要写书评

暂无评论

Energy efficient turbo decoder with reduced state metric quantization

Energy efficient turbo decoder with reduced state metric qua...

引用

IEEE Workshop on Signal Processing Systems

作者： Liu, Haisheng Diguet, Jean-Philippe Jego, Christophe Jezequel, Michel Boutillon, Emmanuel ENST Bretagne GET CNRS TAMCICUMR 2872 Brest France Univ Bretagne Sud CNRS FRE 2734 LESTER Lorient France

ISBN: (纸本)9781424412211

In the field of mobile communications, the energy issue of a turbo decoder becomes an equivalent constraint as throughput and performance. This paper describes a technique to reduce the internal bitwidth of the state metrics, and hence, to decrease the entire energy dissipation of a turbo decoder. This approach is based on the saturation of the state metrics. Two cases are investigated: saturation outside the ACS recursion loop and saturation inside the ACS recursion loop. The targeted system is the Universal Mobile Telecommunications System (UTMTS) with an 8-state turbo decoder using the max-log-map algorithm. When received symbols and extrinsic informations are respectively 4-bit and 6-bit quantized, the internal bitwidth of the state metrics can be reduced from 7 bits downto 4 bits. This reduction is paid by a loss of 0.1 dB at a Bit Error Rate (BER) of 10(-6). In addition, when 4 SISO decoders perform in parallel, the proposed optimization yields to a reduction of memory area by 10% and leads to an energy reduction of 24% for a 70 mn technology.

关键词： turbo codes max-log-map algorithm state metric quantization energy efficient architecture

来源：评论

学校读者我要写书评

暂无评论

Low-power hybrid turbo decoding based on reverse calculation

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2006年第3期E89A卷 782-789页

作者： Choi, HM Kim, JH Park, IC Korea Adv Inst Sci & Technol Div Elect Engn Taejon South Korea Korea Adv Inst Sci & Technol Dept Elect Engn Taejon South Korea

As turbo decoding is a highly memory-intensive algorithm consuming large power, a major issue to be solved in practical implementation is to reduce power consumption. This paper presents an efficient reverse calculation method to lower the power consumption by reducing the number of memory accesses required in turbo decoding. The reverse calculation method is proposed for the max-log-map algorithm, and it is combined with a scaling technique to achieve a new decoding algorithm, called hybrid log-map, that results in a similar BER performance to the log-map algorithm. For the W-CDMA standard, experimental results show that 80% of memory accesses are reduced through the proposed reverse calculation method. A hybrid log-map turbo decoder based on the proposed reverse calculation reduces power consumption and memory size by 34.4% and 39.2%, respectively.

关键词： log-map algorithm low-power design max-log-map algorithm reverse calculation turbo codes turbo coding turbo decoding

来源：评论

学校读者我要写书评

暂无评论

Low-complexity BCJR decoder for turbo decoders and its VLSI implementation in 0.18-μm CMOS 62

Low-complexity BCJR decoder for turbo decoders and its VLSI ...

引用

62nd IEEE Vehicular Technology Conference

作者： Sabeti, L Ahmadi, M Tepe, KE Univ Windsor Dept Elect Engn Windsor ON N9B 3P4 Canada

ISBN: (纸本)0780391527

This paper proposes a low-complexity design for BCJR or maximum a posteriori (map) decoders. max-log-map algorithm, which offers a good compromise between performance and complexity, is selected for implementation. The decoder architecture is parallel and pipeline. New quantization and new branch metric calculation unit are proposed in this paper. Overall decoder design is flexible to the transmission block lengths, which makes it appropriate for variable length transmission systems. Performance results are tested on turbo decoders and show that the proposed BUR decoder is quite suitable for turbo decoders. The chip is implemented in a 0.18-mu m six-layer metal CMOS technology and has the core size of 1mm(2) (including two memories). The throughput of the turbo decoder is 6.5Mb/s after 10 iterations.

关键词： turbo coding max-log-map algorithm implementation

来源：评论

学校读者我要写书评

暂无评论

Parallelised max-log-map model

引用

ELECTRONICS LETTERS 2002年第17期38卷 971-972页

作者： Loo, KK Salman, K Alukaidey, T Jimaa, SA Univ Hertfordshire Dept ECEE Hatfield AL10 9AB Herts England N Carolina Agr & Tech State Univ Greensboro NC 27411 USA

A parallelised max-log-map model (P-max-log-map) that exploits the sub-word parallelism and very long instruction word architecture of a microprocessor or a digital signal processor (DSP) is presented. The proposed model reduces considerably the computational complexity of the max-log-map algorithm;and therefore facilitates easy implementation.

关键词： DSP sub-word parallelism microprocessor parallelised max-log-map model computational complexity reduction very long instruction word architecture parallel algorithms signal processing max-log-map algorithm computational complexity decoding digital signal processor VLIW architecture turbo codes 3GPP turbo codes

来源：评论

学校读者我要写书评

暂无评论

Design for a turbo-code decoder using a block-wise algorithm

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2002年第2期E85B卷 559-564页

作者： Park, GH Yoon, SH Hong, D Kang, CE Yonsei Univ Dept Elect & Comp Engn Informat & Telecommun Lab Seodaemoon Gu Seoul 120749 South Korea LG Elect Inc LG R&D Complex 533 Mobile Comm Res Lab Dept Mobile Comm TechDongan Gu Kyeongku Do 431749 South Korea

Several implementation methods for a map decoder are proposed in this paper, Using a novel pipeline structured time-shared process, the authors are able to efficiently overcome the restrictions imposed by the recursion process on state metrics. and the complexity of the map decoder can be reduced to a level on the order of a SOVA (Soft Output Viterbi algorithm) decoder. In addition. the authors propose an efficient controller structure that can be used for variable frame-size systems such as cdma-2000. The map decoder using a block-wise algorithm designed here was implemented in only one 20,000 gate circuit. It was validated by VHDL, which was compared with the results of the initial simulation (C programs). The decoder demonstrated a 300 kbps decoding processing ability with 8 iterations on a FPGA circuit, with a deviation only about 0.1-0.2 dB greater than that for an ideal map decoder, even when all hardware environments are considered.

关键词： turbo-codes decoder map algorithm max-log-map algorithm block-wise algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：