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

7th Mediterranean Conference on Embedded Computing (MECO)

作者： Valery, Zolotarev Natalya, Grinchenko Alexey, Lotsmanov Gennady, Ovechkin Russian Acad Sci Space Res Inst Dept 71 Moscow Russia Ryazan State Radio Engn Univ Fac Comp Engn Ryazan Russia

ISBN: (纸本)9781538656839

Mutithreshold decoding for convolutional codes implementing optimization methods to correct errors based on the search of global extremum of functionals in discrete spaces are considered. The implementation of divergent coding methods with triple concatenation to achieve highly efficient decoding near channel capacity is described. The possibilities of this approach while using concatenation are shown. Multialgorithmic decoding is offered. It implements the principle of divergence with simultaneous usage of two types of decoders: Viterbi algorithm and multithreshold decoding. The implementation of multialgorithmic decoding is shown to substantially decrease decoding complexity at low signal to noise ratio.

关键词： multithreshold decoder Viterbi algorithm self-orthogonal code divergent coding concatenated code parity-check code Shannon bound channel capacity decoding complexity optimal decoding coding gain multialgorithmic decoding

来源：评论

学校读者我要写书评

暂无评论

Efficient Implementation of Parallel Concatenated Gallager Codes with Single Encoder

Efficient Implementation of Parallel Concatenated Gallager C...

引用

International Conference on Communication Systems and Networks (ComNet)

作者： Aswathy, G. P. Haneefa, Niyas K. Mar Baselios Coll Engn & Technol Dept Elect & Commun Engn Thiruvananthapuram Kerala India

ISBN: (纸本)9781509033492

Parallel Concatenated Gallager Codes (PCGCs) have proved to be an effective way to improve the bit error rate (BER) performance by increasing the redundancy at the same time reducing the encoding and decoding complexity when compared to dedicated Low Density Parity Check (LDPC) code of same length and code rate. Existing PCGC with single encoder has not been extensively successful due to its performance limitation, decoder complexity and decoding delay. In this paper we propose an efficient decoding methodology for PCGC with single encoder. We show that the proposed methodology outperforms existing PCGC with single encoder in terms of BER performance in AWGN channel. We also present that the proposed decoder is much less complex than existing one.

关键词： LDPC Parallel concatenation PCGC decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Wireless Robotics: Generalization of an Efficient Approach with Multi-h CPM Signaling and L2-Orthogonal Space-Time Coding

Wireless Robotics: Generalization of an Efficient Approach w...

引用

Strategic Workshop

作者： Hisojo, Miguel Angel Lebrun, Jerome Deneire, Luc Univ Nice Sophia Antipolis CNRS F-06903 Sophia Antipolis France

Wireless Robotics has become an important research topic in the last two decades. The need of controlling a robot to perform tasks remotely has significantly increased with the number of applications in fields like medicine and military, among many others. Taking advantage of current standards like Bluetooth and Wifi, Wireless Robotics calls for low power consumption components, robustness and high data rate through the wireless channel. This call can be fulfilled with a reliable signaling format, satisfying the needs of low power consumption and high spectral efficiency. Besides, continuous phase modulation (CPM) has gained increasing attention due to its favorable trade-off between power and bandwidth efficiency. Multi-h CPM recently appeared as a generalization of single-h schemes so as to further decrease the need for bandwidth expansion over the wireless channel. Despite the interesting characteristics of CPM, the decoding of the received signal is particularly difficult in a multi-path wireless environment with no diversity. To provide some level of diversity, several authors have proposed to combine CPM with space-time block coding. A new family of codes for CPM, based on -orthogonality was recently introduced in Hesse et al. (IEEE Trans Commun 59(11): 3158-3166, 2011). These full rate codes achieve full diversity and a low decoding complexity. In this paper, we detail a non trivial extension of these -orthogonal space-time codes using multi-h signaling schemes. These new codes still achieve full diversity but a better spectral compactness by utilizing the available communication bandwidth more efficiently. Also, the decoding complexity is greatly decreased by using only one correlation filter bank for the detection of all transmitted signals.

关键词： Wireless Robotics Space-time coding Continuous phase modulation L2-Orthogonal design Multi-h CPM Diversity decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Space-Time Codes with Block-Orthogonal Structure and Their Simplified ML and Near-ML decoding

Space-Time Codes with Block-Orthogonal Structure and Their S...

引用

IEEE 72nd Vehicular Technology Conference Fall 2010

作者： Ren, Tian Peng Guan, Yong Liang Yuen, Chau Zhang, Er Yang Natl Univ Def Technol Changsha 410073 Hunan Peoples R China Nanyang Technol Univ Singapore 639798 Singapore Inst Informat Res Singapore 119613 Singapore

ISBN: (纸本)9781424435746

Existing high-rate full diversity space-time codes (STC) always have high decoding complexity with traditional ML (maximum-likelihood) or near-ML decoding. Hence the decoding scheme with reduced complexity is required. In this paper, block-orthogonal structure is introduced for the first time, and most of the existing STC do have such structure. A simplified decoding is proposed to exploit the block-orthogonal structure of the code and reduce the complexity drastically without any extra loss in decoding performance.

关键词： Space-time codes block orthogonality ML and near-ML decoding decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Delay-complexity Trade-off of Random Linear Network Coding in Wireless Broadcast

Delay-Complexity Trade-off of Random Linear Network Coding i...

引用

IEEE International Conference on Communications (IEEE ICC) / Workshop on NOMA for 5G and Beyond

作者： Su, Rina Sun, Qifu Tyler Zhang, Zhongshan Univ Sci & Technol Beijing Dept Commun Engn Beijing Peoples R China Beijing Inst Technol Sch Informat & Elect Beijing Peoples R China

ISBN: (纸本)9781728150895

In wireless broadcast, random linear network coding (RLNC) over GF(2(L)) is known to asymptotically achieve the optimal completion delay with increasing L. However, the high decoding complexity hinders the potential applicability of RLNC schemes over large GF(2(L)). In this paper, a comprehensive analysis of completion delay and decoding complexity is conducted for field-based systematic RLNC schemes in wireless broadcast. In particular, we prove that the RLNC scheme over GF(2) can also asymptotically approach the optimal completion delay per packet when the packet number goes to infinity. Moreover, we introduce a new method, based on circular-shift operations, to design RLNC schemes which avoid multiplications over large GF(2(L)). The new RLNC schemes turn out to have a much better trade-off between completion delay and decoding complexity. In particular, numerical results demonstrate that the proposed schemes can attain average completion delay just within 5% higher than the optimal one, while the decoding complexity is only about 3 times the one of the RLNC scheme over GF(2).

关键词： wireless broadcast random linear network coding circular-shift completion delay decoding complexity

来源：评论

学校读者我要写书评

暂无评论

decoding techniques for coded FH OFDMA with nonparametric reception 10

Decoding techniques for coded FH OFDMA with nonparametric re...

引用

10th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT) - Emerging Technologies for Connected Society

作者： Osipov, Dmitry Russian Acad Sci Inst Informat Transmiss Problems Lab Informat Transmiss Anal & Protect Tech Moscow Russia Natl Res Univ Higher Sch Econ Fac Comp Sci Moscow Russia

ISBN: (纸本)9781538693605

When combined with frequency hopping and error correction coding reception techniques based on distribution-free tests provide strong immunity to various types of interference (including multiuser interference) which makes systems using such techniques promising candidates for various applications such as IoT (Internet of Things) and D2D (Device to Device) communications. Unfortunately complexity considerations impose drastic restrictions on code parameters. In this paper a decoding technique is proposed that combines list decoding, ordered statistics decoding and recently proposed distributionfree reception technique in order to ease those restrictions. It is shown that the proposed approach provides considerable Frame Error Rate decrease for the same transmission rates.

关键词： ordered statistics decoding list decoding non-parametric detection decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Concatenated Alamouti codes using multi-level modulation and symbol mapping diversity technique

引用

Frontiers of Electrical and Electronic Engineering in China 2010年第4期5卷 464-469页

作者： Mingwei CAO Guangguo BI China Ship Research and Development Academy Beijing 100192China National Mobile Communications Research Laboratory Southeast UniversityNanjing 210096China

A family of space-time block codes(STBCs)for systems with even transmit antennas and any number of receive antennas is *** new codeword matrix is constructed by concatenating Alamouti space-time codes to form a block diagonal matrix,and its dimension is equal to the number of transmit *** Alamouti codes in the same codeword matrix have the same information;thus,full transmit diversity can be achieved over fading *** improve the spectral efficiency,multi-level modulations such as multi-quadrature amplitude modulation(M-QAM)are *** symbol mapping diversity is then exploited between transmissions of the same information from different antennas to improve the bit error rate(BER)*** proposed codes outperform the diagonal algebraic space-time(DAST)codes presented by Damen[Damen et *** Transactions on Information Theory,2002,48(3):628–636]when they have the same spectral ***,they outperform the 1/2-rate codes from complex orthogonal ***,compared to DAST codes,the proposed codes have a low decoding complexity because we only need to perform linear processing to achieve single-symbol maximum-likelihood(ML)decoding.

关键词： space-time block codes(STBCs) symbol mapping spectral efficiency decoding complexity pairwise error probability(PEP)

来源：评论

学校读者我要写书评

暂无评论

Low PAPR and Spatial Diversity for OFDM Schemes by using L2-Orthogonal CPM ST-Codes with Fast decoding 6

Low PAPR and Spatial Diversity for OFDM Schemes by using L2-...

引用

IEEE Latin-America Conference on Communications LATINCOM

作者： Hisojo, Miguel Angel Lebrun, Jerome Deneire, Luc Univ Nice Sophia Antipolis CNRS Lab I3S Nice France

ISBN: (纸本)9781479971626

Orthogonal Frequency Division Multiplexing (OFDM) is a popular modulation technique that provides high data rates and good robustness against frequency selective fading. Space-Time Block Coding (STBC) is an efficient way to introduce space-time diversity in Multiple-Input Multiple-Output (MIMO) systems. Using non-linear modulations such as Continuous Phase Modulation (CPM) with its constant envelope and continuous phase properties could be a solution to construct MIMO OFDM systems and to avoid the structural limitations of linear codes and alleviate the typical PAPR issue of OFDM. However, a major issue with CPM based systems may remain: the decoding complexity. In this paper, we introduce a new space-time-frequency diversity technique based on L2-orthogonal multi-h CPM Space-Time codes designed for OFDM transmission. We benchmark these codes under Rayleigh frequency selective channels and show how they achieve full spatial diversity at full rate for any number of antennas, good spectral compactness and also robustness to frequency fading. Furthermore, the decoding complexity is highly reduced and even made linear in the number of antennas thanks to the orthogonality properties.

关键词： MIMO communication OFDM modulation Rayleigh channels antenna arrays computational complexity decoding diversity reception linear codes space-time block codes CPM CPM-based systems L2-orthogonal CPM ST-codes L2-orthogonal multiA CPM space-time codes MIMO OFDM systems OFDM transmission PAPR issue Rayleigh frequency selective channels STBC constant envelope continuous phase modulation continuous phase properties decoding complexity fast decoding frequency selective fading full-spatial diversity modulation technique multiple-input multiple-output systems nonlinear modulation orthogonal frequency division multiplexing orthogonality properties space-time block coding space-time diversity space-time-frequency diversity technique spectral compactness Bit error rate decoding Frequency diversity Modulation OFDM Transmitting antennas Orthogonal frequency division multiplexing space time block coding linear codes multiple input multiple output systems decoding Critical path method continuous phase modulation nonlinear modulation selective fading Frequency diversity transmitting antennas MIMO communication spatial diversity Raleigh fading channels diversity reception

来源：评论

学校读者我要写书评

暂无评论

Fast Maximum-Likelihood decoding for BLAST Systems: Decomposed Matrix Structure Technique

Fast Maximum-Likelihood Decoding for BLAST Systems: Decompos...

引用

21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Kahraman, Sinan Celebi, Mehmet Ertugrul T&#x00FC bitak-Uekae Turkey

ISBN: (纸本)9781424480166

In this paper, we propose a technique which is efficient in reducing the required computational complexity of the maximum-likelihood decoding for BLAST system. Our technique is based on the determination of reducible computational complexity for any given BLAST system. In this fashion a specialized decoding can be defined. Our idea is based on the determination of zero entries of the upper-triangular matrix R which occurs in QR-decomposition step of the sphere decoding algorithm. Through the determined zero at kth row of the matrix R, at least 8 arithmetic operations can be canceled for every time of node visiting in the search tree at level k. Furthermore, properties of the matrix structure can be exploited in sphere decoding in order to reduce complexity of the metric computations for each branch. For this case, considerable saving in the computational complexity can be obtained.

关键词： BLAST decoding complexity MIMO ML estimation QR-decomposition sphere decoder

来源：评论

学校读者我要写书评

暂无评论

Error floor Analysis of LT Codes over the Additive White Gaussian Noise Channel

Error floor Analysis of LT Codes over the Additive White Gau...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Hussain, Iqbal Xiao, Ming Rasmussen, Lars K. KTH Royal Inst Technol Sch Elect Engn Commun Theory Lab Stockholm Sweden

ISBN: (纸本)9781424492688

We investigate the error floor performance of Luby Transform (LT) codes over the additive white Gaussian noise channel. We first derive a lower bound on the bit error rate for an LT code, which we subsequently use to show that the corresponding error floor is predominantly caused by low-degree variable nodes. Based on this observation, we propose a modified encoding scheme for LT codes that provides a lower error floor with no increase in encoding and decoding complexities. The convergence behavior of the proposed scheme is analyzed using extrinsic information transfer charts, and shown to be similar to the original LT code. Numerical examples demonstrate the improvements of the modified LT code as a stand-alone code and as a component code of a Raptor code.

关键词： AWGN channels AWGN channels Bit error rate Convergence decoding Encoding Generators LT codes Luby transform codes Peer to peer computing Raptor code additive white Gaussian noise channel bit error rate communication complexity component code convergence behavior decoding decoding complexity encoding complexity error floor analysis error floor performance error statistics extrinsic information transfer charts low-degree variable nodes modified encoding scheme stand-alone code transform coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：