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 order to achieve error correction nearer to Shanon's limit, Turbo decoder imparts either Soft Output Viterbi Algorithm (SOVA) or Maximum Posteriori Probability (MAP). The feasibility of most expected path through the Trellis is mainly determined by Max-Log-MAP, a Soft Input Soft Output (SISO) algorithm and gives a better performance over MAX-LOG-MAP (MLMAP) algorithm. To improve the decoder's performance...
In many practical communication systems, the channel is corrupted by non-Gaussian impulsive noise (IN). It introduces decoding metric mismatch for the traditional Euclidean metric decoders and limits system performance. The situation is worsen by the practical difficulty in accurately estimating the IN statistics. Recently, some metric clipping based decoders with a properly chosen clipping threshold...
Secure Write-Efficient Memory (WEM) was proposed in [11] to solve the endurance and the insecure deletion problems in flash memories. Information theoretical results, i.e., the achievable region and the secrecy rewriting capacity, have been obtained. In this work, a code construction for secure WEM is presented and it is optimal for a large family of secure WEM.
In the context of interference channels with multiple transmitters and receivers, we propose a novel decoding scheme called anywhere decoding that does not pre-assign the receiver at which each message should be decoded, but rather requires that each message must be decoded at some receiver. This paper illustrates how system performance can improve if we allow for this flexibility. After developing...
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...
The list demapper has been widely employed for coded multiple-input multiple-output (coded-MIMO) receivers, where only a list of signal vectors is examined in the calculation of likelihood ratio. In the literature, the search of list is operated in the symbol level in accordance with a search metric defined as a function of signal (symbol) vector. Since a signal vector is mapped from a group of (coded)...
This work proposes an efficient hardware Implementation of sequential stack decoding of binary block codes. The decoder can be applied for soft input decoding for generalized concatenated (GC) codes. The GC codes are constructed from inner nested binary Bose-Chaudhuri-Hocquenghem (BCH) codes and outer Reed-Solomon (RS) codes. In order to enable soft input decoding for the inner BCH block codes, a...
We propose an efficient iterative multiple-input multiple-output (MIMO) detection algorithm based on the local search. Specifically, since the MIMO channel matrix twists the lattice structure of the received symbols, the proposed channel-aware local search (CA-LS) defines its search neighborhood according to the instantaneous channel realization. Such channel-dependent neighborhood can be efficiently...
The problem of efficient decoding of polar codes is considered. A multilevel bucket structure is proposed for implementation of the stack in the sequential decoding algorithm. This data structure reduces the complexity of stack operations with respect to the implementation based on a red-black tree.
An early stopping criterion is proposed for low-density lattice codes (LDLC) to reduce the number of decoding iterations. The stopping criterion is based on a new metric which is used to predict the convergence of the iterative decoding algorithm for LDLC. Simulation results demonstrate that the proposed criterion can decrease the average iteration number considerably while the decoding performance...
We present a new reliability-based hybrid automatic repeat request (RB-HARQ) scheme based on low density parity check (LDPC) codes. With the proposed RB-HARQ, which uses a rate-compatible LDPC code with puncturing and extending, the longest codeword is divided into clusters of code bits. Unlike previous works, in the event of a decoding failure, the receiver measures the reliability of received clusters,...
Kernel Spectral Clustering (KSC) solves a weighted kernel principal component analysis problem in a primal-dual optimization framework. The KSC model is built on a small subset of data using a proper training, model selection and a test phase. The clustering model is obtained using the dual solution of the problem and has a powerful out-of-sample extensions property which allows cluster affiliation...
Recent advancements in graph-based analysis and solutions of instantly decodable network coding (IDNC) trigger the interest to extend them to more complicated opportunistic network coding (ONC) scenarios, with limited increase in complexity. In this paper, we design a simple IDNC-like graph model for a specific subclass of ONC, by introducing a more generalized definition of its vertices and the notion...
We consider the decoding problem or the problem of finding low weight codewords for rank metric codes. We show how additional information about the codeword we want to find under the form of certain linear combinations of the entries of the codeword leads to algorithms with a better complexity. This is then used together with a folding technique for attacking a McEliece scheme based on LRPC codes...
This paper studies likelihood decoding for channel coding over discrete memoryless channels. It is shown that the likelihood decoder recovers the same random-coding error exponents as the maximum-likelihood decoder for i.i.d. and constant-composition random codes. The role of mismatch in likelihood decoding is studied, and the notion of the mismatched likelihood decoder capacity is introduced. It...
Gabidulin codes can be seen as the rank-metric equivalent of Reed-Solomon codes. It was recently proven, using subspace polynomials, that Gabidulin codes cannot be list decoded beyond the so-called Johnson radius. In another result, cyclic subspace codes were constructed by inspecting the connection between subspaces and their subspace polynomials. In this paper, these subspace codes are used to prove...
The problem of mismatched decoding with an additive metric q for a discrete memoryelss channel W is addressed. Two max-min multi-letter upper bounds on the mismatch capacity Cq(W) are derived. We further prove that if the average probability of error of a sequence of codebooks converges to zero sufficiently fast, then the rate of the code-sequence is upper bounded by the “product-space” improvement...
By developing one-shot mutual covering lemmas, we derive a one-shot achievability bound for broadcast with a common message which recovers Marton's inner bound (with three auxiliary random variables) in the i.i.d. case. The encoder employed is deterministic. Relationship between the mutual covering lemma and a new type of channel resolvability problem is discussed.
The setup of a general channel is considered in the mismatched case, i.e., when the decoder uses a general decoding metric. An expression for the average error probability in list decoding with block length n, metric qn, list size enΘn and rate R, denoted ε(n)qn(R, Θn), is established. Further, a general multi-letter formula for the mismatched capacity with list decoding is derived. It is shown that...
A well-known technique in assessing probabilities of rare events (used, e.g., in the sphere-packing bound), is that of finding a reference measure under which the event of interest has probability of order one and estimating the probability in question using the Kullback-Leibler divergence (KLD). A recent method has been proposed [2], that can be viewed as an extension of this idea in which the probability...
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.