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

1st International Conference on Communications, Signal Processing, and their Applications (ICCSPA)

作者： Shamsy, Sabah Univ Southampton Sch Elect & Comp Sci Southampton SO17 1BJ Hants England

ISBN: (纸本)9781467328210;9781467328203

In this paper, a generic schematic design of turbo like codes known as repeat accumulate codes is proposed. This type of codes is a subset of serial concatenated turbo codes executed as an outer code, while a convolutional code as an inner code having interleaver inserted between them. In the associated decoder, Log-BCJR algorithm is applied as it is found to perform very well for iterative decoding process. The main idea is to design a simple scheme in order to investigate the performance of repeat accumulate codes, by varying the sizes of frame length transmitted over Additive White Gaussian Noise (AWGN) channel and accomplishing eight decoding iterations at the iterative decoder. It is achievable in Bit Error Rate (BER) chart to investigate the overall performance of the turbo and turbo like codes, while Extrinsic Information Transfer (EXIT) chart is a very powerful analysis tool to portray the iterative decoding behaviour. Therefore, BER chart along with EXIT chart is presented, to provide a far accurate insight of the proposed system.

关键词： repeat accumulate code Log-BCJR EXIT Chart BER Chart

来源：评论

学校读者我要写书评

暂无评论

A Low-Complexity Decoding Algorithm for RA code with Chebyshev Polynomial Fitting

A Low-Complexity Decoding Algorithm for RA Code with Chebysh...

引用

3rd IEEE International Conference on Computer Science and Information Technology (ICCSIT)

作者： Li, Lei Wang, Qin Xu, Li Univ Sci & Technol Beijing Sch Infonnat Engn Beijing Peoples R China

ISBN: (纸本)9781424455379

RA (repeat accumulate) code has been widely used in wireless communication systems. But the BP (Belief Propagation) decoding algorithm which is commonly used in RA code has high complexity. In order to reduce the complexity of BP algorithm while maintaining coding performance, we proposed Chebyshev-Polynomial-Fitting based BP (CPF-BP) decoding algorithm. In CPF-BP decoding algorithm, we used polynomial which is generated by chebyshev fitting algorithm instead of hyperbolic tangent operation in BP decoding algorithm to reduce the implementation complexity. Experiment and simulation results show that this low-complexity algorithm removes hyperbolic tangent operation in conventional BP algorithm with same amount of multiplier under the parameters setting in the paper. The performance degradation of CPF-BP algorithm is negligible which is less than 0.6dB at BER of 10(-4) compared with conventional BP algorithm.

关键词： repeat accumulate code Polynomial Fitting Chebyshev BP algorithm

来源：评论

学校读者我要写书评

暂无评论

Implementation and performance of parallellised turbo decoders

引用

IET COMMUNICATIONS 2011年第1期5卷 39-50页

作者： Erdin, E. Kilcioglu, C. Yilmaz, A. O. TUBITAK Def Ind Res & Dev Inst Digital Elect Design Div Ankara Turkey ASELSAN Elect Ind Inc Commun Div Ankara Turkey Middle E Tech Univ Dept Elect & Elect Engn TR-06531 Ankara Turkey

In this study, the authors discuss the implementation of a low latency decoding algorithm for turbo codes and repeat accumulate codes and compare the implementation results in terms of maximum available clock speed, resource consumption, error correction performance and the data (information bit) rate. In order to decrease the latency a parallellised decoder structure is introduced for these mentioned codes and the results are obtained by implementing the decoders on a field programmable gate array. The memory collision problem is avoided by using collision-free interleavers. Through a proposed quantisation scheme and normalisation in forward/backward recursions, computational issues are handled for overcoming the overflow and underflow issues in a fixed point arithmetic. Also, the effect of different implementation styles are observed.

关键词： error correction clocks parallellised turbo decoder field programmable gate array Logic circuits codes fixed point arithmetic quantisation scheme resource consumption quantisation (signal) clock speed interleaved codes field programmable gate arrays memory collision problem collision-free interleaver repeat accumulate code turbo codes iterative decoding low latency decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Bit-by-Bit Iterative Decoding Expedites the Convergence of repeat accumulate Decoders

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2015年第6期63卷 1952-1962页

作者： Chen, Jinhui Zhang, Wenbo Maunder, Robert G. Hanzo, Lajos Univ Southampton Sch Elect & Comp Sci ECS Southampton SO17 1BJ Hants England

In this paper, we propose bit-by-bit iterative decoding for expediting the convergence of repeat accumulate (RA) decoders. In a conventional RA decoder, the repeat and accumulate component decoders are operated iteratively, to facilitate near-capacity communication. However, whenever one decoder is activated, the other is kept idle. The outputs of the active component decoder are stored until its operation is completed, whereupon the outputs are forwarded to the other decoder all at once and the activation of the decoders is swapped. The proposed bit-by-bit RA decoder expedites this process by allowing both component decoders to operate simultaneously, continuously exchanging outputs without buffering. We present both EXtrinsic Information Transfer (EXIT) charts and Bit Error Ratio (BER) results, which demonstrate that the proposed bit-by-bit RA decoder requires fewer decoding iterations to converge, at the cost of a slightly increased complexity per decoding iteration. Overall, we demonstrate that in a range of practical scenarios, the proposed bit-by-bit RA offers gains of up to 0.86 dB, without imposing any additional decoding complexity and without requiring any additional transmission-energy, -bandwidth or -duration.

关键词： repeat accumulate code channel coding iterative decoding EXIT chart decoding convergence

来源：评论

学校读者我要写书评

暂无评论

Channel Coding and Decoding in a Relay System Operated with Physical-Layer Network Coding

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2009年第5期27卷 788-796页

作者： Zhang, Shengli Liew, Soung-Chang Chinese Univ Hong Kong Dept Informat Engn Hong Kong Hong Kong Peoples R China Shenzhen Univ Dept Commun Engn Shenzhen Peoples R China

This paper investigates link-by-link channel-coded PNC (Physical layer Network Coding), in which a critical process at the relay is to transform the superimposed channel-coded packets received from the two end nodes (plus noise), Y-3 = X-1 + X-2+W-3, to the network-coded combination of the source packets, S-1 circle plus S-2. This is in contrast to the traditional multiple-access problem, in which the goal is to obtain both S-1 and S-2 explicitly at the relay node. Trying to obtain S-1 and S-2 explicitly is an overkill if we are only interested in S-1 circle plus S-2. In this paper, we refer to the transformation Y-3 -> S-1 circle plus S-2 as the Channel-decoding-Network-Coding process (CNC) in that it involves both channel decoding and network coding operations. This paper shows that if we adopt the repeat accumulate (RA) channel code at the two end nodes, then there is a compatible decoder at the relay that can perform the transformation Y-3 -> S-1 circle plus S-2 efficiently. Specifically, we redesign the belief propagation decoding algorithm of the RA code for traditional point-to-point channel to suit the need of the PNC multiple-access channel. Simulation results show that our new scheme outperforms the previously proposed schemes significantly in terms of BER without added complexity.

关键词： physical layer network coding channel coding belief propagation repeat accumulate code

来源：评论

学校读者我要写书评

暂无评论

Design of q-ary Irregular repeat-accumulate codes

Design of <i>q</i>-ary Irregular Repeat-Accumulate Codes

引用

23rd International Conference on Advanced Information Networking and Applications Workshops

作者： Lin, Wei Bai, Baoming Li, Ying Ma, Xiao Xidian Univ State Key Lab ISN Xian Peoples R China Sun Yat Sen Univ Sci Informat Sci & Technol Guangzhou Peoples R China

ISBN: (纸本)9781424440009

This paper is concerned with the construction of a class of nonbinary irregular repeat accumulate (IRA) codes. Since they are defined on the finite field GF(q) (q>2), we will refer to the constructed codes as q-ary IRA (QIRA) codes. While preserving the excellent error correcting capability of q-ary LDPC codes, QIRA codes can be efficiently encoded like conventional binary IRA codes. By adopting the progressive edge growth (PEG) algorithm to construct the parity check matrices, we can achieve the increased girth of their factor graphs and improved decoding performance. Simulation results show that, using the sum-product algorithm on GF(q), QIRA codes outperform binary LDPC codes and Turbo codes in terms of bit error ratio and frame error ratio on AWGN channels. Especially, they could achieve excellent error performance when combined with high order modulations. Feasibility study indicates, with the use of the extended min-sum (EMS) decoding algorithm, QIRA codes are competitive candidates for practical applications.

关键词： repeat accumulate code nonbinary LDPC code progressive edge growth EMS algorithm

来源：评论

学校读者我要写书评

暂无评论

Channel Coding and Decoding in a MIMO TWRC with Physical-layer Network Coding

Channel Coding and Decoding in a MIMO TWRC with Physical-lay...

引用

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

作者： Zhang, Shengli Lu, Liya Nie, Canping Qian, Gongbin Wang, Fanggang Shenzhen Univ Dept Commun Engn Shenzhen Peoples R China Chinese Univ Hong Kong Inst Network Coding Hong Kong Peoples R China

ISBN: (纸本)9781467325691

In this paper, we propose a joint design of MIMO-PNC (multiple-input multiple-output physical layer network coding) and channel decoding in two way relay channels. The paper shows that if we adopt the same repeat accumulate (RA) channel code at the two end nodes, there would be a compatible decoder at the relay which can transform the received superimposed packet to the network coding form of the two packets efficiently. Specifically, we redesign the belief propagation decoding algorithm of the RA code for traditional point-to-point channel to suit the need of the MIMO PNC channel. The simulation results show that our new scheme outperforms the previously proposed schemes which combined MIMO NC with channel coding/decoding significantly in terms of BER with little added complexity.

关键词： physical layer network coding MIMO channel code belief propagation repeat accumulate code

来源：评论

学校读者我要写书评

暂无评论

An Optimizing Strategy Research of LDPC Decoding Based on GPGPU

An Optimizing Strategy Research of LDPC Decoding Based on GP...

引用

12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Yuan, Luechao Xing, Zuocheng Zhang, Yang Chen, Xiaobao Natl Univ Def Technol Dept Comp Changsha Hunan Peoples R China

ISBN: (纸本)9780769550220

As powerful error correcting codes, Low-Density Parity-Check (LDPC) codes have been adopted as a fundamental building block by dirty paper coding (DPC), which indicates that lossless precoding is theoretically possible at any signal-to-noise ratio (SNR), and is a promising strategy in future communication systems. However, to achieve this performance gain demands huge computation complexity. For its lower cost and better flexibility, the GPU-based LDPC decoder is an emerging research subject. Based on the perspective of GPU hardware architecture, a multi-stage optimizing mapping strategy (MSOMS) is proposed and implemented to accelerate LDPC decoding. The performance is boosted significantly by balancing the memory access and computation load, optimizing execution configuration and the memory access pattern, and fully utilizing the on-chip high speed resources. Proposed decoders can achieve 383- and 442-speedup compared to CPU-based decoder for LDPC and RA code (another ensemble of LDCP code), and the achieved throughput is comparable to existed GPU-based decoders, which confirm the efficiency of the MSOMS strategy.

关键词： Dirty Paper Coding Low Density Parity code repeat accumulate code Graphic Process Unit

来源：评论

学校读者我要写书评

暂无评论

Mapping and Coding Design for Channel coded Physical-layer Network Coding

Mapping and Coding Design for Channel Coded Physical-layer N...

引用

International Workshop on High Mobility Wireless Communications

作者： Li, Xu Zhang, Shengli Qian, Gongbin Shenzhen Univ Coll Informat Engn Dept Commun Engn Shenzhen Peoples R China

ISBN: (纸本)9781467363808;9781467363792

Although BTCM can significantly improves the BER performance by iteration processing between the demapping and the decoding in a traditional receiver, its design and performance in PNC system has fewer studied. This paper investigates a bit interleaved coded modulation (BICM) scheme in a Gaussian two-way relay channel operated with physical layer network coding (PNC). In particular, we first present an iterative demapping and decoding framework specially designed for PNC. After that, we compare different constellation mapping schemes in this framework, with the convergence analysis by using the EXIT chart. It is found that the anti-Gray mapping outperforms the Gray mapping, which is the best mapping in the traditional decoding schemes. Finally, the numerical simulation shows the better performance of our framework and verifies the mapping design.

关键词： Physical layer network coding iterative demapping and decoding BICM repeat accumulate code

来源：评论

学校读者我要写书评

暂无评论

A Low-Complexity Decoding Algorithm for RA code with Chebyshev Polynomial Fitting

A Low-Complexity Decoding Algorithm for RA Code with Chebysh...

引用

2010 3rd IEEE International Conference on Computer Science and Information Technology—ICCSIT 2010

作者： Lei Li, Qin Wang, Li Xu School of Information Engineering University of Science and Technology Beijing Beijing, China

关键词： repeat accumulate code Polynomial Fitting Chebyshev BP algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：