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...
详细信息
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.
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 cont...
详细信息
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).
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 appr...
详细信息
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.
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...
详细信息
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.
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 ...
详细信息
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.
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 obtaine...
详细信息
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.
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 ...
详细信息
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
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 pro...
详细信息
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.
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 s...
详细信息
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.
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 ...
详细信息
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.
暂无评论