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

Joint Viterbi detection and decoding algorithm for bluetooth low energy systems

ELECTRONICS LETTERS 2020年第6期56卷 310-312页

作者： Park, Chulhyun Jung, Yongchul Kim, Jihoon Jung, Yunho Korea Aerosp Univ Sch Elect & Informat Engn Goyang Si 10540 Gyeonggi Do South Korea Ewha Womans Univ Dept Elect & Elect Engn Seoul 03760 South Korea

An efficient joint Viterbi detection and decoding (JVDD) algorithm for a bluetooth low energy (BLE) system is proposed. Since the convolutional coded Gaussian minimum-shift keying (GMSK) signal is specified in the BLE 5.0 standard, two Viterbi processors are needed for detection and decoding. However, the proposed JVDD scheme uses only one Viterbi processor by modifying the branch metric with inter-symbol interference information from GMSK modulation;therefore, the hardware complexity can be significantly reduced without performance degradation.

关键词： convolutional codes decoding Bluetooth intersymbol interference Viterbi detection minimum shift keying Viterbi decoding decoding algorithm bluetooth low energy system efficient joint Viterbi detection convolutional coded Gaussian minimum-shift keying signal BLE 5 Viterbi processor JVDD scheme

来源：评论

学校读者我要写书评

暂无评论

Gaussian Approximation Optimized SC-Flip decoding algorithm of Polar Codes 4

Gaussian Approximation Optimized SC-Flip Decoding Algorithm ...

引用

4th IEEE Information Technology, Networking, Electronic and Automation Control Conference (ITNEC)

作者： Li, Jianping Gao, Zhengqi Lv, Yansong Commun Univ China Sch Informat & Commun Engn Beijing Peoples R China

ISBN: (纸本)9781728143903

The polar codes proposed by Arikan is the first channel code proved to achieve the symmetric capacity of any binary input discrete memoryless channel (BDMC). Besides, the polar codes have been chosen for the eMBB control channels in the 5th generation mobile communication system. However, the successive cancellation flip (SCF) decoding algorithm of polar codes has a high average complexity at low SNR. To overcome the problem, the segmented SCF (SSCF) algorithm significantly has reduced the complexity of the SCF algorithm by using segmented cyclic redundancy check (CRC) bits. To further reduce the complexity, we have proposed a Gaussian approximation optimized SCF (G-SCF) decoding algorithm, which sets a threshold based on the Gaussian approximation algorithm to avoid unnecessary flip operations. Simulation results have shown that when the SNR is 1.5dB, the average complexity of the SSCF decoding algorithm is reduced by 14.4% compared with SSCF at (1024,512).

关键词： Polar codes decoding algorithm Gaussian approximation

来源：评论

学校读者我要写书评

暂无评论

An Improved Low Complex Offset Min-Sum Based decoding algorithm for LDPC Codes

引用

MOBILE NETWORKS & APPLICATIONS 2019年第6期24卷 1848-1852页

作者： Roberts, Michaelraj Kingston Mohanram, S. Sudha Shanmugasundaram, N. Sri Eshwar Coll Engn Dept Elect & Commun Engn Coimbatore 641202 Tamil Nadu India

In recent times, many advanced wireless communication systems have adopted channel coding schemes to ease secure transmission and reception of wireless data over noisy perturbed channel conditions. Channel coding approaches using low-density parity-check (LDPC) codes are most interesting and fastest growing research areas in the domain of wireless communications. Due to its widespread popularity, adaptability and parallelism for cost-effective hardware implementations, LDPC codes are widely endorsed in a number of wireless communication standards. Over the years, many low complex decoding algorithms using LDPC codes were introduced to improve the data reliability of many wireless applications. This work introduces an efficient and robust offset min-sum decoding scheme for optimal decoding of LDPC codes. This improved approach introduces a new offset correction factor to suppress the error propagation during the approximation of high precision soft values within the given range boundary of signal strength-to-background noise ratio (SNR). The experimental results illustrate the competitive advantage of the proposed algorithm over several popular algorithms in terms of error rate performance, complexity reductions and convergence speed.

关键词： LDPC codes Wireless communication decoding algorithm Channel coding Computational complexity

来源：评论

学校读者我要写书评

暂无评论

A Configurable Approximation Min-Sum decoding algorithm for Low Density Parity Check Codes 2019

A Configurable Approximation Min-Sum Decoding Algorithm for ...

引用

9th International Conference on Information Communication and Management (ICICM)

作者： Wu, Ruizhen Wang, Lin Wang, Mingming Intel Mobile Commun Technol Xian Ltd Xian Peoples R China

ISBN: (纸本)9781450371889

A configurable approximation Min-sum decoding algorithm for LDPC is proposed in this paper. The degradation factor of BP to MS is found and optimized based on Jacobian Logarithm and hardware working mode. The decoding algorithm is configurable to satisfy different environment's need and will only need update the variable memory. The simulation is based on LDPC NR 3GPP 38.212 release and the comparison results showed the proposed configurable approximation Min-sum decoding algorithm have a better BER performance. The hardware of this proposed algorithm is based on Min-sum decoder and the extra cost is only a shifter and an adder besides the configurable memory.

关键词： LDPC Min-Sum decoding algorithm Approximation

来源：评论

学校读者我要写书评

暂无评论

On the Fly Belief Propagation decoding algorithm for LT Codes 6th

On the Fly Belief Propagation Decoding Algorithm for LT Code...

引用

6th International Conference on Communications, Signal Processing, and Systems (ICCSPS)

作者： Suo, Longlong Zhang, Gengxin Bian, Dongmin Lv, Jing Chen, Haiping Liu, Zijun PLA Univ Sci & Technol Nanjing Jiangsu Peoples R China Nanjing Univ Posts & Telecommun Nanjing Jiangsu Peoples R China Chongqing Commun Inst Chongqing Peoples R China First Engineers Sci Res Inst Wuxi Peoples R China

ISBN: (纸本)9789811065712;9789811065705

As the first realisation of Fountain Codes, Luby Transform (LT) codes provide high reliability and scalability and low complexities for data transmission in networks. Two basic algorithms, Belief Propagation (BP) and Gaussian Elimination (GE), were introduced to decode LT codes. However, both of them execute their decoding process only after all the encoded symbols have been received by decoder, which results in the waste of time, storage space and computing resource. In this paper, an improved decoding algorithm termed on the fly belief propagation (OFBP) for LT codes is proposed. Based on the BP algorithm, OFBP performs the decoding processing once each encoded symbol arrives thus distributing the decoding work during all symbols reception. Compared with the traditional BP algorithm, the actual decoding time of the proposed algorithm is highly shortened. Moreover, without processing all the encoded symbols, the actual storage space and decoding complexity are greatly reduced while maintaining the same performance relative to the traditional BP decoding scheme.

关键词： Fountain codes LT codes Belief Propagation On the fly decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Inplementation of PCM Coding and decoding algorithm Based on C Language

Inplementation of PCM Coding and Decoding Algorithm Based on...

引用

Advanced Electronic Materials, Computers and Software Engineering (AEMCSE), International Conference on

作者： Yue Wang Zhenyu Wang Xiaozhuo Li Jianghuan Xie Kai Qu Kunming University of Science and Technology Kunming China Xi'an University of posts and Telecommunications Xi'an China North Western University Xi'an China

ISBN: (数字)9781728181431

ISBN: (纸本)9781728181448

In order to solve the problem that the A-law 13 polyline coding algorithm lacks a specific programming language simulation, C language is used to implement the algorithm in this paper. First, the polar code is obtained according to the positive and negative sample values. Then the paragraph code and the inner code are obtained and finally decoded. Experimental results show that the program can realize A-law 13 polyline encoding and decoding, and for a given sample value, it can obtain its 8-bit encoding. Compared with the bit-wise encoding method, the program is more efficient.

关键词： PCM coding C language C language decoding algorithm coding Pulse code modulation Broken line decoding

来源：评论

学校读者我要写书评

暂无评论

Efficient encoding and decoding algorithm for triangular discrete global grid based on Hybrid Transformation Strategy

引用

COMPUTERS ENVIRONMENT AND URBAN SYSTEMS 2018年 68卷 110-120页

作者： Zhou, Liangchen Lian, Wenjie Lv, Guonian Zhu, A-Xing Lin, Bingxian Nanjing Normal Univ Minist Educ Key Lab Virtual Geog Environm Nanjing 210023 Jiangsu Peoples R China State Key Lab Cultivat Base Geog Environm Evolut Nanjing 210023 Jiangsu Peoples R China Jiangsu Ctr Collaborat Innovat Geog Informat Reso Nanjing 210023 Jiangsu Peoples R China Univ Wisconsin Madison Deportment Geog Madison WI 53706 USA

Grid codes are an important part of a grid system and provide a unique identifier for the cells in the spherical triangular discrete global grid, where the transformation between geographic coordinates and grid codes is the basis of global spatial data integration and various analytical applications. Owing to the particularity of the topological properties, the spherical space cannot be continuously paved with the same grid cells as those in the plane space. Thus, the recursive approximation method is typically used to establish the transformation algorithm between the geographic coordinates and the grid codes. The efficiency of those algorithms that were based on recursive approximation obviously decreased with the increased grid subdivision level;thus, it is not conducive to the integration of massive high-resolution spatial data. Whereas the geometric properties of the grid cells in the spherical triangular discrete global grid differ during the initial subdivision levels, as the level increases, these geometric properties tend to be the same, along with the properties of the local regions similar to the plane. Considering this characteristic, this paper proposes a hybrid bidirectional transformation algorithm. In the proposed algorithm, the recursive approximation method is used at the lower level where there is a large difference in the geometrical properties of the grid cells, and the direct mapping method using a similar plane grid is used at the higher level where the geometrical properties of the grid cells are virtually the same. In experiments conducted using the proposed algorithm with geographic coordinates at different scales and grid codes at different levels, the running time remained stable with no significant change throughout increases in the hierarchical level. Further, it was proven to satisfy the requirements of the absolute accuracy evaluation method. Compared with the traditional recursive approximation algorithm, the proposed algorithm has o

关键词： decoding algorithm Encoding algorithm Discrete global grid Icosahedron Triangular discrete global grid

来源：评论

学校读者我要写书评

暂无评论

An Improved decoding algorithm Based on Min-max for NB-LDPC Codes 36

An Improved Decoding Algorithm Based on Min-max for NB-LDPC ...

引用

第36届中国控制会议

作者： Mengzhu Chen Jin Xu Jun Xu Danfeng Zhao Jiahui Meng Wireless Technology preresearch Team ZTE Corporation College of Information and Communication Engineering Harbin Engineering University

ISBN: (纸本)9781538629185

When the code length is moderate,non-binary low-density parity-check（NB-LDPC） codes can achieve better error correcting performance than their binary counterparts at the expense of higher decoding *** check node processing is a major bottleneck of NB-LDPC *** this paper,Min-max decoding algorithm is proposed based on a new forward backward processing method of check nodes,select only a part of the most reliable information to the forward-backward calculation process,and change the variable nodes to check nodes（v-to-c） generation of *** this algorithm,a kind of code（768,1152） defined on GF（4） is simulated and compared with belief propagation in log domain（LOG-BP） decoding *** results show Min-max decoding algorithm reduce information storage requirements and the computational complexity,conducive to engineering implementation.

关键词： non-binary low density parity check codes Min-max decoding algorithm check nodes

来源：评论

学校读者我要写书评

暂无评论

An optimal decoding algorithm for Molecular Communications systems with noise, memory, and pulse width

引用

NANO COMMUNICATION NETWORKS 2016年 9卷 7-16页

作者： Wang, Xiayang Lu, Yi Higgins, Matthew D. Leeson, Mark S. Univ Warwick Sch Engn Coventry CV4 7AL W Midlands England Univ Warwick WMG Coventry CV4 7AL W Midlands England

Molecular Communications (MC) is a promising paradigm to achieve message exchange between nano-machines. Due to the specific characteristics of MC systems, the channel noise and memory significantly influence the MC system performance. Aiming to mitigate the impact of these two factors, an adaptive decoding algorithm is proposed by optimising the symbol determination threshold. In this paper, this novel decoding scheme is deployed onto a concentration-based MC system with the transmitter emission process considered. To evaluate the performance, an information theoretical approach is developed to derive the Bit Error Rate (BER) and the channel capacity. Simulations are also carried out to verify the accuracy of these formulations, to compare the performance difference against other decoding schemes, and to illustrate the performance deviation caused by different designing of relevant parameters. Furthermore, the performance of MC systems with the distance unknown is also analysed. Comparisons between distance-pre-known and distance-unknown systems are provided. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Molecular Communications Molecule concentration decoding algorithm Bit Error Rate Capacity

来源：评论

学校读者我要写书评

暂无评论

Correcting capabilities of binary irregular LDPC code under low-complexity iterative decoding algorithm

引用

JOURNAL OF COMMUNICATIONS TECHNOLOGY AND ELECTRONICS 2016年第12期61卷 1432-1439页

作者： Rybin, P. S. Russian Acad Sci Kharkevich Inst Informat Transmiss Problems Moscow 127051 Russia

This paper deals with the irregular binary low-density parity-check (LDPC) codes and two iterative low-complexity decoding algorithms. The first one is the majority error-correcting decoding algorithm, and the second one is iterative erasure-correcting decoding algorithm. The lower bounds on correcting capabilities (the guaranteed corrected error and erasure fraction respectively) of irregular LDPC code under decoding (error and erasure correcting respectively) algorithms with low-complexity were represented. These lower bounds were obtained as a result of analysis of Tanner graph representation of irregular LDPC code. The numerical results, obtained at the end of the paper for proposed lower-bounds achieved similar results for the previously known best lower-bounds for regular LDPC codes and were represented for the first time for the irregular LDPC codes.

关键词： LDPC code irregular binary decoding algorithm iterative low-complexity errors erasures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：