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.
Nowadays digital communication is very popular due to various advantages like less affected by noise and which can be easily regenerated by various decoding algorithms. In order to correct the error occurring while transmitting the message through communication channel, the forward error correction (FEC) coding is used. In this FEC method, the convolutional encoder provides a suitable mechanism to...
Turbo compressive sensing is a sparse signal transmission technique over an AWGN channel. In this method, compressive sensing is applied as a source encoder serially concatenated with a convolutional channel encoder which thus makes up the transmitter system model. At the turbo compressive sensing receiver, a mapping method, following the channel and source decoding, is used to generate extrinsic...
This paper talks about designing an efficient Viterbi coder which can be used for Text to Speech synthesis (TTS). Today numerous applications uses Text to Speech synthesis (TTS) and Viterbi coder plays a key role in producing the synthesized output. Viterbi algorithm includes numerous iterations to produce the output and hence power utilization is more. We propose a technique which uses a memory access...
Researches on the application of iterative differential demodulation and decoding in SCCC-coded systems are presented. Knowing that the tradition algorithm of iterative decoding in SCCC-coded systems has a high complexity with a two-level iteration structure, a low complexity approach is proposed. In each iteration of the channel decoding, the demodulator uses the extrinsic information of the outer...
Serial concatenated code (SCC) has drawn lots of attention by its outstanding performance in terms of reduced bit error rate (BER). It is considered that the encoding structure and decoding algorithm are the two crucial parameters for performance improvement of any code system. This paper introduces the modified structure of SCCC encoder design. The addition of a set of de-Multiplexer and multiplexer...
The HUGO project, published at 2010, can be considered as one of the most promising direction in the design of highly undetectable steganography. The main idea of that approach is to minimise the embedding impact from the steganalysis point of view. This goal is achieved by using trellis codes in the embedding procedure, the Viterbi algorithm (VA) and the SPAM features. But the optimality of VA was...
In this paper, a highly efficient protograph-based repeat-accumulate (P-RA) anytime code is proposed, which is derived from the combination of protograph-based low-density parity-check convolutional (P-LDPCC) and spatially coupled low-density parity-check convolutional (SC-LDPCC) codes. Density evolution technique is applied to demonstrate the anytime properties of the P-RA codes over the binary erasure...
We consider a window decoding scheme for Braided Convolutional Codes (BCCs) based on the BCJR algorithm. We describe the principle of this decoding scheme and show that BCCs with window decoding exhibit excellent performance. The tradeoff between performance and decoding latency is examined and, to reduce decoding complexity, both uniform and nonuniform message passing schedules within the decoding...
In this paper we prove threshold saturation for spatially coupled turbo codes (SC-TCs) and braided convolutional codes (BCCs) over the binary erasure channel. We introduce a compact graph representation for the ensembles of SC-TC and BCC codes which simplifies their description and the analysis of the message passing decoding. We demonstrate that by few assumptions in the ensembles of these codes,...
In this paper, a new Slepian-Wolf codec was constructed with spatially coupled Low-Density Parity-Check Convolutional (SP-LDPCC) codes. The approach is based on considering the correlation as a virtual binary erasure channel (BEC) and Binary-Input Additive White Gaussian Noise (BIAWGN)channel and applying the syndrome concept. The system is focusing on the compression of a equal-probable memory less...
Accurate channel state information (CSI) is crucial for reliable decoding over fading channels. In many existing works, the CSI acquisition relies greatly on accurate knowledge of the channel model information (CMI), which includes, in particular, the power spectrum of the fading process and the statistical distribution of the fading gain. In practice, it may be difficult to obtain or keep track of...
Iterative decoding of orthogonal convolutional code is widely used for its excellent performance. However, the iterations lead to high complexity and long decoding delay, which is unsuitable for low- rate voice service in mobile satellite communications with on-board processing. In this paper, a novel scheme of orthogonal convolutional coding as well as an associated non-iterative joint decoding algorithm...
In this paper, a triple binary turbo codes (TBTCs) family with rate 3/4 constituent convolutional codes of memory 4 is presented. With an observer canonical form implementation of component encoders, the family has over 500,000 units. In this family, we addressed the issue of selecting turbo codes. Through an exhaustive search using a selection criterion based on the convergence of the iterative process...
This chapter derives various random ensemble bounds for decoding error probability. The decoding error probability of the Viterbi decoding algorithm is analyzed for convolutional codes but only for the ensemble of time‐varying convolutional codes. The errors in the output from the Viterbi decoder are first grouped in error bursts, and then distribution of the lengths of these error events is upperbounded...
We propose a dynamic window decoding scheme for LDPC convolutional codes to reduce the latency compared to the belief propagation decoding. The BER performance of our proposed memory-efficient decoding scheme is verified by simulations.
This paper proposes a novel nonbinary concatenated coding system with nonbinary Reed-Solomon (RS) inner codes and a nonbinary convolutional outer code for Narrowband Power Line Channel (NB-PLC). This channel is modeled with a “Middleton A” impulsive noise and an AWGN noise. With this structure, the inner decoder will correct random and short burst errors while the outer decoder will correct much longer...
The article discusses the use of error-correcting codes and methods of their decoding and also analysis of the use of different depths of interleaving for modeling concatenated codes.
A long-standing question in coding theory is whether code ensembles having a low-density parity check (LDPC) matrix can attain capacity under belief propagation (BP) decoding. An affirmative answer to this problem was recently given by the special class of spatially-coupled LDPC code ensemble. In this work, we provide a simple derivation of a different LDPC code ensemble that approaches capacity under...
The column Hamming distance of a convolutional code determines the error correction capability when streaming over a class of packet erasure channels. We show that the column sum rank parallels column Hamming distance when streaming over a network with link failures. We prove rank analogues of several column distance properties and introduce a new family of convolutional codes that maximize the column...
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.