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

Performance Comparison of List Viterbi Algorithm of tail-biting convolutional code for Future Machine Type Communications

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2017年第8期E100B卷 1293-1300页

作者： Bushisue, Shunichi Suyama, Satoshi Nagata, Satoshi Miki, Nobuhiko Kagawa Univ Takamatsu Kagawa 7610396 Japan NTT DOCOMO INC Yokosuka Kanagawa 2398536 Japan

In the future, 5G radio access and support for the internet of things (IoT) is becoming more important, which is called machine type communications. Different from current mobile communication systems, machine type communications generates relatively small packets. In order to support such small packets with high reliability, channel coding techniques are inevitable. One of the most effective channel codes in such conditions is the tail-biting convolutional code, since it is used in LTE systems due to its good performance for small packet sizes. By employing a list Viterbi algorithm for the tail-biting convolutional code, the block error rate (BLER) performances is further improved. Therefore, this paper evaluates the BLER performances of several list Viterbi algorithms, i.e., circular parallel list Viterbi algorithm (CPLVA), per stage CPLVA (PSCPLVA), and successive state and sequence estimation (SSSE). In the evaluation, computational complexity is also taken into account. It is shown that the performance of the CPLVA is better in the wide range of computational complexity defined in this paper.

关键词： machine type communications tail-biting convolutional code list viterbi algorithm

来源：评论

学校读者我要写书评

暂无评论

Design of Serially Concatenated tail-biting convolutional code With Index Modulation

引用

IEEE COMMUNICATIONS LETTERS 2024年第5期28卷 979-983页

作者： Dong, Chao Cai, Yuekai Zhang, Zhengzhen Niu, Kai Zhang, Ping Beijing Univ Posts & Telecommun Key Lab Universal Wireless Commun Minist Educ Beijing 100876 Peoples R China Beijing Union Univ Smart City Coll Beijing 100024 Peoples R China

The transmission characterized by ultra reliable and low latency requirements presents a significant challenge in the future networks, leading to an increasing interest in powerful short channel codes. In this letter, we consider the concatenation of a tail-biting convolutional code (TBCC) with an index modulation (IM) mapper as a promising scheme. Bit-interleaved coded modulation with iterative decoding (BICM-ID) is employed in the TBCC-IM and a modified IM mapping arrangement is developed to improve the error-correction performance. Experimental results show that the implemented TBCC-IM scheme can nearly approach the random coding union (RCU) bound with reasonable complexity.

关键词： tail-biting convolutional code index modulation bit-interleaved coded modulation symbol mapping

来源：评论

学校读者我要写书评

暂无评论

tail biting convolutional code Decoder Co-processor for High Throughput System-on-Chip 12

Tail Biting Convolutional Code Decoder Co-processor for High...

引用

International System-on-Chip (SoC) Design Conference

作者： Ramdani, Ahmad Zaky Adiono, Trio Inst Teknol Bandung Sch Elect Engn & Informat Bandung Indonesia

ISBN: (纸本)9781467393089

In this paper proposed tail biting convolutional code decoder co-processor architecture design for high throughput AMBA bus based System on Chip. Proposed TBCC decoderconfigured for LTE applicationand integrated on Leon3 SoC. To support low complexity, reverse trellis algorithm choose as TBCC decoding algorithm. DMA used in integration process to ensure the inter-frame decoding process is continuous and uninterrupted. The coprocessor designs have been tested on a Altera Stratix IV, achieving a throughput of 221 Mbps.

关键词： tail-biting convolutional code System-on-Chip AMBA Bus LTE

来源：评论

学校读者我要写书评

暂无评论

A Novel Algorithm of tail biting convolutional code Decoder for Low Cost Hardware Implementation

A Novel Algorithm of Tail Biting Convolutional Code Decoder ...

引用

International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)

作者： Ramdani, Ahmad Zaky Adiono, Trio Inst Teknol Bandung Ctr Microelect Bandung Indonesia

ISBN: (纸本)9781467364997

tail-biting convolutional codes (TBCC) have been applied in many recent modern communication standards such as LTE and WIMAX. TBCC is a method applied in conventional convolutional code by replacing a fixed zero-tail with tail-biting data constrains to achieve a better coding efficiency. This modification makes the decoding process becomes much more complex. Due to impracticality of the optimum decoding algorithm such as brute force, recently some suboptimum algorithms have been developed but it still leaves a large amount of computation due to the iterative nature wherein the number of iterations depends on the received codeword causes inefficient system for implementation, especially for real time applications. In this paper we offer a new algorithm that is specific to low cost hardware implementation. Low cost criteria are addressed to minimum amount of computation for each decoding process. In addition to causing smaller area consumption, the lack of computing process will also make decoding processing time becomes faster. This algorithm that we call reverse trellis algorithm also offers a fixed amount of computation regardless to the received codeword, thus will not require extra memory consumption as it being on an implementation. Taking a case study on TBCC configuration for LTE, proposed algorithm requires 5712 adding operations and 3008 inverting operations. A significant decrease compared to 286736, adding 143360 inverting for Brute Force and 45079976738816 adding 1099511627776 inverting for all possible fixed tail ML decoder. In the performance of BER, reverse trellis algorithm is able to deliver improved by more than 1 dB compared to direct terminating ML decoder.

关键词： ML decoder tail-biting convolutional code bidirectional decoding low cost implementation

来源：评论

学校读者我要写书评

暂无评论

Minimum decoding trellis lengths for tail-biting convolutional codes

引用

ELECTRONICS LETTERS 2000年第7期36卷 643-645页

作者： Sung, WJ Hughes Network Syst Wireless Network Div Germantown MD 20876 USA

Circular decoding is a simple decoding algorithm for tail-biting convolutional codes that essentially achieves maximum-likelihood decoding performance. An investigation into the minimum required length of the decoding... 详细信息

关键词： minimum decoding trellis length codes tail-biting convolutional code trellis codes convolutional codes maximum-likelihood decoding maximum likelihood decoding circular decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

LOW-POWER PRE-DECODING BASED VITERBI DEcodeR FOR tail-biting convolutional codeS

LOW-POWER PRE-DECODING BASED VITERBI DECODER FOR TAIL-BITING...

引用

IEEE Workshop on Signal Processing Systems (SiPS 2009)

作者： Abdallah, Rami A. Lee, Seok-Jun Goel, Manish Shanbhag, Naresh R. Univ Illinois ECE Dept Coordinated Sci Lab Urbana IL 61801 USA Digital Signal Proc Solut R&D Ctr Commun & Med Syst Lab Dallas TX USA

ISBN: (纸本)9781424443345

Low-power and high-throughput Viterbi decoder (VD) for tail-biting convolutional codes is presented in this paper. First, a low complexity radix-4 VD with enhanced decoding features such as end-state forcing and best-state trace back is presented. Second, simple pre-decoding is proposed to decrease the runtime of VD, resulting in significant power saving. The design is implemented in 0.9 V TI 45-nm CMOS process at 100 MHz for long Term Evolution (LTE) [1] as application. More than 90% power saving is achieved with predecoding at a throughput of 120 Mbps and 0.2 dB SNR loss for 10(-5) frame error rate.

关键词： Viterbi Decoder Long Term Evolution Add-Compare-Selcct Trellis Decoding tail-biting convolutional code

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Shaping for Trellis-coded Modulation With CRC-Aided List Decoding

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2023年第3期71卷 1271-1283页

作者： Wang, Linfang Song, Dan Areces, Felipe Wiegart, Thomas Wesel, Richard D. Univ Calif Los Angeles Dept Elec & Comp Engn Los Angeles CA 90095 USA Stanford Univ Dept Elect Engn Stanford CA 94305 USA Tech Univ Munich TUM Inst Commun Engn D-80333 Munich Germany

This paper applies probabilistic amplitude shaping (PAS) to cyclic redundancy check (CRC)-aided tail-biting trellis-coded modulation (TCM). CRC-TCM-PAS produces practical codes for short block lengths on the additive white Gaussian noise (AWGN) channel. In the transmitter, equally likely message bits are encoded by a distribution matcher (DM) generating amplitude symbols with a desired distribution. A CRC is appended to the sequence of amplitude symbols, and this sequence is then encoded and modulated by TCM to produce real-valued channel input signals. This paper proves that the sign values produced by the TCM are asymptotically equally likely to be positive or negative. The CRC-TCM-PAS scheme can thus generate channel input symbols with a symmetric capacity-approaching probability mass function. The paper provides an analytical upper bound on the frame error rate of the CRC-TCM-PAS system over the AWGN channel. This FER upper bound is the objective function used for jointly optimizing the CRC and convolutional code. Additionally, this paper proposes a multi-composition DM, which is a collection of multiple constant-composition DMs. The optimized CRC-TCM-PAS systems achieve frame error rates below the random coding union (RCU) bound in AWGN and outperform the short-blocklength PAS systems with various other forward error correction codes studied in Coskun et al. (2019).

关键词： Reliable communication short blocklength probabilistic shaping trellis-coded modulation tail-biting convolutional code CRC list decoding distribution matcher

来源：评论

学校读者我要写书评

暂无评论

Efficient coding schemes for low-rate wireless personal area networks

引用

IET COMMUNICATIONS 2016年第8期10卷 915-921页

作者： Qian, Hua Dai, Shengchen Kang, Kai Wang, Xudong Chinese Acad Sci SIMIT Shanghai Peoples R China Chinese Acad Sci Key Lab Wireless Sensor Network & Commun Shanghai Peoples R China Chinese Acad Sci SARI Shanghai Peoples R China Shanghai Res Ctr Wireless Commun Shanghai Peoples R China Shanghai Jiao Tong Univ Univ Michigan Shanghai Jiao Tong Univ Joint Inst Shanghai 200030 Peoples R China

The emerging market of Internet of things has created great demand for low-cost, low-power wireless technologies. Existing IEEE 802.15.4 standard is designed for low-rate wireless personal area networks (LR-WPANs). However, current standard does not fully utilise the benefit of the code redundancy. In this study, the authors propose new coding schemes for LR-WPANs with improved coding gain. They first propose a block code based on extended Bose-Chaudhuri-Hocquenghem (BCH) code that increases the minimum Hamming distance compared with the existing code used in LR-WPANs. The computational complexity of the encoder and decoder remains about the same. In addition, by applying the extended BCH code directly to LR-WPANs, the data rate of the system can be increased without sacrificing coding performance. They further propose a tail-biting convolutional (TBC) code with optimum generator polynomials for LR-WPANs. The proposed TBC code enjoys significant performance improvement while preserving the effective code rate as well as a low decoding complexity. Simulation results validate the effectiveness of the proposed coding schemes.

关键词： personal area networks BCH codes Internet of Things efficient coding schemes low-rate wireless personal area networks Internet of things LR-WPAN improved coding gain extended Bose-Chaudhuri-Hocquenghem code BCH code minimum Hamming distance computational complexity tail-biting convolutional code low decoding complexity

来源：评论

学校读者我要写书评

暂无评论

A unified design of channel coding for LTE uplink control information

引用

WIRELESS NETWORKS 2015年第5期21卷 1661-1667页

作者： Yang, Wei Zhang, Linyuan Yang, Zhenhua Xu, Changlong Kim, Young-Il Beijing Jiaotong Univ Sch Elect & Informat Engn Beijing 100044 Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Peoples R China Elect & Telecommun Res Inst Wireless Syst Res Grp Taejon 350350 South Korea

There are three kinds of channel coding schemes for uplink control information (UCI) with different sizes in long term evolution (LTE) system: the block codes with length of 20 and 30 bits as well as tail-biting convolutional code (TBCC) with rate of 1/3. To reduce complexity, a unified design of 1/5 TBCC using two-level puncture is proposed for all different sizes of UCI in this paper. Compared with LTE design, the proposed design is much simpler since there is only one channel encoding scheme in user equipment (UE) and only one decoding algorithm in base station. In addition, the first three generators of the proposed 1/5 TBCC are the same as that of the TBCC in LTE, thus the proposed design is backwards compatible with the original design in LTE. Simulation results show that the frame error rate performance of the proposed two-level punctured TBCC is close to or even better than that of the original block codes with lower decoding complexity.

关键词： Long term evolution (LTE) Channel coding Block codes tail-biting convolutional code

来源：评论

学校读者我要写书评

暂无评论

Achieving Short-Blocklength RCU Bound via CRC List Decoding of TCM with Probabilistic Shaping

Achieving Short-Blocklength RCU Bound via CRC List Decoding ...

引用

IEEE International Conference on Communications (ICC)

作者： Wang, Linfang Song, Dan Areces, Felipe Wesel, Richard D. Univ Calif Los Angeles Los Angeles CA 90095 USA

ISBN: (数字)9781538683477

ISBN: (纸本)9781538683477

This paper applies probabilistic amplitude shaping (PAS) to a cyclic redundancy check (CRC) aided trellis coded modulation (TCM) to achieve the short-blocklength random coding union (RCU) bound. In the transmitter, the equally likely message bits are first encoded by a distribution matcher to generate amplitude symbols with the desired distribution. The binary representations of the distribution matcher outputs are then encoded by a CRC code. Finally, the CRC-encoded bits are encoded and modulated by Ungerboeck's TCM scheme, which consists of a systematic k(0)/k(0)+1 tail-biting convolutional code and a mapping function that maps coded bits to channel signals with capacity-achieving distribution. This paper proves that, for the proposed transmitter, the CRC bits have uniform distribution and that the channel inputs have symmetric distribution. In the receiver, the serial list Viterbi decoding (S-LVD) is used to estimate the information bits. Simulation results show that, for the proposed CRC-TCM-PAS system with 87 input bits and 6567 8-AM coded output symbols, the decoding performance under additive white Gaussian noise channel achieves the RCU bound with properly designed CRC and convolutional codes.

关键词： Probabilistic amplitude shaping Trellis coded modulation tail-biting convolutional code List decoding Short blocklength

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：