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

low complexity Polar Decoder for 5G Embb Control Channel

IEEE ACCESS 2019年 7卷 50710-50717页

作者： Sun, Ce Fei, Zesong Cao, Congzhe Wang, Xinyi Jia, Dai Beijing Inst Technol Sch Informat & Elect Beijing 10081 Peoples R China Sci & Technol Commun Networks Lab Shijiazhuang 050051 Hebei Peoples R China Univ Alberta Dept Elect & Comp Engn Edmonton AB T6G 1H9 Canada

Polar codes have become the channel coding scheme for control channel of enhanced mobile broadband in the fifth generation (5G) communication systems. Belief propagation (BP) decoding of polar codes has the advantage of low decoding latency and high parallelism but suffers from high complexity. In this paper, a low complexity BP decoder is proposed for polar codes. We reduce the computational complexity by two steps. First, the cyclic redundancy check is concatenated to the decoder in order to decrease the number iterations of the BP algorithm. Then, a threshold is proposed based on Gaussian approximation to save the computational complexity of BP nodes. If the log-likelihood ratio of a node in the tanner graph is larger than the threshold, this node is no longer updated during the rest of the decoding process. The simulation results show that the proposed scheme has a similar block error rate performance with the original BP decoder, while the computational complexity is reduced significantly.

关键词： Polar codes belief propagation low complexity decoding eMBB

来源：评论

学校读者我要写书评

暂无评论

ML Decoder for Decode-and-Forward Based Cooperative Communication System

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2011年第12期10卷 4080-4090页

作者： Bhatnagar, Manav R. Hjorungnes, Are Indian Inst Technol Delhi Dept Elect Engn New Delhi 110016 India Univ Oslo UNIK Univ Grad Ctr NO-2027 Kjeller Norway

Decode-and-forward (DF) protocol based cooperative communication is vulnerable to the erroneous relaying by the relay. In this paper, we derive a maximum-likelihood (ML) decoder for the DF protocol utilizing arbitrary complex-valued constellations including M-PSK, M-PAM, and M-QAM. A setup of a single pair of source and destination with one relay is studied. The source and the relay utilize orthogonal uncoded transmissions. The relay performs ML decoding and forwards the decoded symbol to the destination, and it might commit errors in decoding the data. The ML decoder at the destination is obtained by maximizing the probability density function (p. d. f.) of the data received during two orthogonal transmissions at the destination under the assumption that the average probability of error of the source-relay link is known at the destination. The proposed ML decoder is a generalized decoder which is applicable to arbitrary constellations, whereas, one existing DF cooperative decoder is applicable to the real valued constellations like BPSK and M-PAM. One existing decoder is also applicable to M-2-QAM constellations. We also derive a low-complexity piecewise linear (PL) decoder for arbitrary complex-valued M-point constellations which performs similar to the ML decoder for all signal-to-noise ratio values. An approximate expression of the symbol error rate (SER) of the PL decoder for M-PSK constellation is derived. By using the approximate SER expressions, it is proved that the proposed ML and PL decoders achieve full diversity of two in the cooperative system studied.

关键词： Decode-and-forward protocol cooperative communication low complexity decoding ML decoding

来源：评论

学校读者我要写书评

暂无评论

Pilot-Aided Side Information Detection in SLM-Based OFDM Systems

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2013年第7期12卷 3140-3147页

作者： Hong, Eonpyo Kim, Hyunju Yang, Kyeongcheol Har, Dongsoo Agcy Def Dev Taejon 305152 South Korea Pohang Univ Sci & Technol POSTECH Dept Elect Engn Pohang 790784 Gyungbuk South Korea Korea Adv Inst Sci & Technol Cho Chun Shik Grad Sch Green Transportat Taejon 305701 South Korea

Selected mapping (SLM) based schemes effectively reduce the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) systems. However, they require side information (SI) transmission, which incurs a loss in the data throughput in addition to the increased system complexity. This paper presents a blind SLM scheme based on a decision metric obtained from pilot sub-channel responses. A novel SI detection method enabling low complexity data decoding is proposed. The SI is detected by exploiting the high autocorrelation between adjacent pilot sub-channel responses. The SI detection error rate is analytically derived and compared with that obtained by simulations. Simulation results of the data decoding scheme based on the proposed SI detection method show the bit error rate performance comparable to that of the simplified maximum likelihood (ML) data decoding scheme, while the computational complexity is close to that of the embedded SI based decoding scheme.

关键词： PAPR side information blind SLM low complexity decoding

来源：评论

学校读者我要写书评

暂无评论

Fast Optimal decoding of Multiplexed Orthogonal Designs by Conditional Optimization

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2010年第3期56卷 1106-1113页

作者： Sirianunpiboon, Songsri Wu, Yiyue Calderbank, A. Robert Howard, Stephen D. Def Sci & Technol Org Canberra ACT 5111 Australia Princeton Univ Dept Elect Engn Princeton NJ 08544 USA

This paper focuses on conditional optimization as a decoding primitive for high rate space-time codes that are obtained by multiplexing in the spatial and code domains. The approach is a crystallization of the work of Hottinen et al. which applies to space-time codes that are assisted by quasi-orthogonality. It is independent of implementation and is more general in that it can be applied to space-time codes such as the Golden Code and perfect space-time block codes, that are not assisted by quasi-orthogonality, to derive fast decoders with essentially maximum likelihood (ML) performance. The conditions under which conditional optimization leads to reduced complexity ML decoding are captured in terms of the induced channel at the receiver. These conditions are then translated back to the transmission domain leading to codes that are constructed by multiplexing orthogonal designs. The methods are applied to several block space-time codes obtained by multiplexing Alamouti blocks where it leads to ML decoding with complexity O(N-2) where N is the size of the underlying QAM signal constellation. A new code is presented that tests commonly accepted design principles and for which decoding by conditional optimization is both fast and ML. The two design principles for perfect space-time codes are nonvanishing determinant of pairwise differences and cubic shaping, and it is cubic shaping that restricts the possible multiplexing structures. The new code shows that it is possible to give up on cubic shaping without compromising code performance or decoding complexity.

关键词： Alamouti multiplexing conditional optimization low complexity decoding maximum likelihood (ML) decoding orthogonal designs space-time codes

来源：评论

学校读者我要写书评

暂无评论

A low-complexity Decoder With Non-Uniform Quantization for Recursive BMST Codes

引用

IEEE COMMUNICATIONS LETTERS 2021年第8期25卷 2463-2467页

作者： Ai, Shengbo Zhao, Shancheng Jinan Univ Coll Informat Sci & Technol Guangzhou 510632 Peoples R China Guangdong Key Lab Data Secur & Privacy Preserving Guangzhou 510632 Peoples R China

Recursive block Markov superposition transmission (rBMST) can be used to construct high-performance spatially coupled codes. When used in power-limited scenarios, low-complexity quantized decoders are required for the rBMST codes. In this letter, we introduce an efficient decoder for rBMST codes by incorporating non-uniform quantization (NUQ) into the threshold attenuated min-sum algorithm (TAMSA). The resulting decoder is referred to as the NUQ-TAMSA. We use the hierarchical dynamic quantization algorithm to design the non-uniform quantizer. To show the effectiveness of the NUQ-TAMSA, we carry out comprehensive comparisons. Our results show that, for low-resolution quantization, performance gains as large as 0.3 dB can be obtained with the NUQ-TAMSA. Numerical results also show that, for a wide range of coding rates, 5-bits non-uniform quantization is sufficient for NUQ-TAMSA to approach the performances of the floating-point based TAMSA.

关键词： decoding Quantization (signal) Encoding Heuristic algorithms complexity theory Iterative decoding Mutual information low complexity decoding min-sum algorithm non-uniform quantization recursive block Markov superposition transmission (BMST) codes

来源：评论

学校读者我要写书评

暂无评论

Fast Essentially Maximum Likelihood decoding of the Golden Code

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第6期57卷 3537-3541页

作者： Sirinaunpiboon, Songsri Calderbank, A. Robert Howard, Stephen D. Def Sci & Technol Org Edinburgh 5111 Australia Princeton Univ Dept Elect Engn & Math Princeton NJ 08544 USA

The Golden code is a full-rate full-diversity space-time code which has been incorporated in the IEEE 802.16 (WiMAX) standard. The worst case complexity of a tree-based sphere decoder for a square QAM constellation is O(N-3), where N is the size of the underlying QAM constellation;the worst case will dominate average decoding complexity on any channel with a significant line of sight component. In this paper, we present a simple algorithm with quadratic complexity for decoding the Golden code that can be employed by mobile terminals with either one or two receive antennas, that is resilient to near singularity of the channel matrix, and that gives essentially maximum likelihood (ML) performance. Dual use is an advantage, since there will likely be some IEEE 802.16 mobile terminals with one receive antenna and some with two antennas. The key to the quadratic algorithm is a maximization of the likelihood function with respect to one of the pair of signal points conditioned on the other. This choice is made by comparing the determinants of two covariance matrices, and the underlying geometry of the Golden code guarantees that one of these choices is good with high probability.

关键词： Golden code low complexity decoding maximum likelihood decoding space-time codes

来源：评论

学校读者我要写书评

暂无评论

Simplified Symbol Flipping Algorithms for Nonbinary low-Density Parity-Check Codes

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2017年第10期65卷 4128-4137页

作者： Zhang, Jianyong Beijing Jiaotong Univ Inst Lightwave Technol Beijing 100044 Peoples R China Beijing Jiaotong Univ Key Lab All Opt Network Beijing 100044 Peoples R China Beijing Jiaotong Univ Adv Telecommun Network EMC Beijing 100044 Peoples R China

Based on the symbol-flipping algorithm with multiple-votes (MV-SF), this paper presents two simplified algorithms, symbol flipping with truncated and multiple votes (T-MV-SF) and symbol flipping with simplified and multiple votes (S-MV-SF), for nonbinary low-density parity-check (NB-LDPC) codes. Unlike previous symbol-flipping based algorithms (SFBAs), the T(S)-MV-SF uses the truncated voting information in each check and variable node update. The proposed algorithms also approximate the sorting function in each check update. Therefore, their complexity and memory consumption are remarkably reduced as compared with existing SFBAs. Furthermore, we introduce several parameters to compensate the information loss caused by the truncated voting information. After optimizing all the parameters, the proposed algorithms even have better performance than the MV-SF. As compared with the MV-SF, the maximum performance gain among all numerical examples is about 0.11 dB for the S-MV-SF on the (63, 37) code. The T-MV-SF has the largest reduction of the computational complexity on the (255, 175) code, which is about 80% of the complexity of the MV-SF. Moreover, the performance of the T-MV-SF is better than the MV-SF on the (255, 175) code. As a result, the proposed algorithms can effectively balance the error performance and complexity for decoding of NB-LDPCs.

关键词： low complexity decoding nonbinary LDPC codes symbol-reliability based algorithm truncated voting information

来源：评论

学校读者我要写书评

暂无评论

A New decoding Algorithm of Quasi-Orthogonal Space Time Block Codes

A New Decoding Algorithm of Quasi-Orthogonal Space Time Bloc...

引用

6th International Congress on Image and Signal Processing (CISP)

作者： Li, Zhengquan Qiu, Peipei Shen, Lianfeng Jin, Xiaoping China Jiliang Univ Coll Informat Engn Hangzhou 310018 Zhejiang Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Peoples R China

ISBN: (纸本)9781479927630

In order to ensure the bit error rate and reduce the complexity simultaneously, in this paper, we propose a quasi-orthogonal space-time block code (QO-STBC) decoding algorithm based on pairwise-minimum mean square error (pairwise-MMSE). The complexity of the proposed algorithm has nearly linear complexity, lower than that of the pairwise algorithm. Meanwhile, the bit error rate of the proposed algorithm is close to that of the traditional pairwise decoding algorithm, better than that of the existing zero force (ZF) algorithm, MMSE algorithm and pairwise-zero force (pairwise-ZF) algorithm.

关键词： QO-STBC low complexity decoding bit error rate pairwise-MMSE

来源：评论

学校读者我要写书评

暂无评论

Improved Spinal codes: A Segmented CRC-aided Scheme 90

Improved Spinal codes: A Segmented CRC-aided Scheme

引用

90th IEEE Vehicular Technology Conference (IEEE VTC-Fall)

作者： Zhang, Kai Li, Dongqing Wu, Shaohua Wang, Ye Jiao, Jian Zhang, Qinyu Harbin Inst Technol Shenzhen Shenzhen 518055 Peoples R China Peng Cheng Lab Res Ctr Networks & Commun Shenzhen Peoples R China

ISBN: (纸本)9781728112206

As a new type of rateless codes, Spinal codes can be proved in theory that it can achieve capacity over both the additive white Gaussian noise (AWGN) channel and the binary symmetric channel (BSC) with short message length. Due to the good adaptability under different channel conditions, Spinal codes have broad prospects in ultra-reliable low-latency communication (URLLC) scenarios such as self-driving car and factory automation. However, Spinal codes transmitted by short codes need frequent times of feedback, while transmitted by long codes have a high decoding complexity, which limits the practical application of Spinal codes. In this work, a new type of encoding scheme named as segmented CRC-aided scheme is proposed. In this scheme, message is equally divided into lambda segments, each of which is concatenated with a cyclic redundancy check (CRC) sequence. At the decoding end, all the segments are decoded in parallel, and the correspondingly CRC check results are collected and transmitted back to the encoder together. The encoder judges the current decoding state through the feedback and then constructs the next encoding pass accordingly. The segmented CRC-aided scheme combines the advantages of long codes transmission and short codes transmission of the Spinal codes, it uses fewer feedbacks, and it can reduce the transmission of redundance bits. Results demonstrate that the proposed scheme has significant performance improvement over the original Spinal encoding scheme by achieving higher code rate with lower encoding complexity.

关键词： Spinal codes low complexity decoding segmented CRC-aided scheme

来源：评论

学校读者我要写书评

暂无评论

Efficient Message Passing Scheduling for Terminated LDPC Convolutional Codes

Efficient Message Passing Scheduling for Terminated LDPC Con...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Lentmaier, Michael Prenda, Maria Mellado Fettweis, Gerhard P. Tech Univ Dresden Vodafone Chair Mobile Commun Syst D-01062 Dresden Germany

ISBN: (纸本)9781457705953

Message passing schedules that reduce the decoding complexity of terminated LDPC convolutional code ensembles are analyzed. Considering the AWGN channel, various schedules are compared by means of density evolution. The results of the analysis together with computer simulations for some (3,6)-regular codes confirm that sliding window decoding is an attractive practical solution for low-latency and low-complexity decoding.

关键词： AWGN channel AWGN channels Block codes complexity theory Convolutional codes decoding Message passing Parity check codes Schedules convolutional codes decoding decoding complexity reduction density evolution low complexity decoding low latency decoding message passing message passing scheduling parity check codes terminated LDPC convolutional codes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：