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.
In the tornado code, cascading with traditional erasure codes (mostly Reed-Solomon codes) is always used to protect the last level, which will enhance the erasure correcting performance. However, this method increases the complexity in the process of encoding and decoding. In this paper, we introduce an improved algorithm to get linear coding complexity and simplify the implementation of decoder in...
Fractal image coding technique is considered as very effective for a higher compression ratio. Despite this method had received much attention because of its high resolution and fast decoding and many other advantages, but it has not been used widely because it requires high computation time for the encoding process. This defect is considered as one of the drawbacks of fractal image coding technique...
The decoding performance of polar codes strongly depends on the decoding algorithm used, while also the decoder throughput and its latency mainly depend on the decoding algorithm. In this work, we implement the powerful successive cancellation list (SCL) decoder on a GPU and identify the bottlenecks of this algorithm with respect to parallel computing and its difficulties. The inherent serial decoding...
C-RAN! (C-RAN!) is a new paradigm for wireless networks that centralizes the signal processing in a computing cloud, allowing commodity computational resources to be pooled. While C-RAN improves utilization and efficiency, the computational load occasionally exceeds the available resources, creating a computational outage. This paper provides a mathematical characterization of the computational outage...
Error concealment (EC) is one of the target applications of inpainting techniques. Some methods combine the estimated lost motion vectors (MVs) with the exemplar-based inpainting technique to recover the lost regions. Due to the erroneous motion vectors that might indicate a moving object as background object and vice versa, these methods are still showing visual artifacts in the recovered regions...
In an energy-efficient receiver employing iterative decoders, phase synchronization errors reduce much of the gains that can be achieved at low SNRs. To address this problem, the concept of an iterative receiver has received much attention in the past. In such a framework, signal degradation at low SNR is overcome by repeated phase synchronization executed over the soft symbols generated by the iterative...
Spinal codes are a recently proposed capacity-achieving rateless code. While hardware encoding of spinal codes is straightforward, the design of an efficient, high-speed hardware decoder poses significant challenges. We present the first such decoder. By relaxing data dependencies inherent in the classic M-algorithm decoder, we obtain area and throughput competitive with 3GPP turbo codes as well as...
Detection of defective items from a colossal number of items, commonly referred to as "Group Testing", has been widely studied because of its promising applications in various fields. To detect at most d defective items from N items, a subset of N items is formed into a test and tested. If the total number of tests needed is t, a set of t tests can be seen as a t × N measurement matrix,...
In this paper, we solve the optimizing problem of designing Low-Density Parity Check codes for two parallel erasure links based on the known SDP approach. We show that our reformulation is suitable for this optimizing problem. Our results show that the optimal rate code design problem is a good way and worth-mentioning tool. One can extend our work to the other area.
Binary AIFV (almost instantaneous fixed-to-variable length) codes, which uses two code trees, can attain better compression rates than binary Huffman codes. Although the optimal binary AIFV codes can be constructed by combining an iterative algorithm to improve a parameter and an integer programming (IP) to derive the optimal code trees for a given parameter, the complexity of the IP problem is NP...
This paper proposes a low-complexity high performance soft-in hard-out decoding algorithm for Reed-Solomon (RS) codes. The Guruswami-Sudan (GS) algebraic list decoding algorithm can correct errors beyond half the distance bound by performing a curve-fitting decoding process. However, its extra error-correction capability is exchanged with a high computational cost which is dominated by the interpolation...
This paper presents an energy evaluation of the HEVC decoding process considering different encoding configurations in order to provide support for efficient encoding-for-decoding solutions. The analysis evaluates the energy impact of changing the configuration of four encoding tools in the HEVC decoding process. A set of six different configurations are used to encode/decode video sequences in order...
In this paper, a low complexity MIMO detection is proposed for MIMO-Constant Envelope Modulation (MIMO-CEM) transceiver system. In which, an adaptive sphere decoder (SD) based on an affine linear transformation model is proposed to adaptively select a small number of candidate sequences from all lattice states. Then, the more accurate (the more complex) IF based maximum likelihood MIMO-CEM decoder...
In massive MIMO systems, multiple high-speed high-resolution ADCs will be a major obstacle for real applications because of the hardware complexity and power consumption. One solution to this problem is to adopt low-cost low-resolution ADCs instead. Note that highly quantized signals will destroy the orthogonality of OFDM design, the key point remains to find computational decoding methods while maintaining...
The normal operation of many cyberphysical, biological, and neural systems fit naturally with robust control, with key variables like lane positions, voltages, temperatures, blood pressures, etc maintained within tight bounds despite diverse uncertainties. However, two challenges in particularly need further theory that this paper addresses. One is that control is distributed with communication having...
This paper proposes an area efficient and low power Reed-Solomon (RS) decoder. The proposed decoder is designed using eight stage arithmetic pipelined architecture. The pipelined architecture of RS decoder performs the detection of error locator from the input stream and computes the error magnitude polynomial using the Berleykamp Massey's algorithm. The evaluation of error locator and computation...
LDPC convolutional codes (LDPC-CC) are a family of error-correcting codes (ECC) used in digital communication systems like the IEEE 1901 standard. High throughput and low complexity hardware architectures were designed for real time systems. In this article we demonstrate that an efficient selection of the message passing (MP) algorithm for LDPC-CC decoding improves the architecture features of related...
Polar codes under cyclic redundancy check-aided successive cancellation list (CA-SCL) decoding can outperform the turbo codes and the LDPC codes at the cost of high complexity and decoding delay. In order to reduce the decoding complexity, in this paper we propose a hybrid parity-check and CRC aided SCL decoding scheme for polar codes. Simulation results under the binary input additive white Gaussian...
With the enormous amount of data generated through the internet and sensors, Internet of Things, it becomes too overwhelming for humans to examine it all. One solution is to reduce the data to a set of statistics. The perspective in this paper is the opposite, namely that most of this data is just background noise, and the interesting parts are those that deviate from background noise, the parts that...
Abstract-We consider the problem of designing constellation sets for multistage systems for high spectral efficiencies. In particular we will focus on two-stage systems where the cascaded decoding stages are associated to three types of receivers with different complexities and performances. The optimal receiver (S) processes the symbol LLR and delivers the maximum possible throughput, the simpler...
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.