The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Non-orthogonal multiple access as a promising technology is expected to support massive connectivity in the next generation. In this paper, we propose a novel perfect energy spread transform (P-EST) based multiple access scheme, which perfectly spreads a symbol energy all over the frequency-domain and time-domain increasing the diversity gain of the system. The parameters of the proposed scheme can...
Check node processing dominates the complexity of nonbinary LDPC decoding. Trellis based min-max algorithm[1] can reduce the computation complexity and generate the message from check node to variable node in parallel. In this paper, power representation is used to implement check node processor, adder structures over GF(q) using power representation in trellis based check node processing are proposed...
In this paper, we propose the encoding and list decoding method of polar codes based on the four-dimensional Reed-Solomon (RS-4) kernel. In specific, an encoding table based method is employed to reduce the computational complexity of both encoder and decoder. In addition, a simplified method to update log-likelihood ratios (LLRs) which employs additions instead of exponential calculations is also...
Block diagonalization (BD) is a famous conditional precoding algorithm in multi-input multi-output (MIMO) broadcast systems, vector perturbation (VP) and BD are combined which named as BD-VP for short and the receivers' complexity can be reduced by VP at the transmmiter. Furthermore, the performance of BD-VP in diversity is comparable because the maximum likehood (ML) method is involved. However,...
The systematic polar codes under successive cancellation list (SCL) decoding suffers from very high time and space complexity when list size becomes larger. Aimed at getting the tradeoff between error performance and algorithm complexity, a practical CRCs-ADSCL(Adaptive SCL) decoding scheme is proposed for systematic polar codes, in which CRC values will be held by the bit-pair arrays in the decoding...
In this paper, we propose a new space-time block coding scheme to mitigate the effect of pilot contamination in multi-cell, massive Multiple-Input Multiple-Output (MIMO) systems. We derive the code design criterion and give some code design examples. Moreover, we present a new decoding method based on an oblique projection, which has a low decoding complexity. Simulation results show that our coding...
Non-orthogonal multiple access (NOMA), which improves spectrum efficiency and system throughput, is one of the promising radio access techniques for 5G. In this paper, NOMA is combined with spatial multiplexing multiple-input multiple-output (MIMO) technology for enhanced spectral efficiency. In multi-stream MIMO signaling, we considered stronger far user's MIMO signal when detecting the near user's...
Fractional pixel interpolation for motion compensation is considered among the most computational consuming areas in High Efficiency Video Coding (HEVC). An efficient design and optimized hardware implementation for HEVC motion compensation are presented. This architecture is implemented for 8K HEVC decoder. A new scaling factor for interpolation filter and a modified number of Luma filter taps are...
it is known that the more reliable LDPC code is the longer code, and it is also known that LDPC decoders with flooded architecture which allow parallel processing can achieve high throughputs. But, just architectures become very complex and require more hardware resources when the code length is large and random, so achieving a high error correction rate on short code lengths is considered a challenge...
High efficiency Video Coding (HEVC) uses advanced compression techniques that H.264/AVC don't use. These algorithmic techniques achieve about 50 percent of average bit-rate reduction compared to H.264/AVC. In this paper, we present the low complexity HEVC decoder structure suitable for our HEVC encoder. The proposed slim - HEVC decoder is compliant with HM 10.0 which is developed during standardization...
In this paper, a hardware-efficient folded SC polar decoder based on k-segment decomposition is first proposed. The proposed k-segment scheme employs (k – 1) N1/k-bit decoders to implement the original N-bit decoder, and reduces the number of mixed-nodes from (N – 1) to (k ă 1)( N1/k – 1) with slightly increased latency. In addition, pipelining technique, partial parallel processing, and pre-computation...
This paper exposes a new decoder for linear bloc codes. The proposed decoder is based on the resolution of the parity equations system. Elsewhere, to reduce its complexity we have developed a criteria for early terminating the decoding, on the one hand. On the other hand, we introduced a fast method for generating test error patterns. Our decoder is suitable for linear bloc code of medium and high...
Non-binary One Step Majority Logic decodable (OSMLD) codes have several advantages over their binary counterparts but unfortunately their decoding complexity is significantly challenging. In this paper, we propose two contributions. Our first contribution is to use the Majority-Logic Decoding (MLGD) algorithm for non-binary cyclic OSMLD codes, since it involves only finite field addition and multiplication,...
The compact genetic algorithm cGA is used in this paper to design an efficient soft-decision decoding algorithm, especially for the cyclic codes, because the cGA dramatically reduces the population's size and rapidly converges to the optimal solution compared to classical genetic algorithms. Our main contribution is to exploit the cyclic property of cyclic linear codes to reduce the complexity of...
This paper investigates the construction and iterative threshold decoding of low rate Quasi-Cyclic One Step Majority logic codes based on combinatorial designs. These codes are constructed with two type of difference family: cyclic disjoint difference sets and cyclic disjoint difference family. They can be encoded with low complexity, and perform very well when decoded with the Iterative threshold...
A new Goldreich-Goldwasser-Halevi (GGH) cryptosystem is proposed using Generalized Low Density (GLD) lattices. These low density lattices can alleviate a major drawback of the GGH scheme, namely the huge size of its public key. Indeed, we show that the new GGH that we propose in this paper reduces the key size by one order of magnitude. In addition, we show that the key generation complexity as well...
We show that a joint iterative detection and decoding algorithm with spatially-coupled (SC) LDPC codes achieves excellent performance in 100Gbps 16-QAM optical systems with high phase noise. We also demonstrate that complexity and latency of JIDD can be significantly reduced by using SC-LDPC.
As the flash memory continues its capacity scaling and correspondingly decreases its reliability, a technology upgrade regarding the error-correction engine in state-of-art solid-state drives (SSDs) is intensely expected. Due to their limit-approaching decoding ability, low-density parity-check (LDPC) codes are seen as one of the most promising substitute for the traditional BCH codes, though implementation...
Recently, polar codes have received much attention due to their simple structure and low decoding complexity. However, because of the long decoding latency, polar codes are still not suitable for real-time applications. In this paper, by the analysis of the position of frozen bits and the architecture of conventional SC decoder, we present an efficient SC decoder architecture. Using the proposed architecture,...
Polar codes have recently become increasingly popular due to their simple structure and low decoding complexity. However, polar codes are still not suitable for real-time applications because of the long decoding latency. In this paper, by analysis of the conventional architecture of SC decoder, a low latency SC decoder architecture is proposed. Using the proposed architecture, the decoding latency...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.