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 this paper, the successive cancellation (SC) heap polar decoding scheme is firstly proposed to reduce the complexity. Unlike SC list decoder which keeps same length paths, SC heap decoding stores different length paths in a heap and always decodes the global optimal path in the root. It has been strictly proved that SC heap decoding is superior to SC stack decoding because the time complexity...
Coded packet networks allow for proactive injection of redundant packets to compensate for packet loss. Link metrics are usually based on the estimated transmission counter (ETX). This metric is used to determine the expected number of coded packets needed, but does not make guarantees for a specific decoding probability. In this paper we show that relying on the ETX metric leads to a surprisingly...
Due to high error correcting capability turbo coding is highly used in digital communication systems. In this article a new design of turbo decoder with reduced dynamic power dissipation is presented. In this modified decoder, standard cell based design using pipeline logarithm-maximum a posterior (Log-MAP) algorithm with clock gating and variable number of iteration is used to reduce the area and...
Polar codes are a new class of block codes with an explicit construction that provably achieve the capacity of various communications channels, even with the low-complexity successive-cancellation (SC) decoding algorithm. Yet, the more complex successive-cancellation list (SCL) decoding algorithm is gathering more attention lately as it significantly improves the error-correction performance of short-to...
Convolutional coding system is second-hand for consistent data broadcast. Viterbi decoder is used to decrypt the data at the acceptor end. In Viterbi decoder additional time consuming block is Add Compare and Selection Unit which works on Branch metric and path metric values. In previous work gate level simulation is done for ACSU with Carry look ahead adder. In this paper the ACSU unit is designed...
Convolutional encoders and Viterbi decoders are the most commonly used channel encoders/decoders used for efficient extraction of message bits. Convolutional encoder used EXOR gates for generating the code bits. Conventional Viterbi decoders use Trellis diagrams for extracting the message bits. Architecture of Viterbi decoder includes Branch Metric Unit (BMU), Path Metric Unit (PMU) and SurvivorMemory...
Convolutional coding technique is used for unfailing data broadcast. Viterbi decoder is used to decode the data at the receiver end. In Viterbi decoder more time taking block is Add Compare and Selection Unit which depends on Branch metric and path metric values. In previous work Carry look ahead adder was used in ACS unit. In this paper Sparse Kogge Stone, Brent Kung, Knowles adders are used in ACS...
The problems of subspace coding of large cardinality are considered. The main most interesting results which were published to this time are presented. A few directions of the development of this scientific area are mentioned. One of the direction was stated by Koetter, Kschischang and Silva and simultaneously was continued by Gabidulin and Bossert. It is based on so called lifting constructions of...
Wireless transceiver is a mandatory component of any kind of wireless sensors. Inside wireless transceiver, Viterbi decoder (VD) is needed to improve the decoding performance of the transceiver. In this paper, we propose a low complexity Viterbi decoder algorithm for wireless sensors that aim to support Internet of Thing (IoT) applications. Our algorithm is named as K-min Viterbi decoder because only...
Communication systems subjected to strong impulse noise are prone to performance degradation when the impulse occurrence is neglected in the decoding process: turbo decoders are likely to exhibit error propagation because the decision-making is dictated by excessive samples corrupted by impulses when the conventional decision metric, which is based on the assumption of additive white Gaussian noise,...
In this paper, we propose a parallel block-based Viterbi decoder (PBVD) on the graphic processing unit (GPU) platform for the decoding of convolutional codes. The decoding procedure is simplified and parallelized, and the characteristic of the trellis is exploited to reduce the metric computation. Based on the compute unified device architecture (CUDA), two kernels with different parallelism are designed...
In order to support the very high code rates and challenging throughput demands of the LTE/LTE-A standard, sophisticated Turbo-Code decoder architectures are required. Two types of architectures for the commonly used Max-Log-MAP algorithm are suited to fulfil throughput and frame error rate (FER) performance requirements. One is the more common parallel serial MAP architecture (PSMAP) and the other...
A single-user state-dependent channel with mismatched decoding is considered. Several setups are studied, which differ by the manner in which the state information is available to the encoder (causally or non-causally), and by whether or not the decoder is cognizant of the state sequence. We present achievable rates for these channels based on random coding and random binning and we also observe special...
This article addresses the error floor reduction of double-binary turbo codes. The proposed approach is an extension of a low complexity method originally proposed for decoding binary turbo codes. This method's interest is that it does not need to modify the turbo coding scheme as long as an error detection code is serially concatenated with the turbo code. Simulation results showed that error rate...
It is shown that the correct metric to predict the performance of coded modulation based on nonbinary FEC is the mutual information. The accuracy of the prediction is verified in an optical experiment.
Previous studies of intracortical brain-computer interfaces (BCIs) have often focused on or compared the use of spiking activity and local field potentials (LFPs) for decoding kinematic movement parameters. Conversely, using these signals to detect the initial intention to use a neuroprosthetic device or not has remained a relatively understudied problem. In this study, we examined the relative performance...
Connecting visual imagery with visual descriptive language is a challenge for computer vision and machine translation. Inspired by image description, which used ‘encoder-decoder’ model to translate image into target sentence. We propose an approach that can generate descriptions for video. Different from image which record the information in a moment, video have time-serials property. So when generating...
Space-based Automatic Identification System (AIS) uses Gaussian minimum shift keying modulation (GMSK) as the modulation scheme. Thus, Viterbi Algorithm (VA) is commonly implemented considering the tradeoff between performance and complexity. For the further improvement of the performance of Viterbi decoding, we propose a Soft-Output Viterbi Algorithm for AIS receiver (SOVA-AIS) in this paper. The...
As higher and higher speeds are used in wireless appliance, error correction continues to pose a considerable design challenge. Turbo codes exhibit attainment, in terms of bit error probability, that is very close to the Shannon limit and can be efficiently achieved for high-speed use. Turbo encoders and decoders have been introduced, most of which are based on convolution encoding. Here each encoder...
This paper introduces a new family of rank metric codes: the Low Rank Parity Check Codes (LRPC) for which we propose an efficient probabilistic LRPC decoding algorithm concatenated with convolutional code associated with an interleaver. The main idea of decoding LRPC codes is based on calculations of vector spaces over a finite field F(q). This family of codes can be seen as the equivalent of classical...
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.