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.
A new method using an error correcting code to reduce the probability of detection error for a digital watermark is proposed. The performance of the method is evaluated with a digital watermark for a 2D image as an example. In the method, only minimum weight codewords of the code are used as embedded information and two different decoding algorithms are used to reduce the probability of detection...
M-BCJR algorithms are proposed and tested over an AWGN channel with moderate to intense intersymbol interference (ISI). Two M-BCJR applications are evaluated, simple detection over the ISI channel and turbo equalization. The signaling is binary faster than Nyquist linear modulation. The ISI models tested correspond to transmission of increasingly many bits/Hz-s with a fixed signal spectra; the paper...
In non-block “streaming” data settings it has been observed that the availability of feedback dramatically changes the attainable communication reliability as a function of delay. The codebooks upon which these results depend contain a special and extremely reliable “red alert” message, used to indicate to the decoder when its best guess of the prior transmission is erroneous. In this paper we develop...
We consider communication over an AWGN discrete time memoryless channel with noiseless delay-less rate-limited feedback. For the case where the feedback rate is lower than the data rate transmitted over the forward channel, we show that the decay of the probability of error is at most linearly exponential in block-length and obtain an upper bound for the error exponent. For the case where the feedback...
In this paper, an overview of recent achievements in the design and decoding of non-binary low-density parity-check (LDPC) codes is provided. Non-binary constructions based on ultra-sparse matrices are compared with binary low-density parity-check codes and turbo codes from satellite communication standards, to show that larger coding gains (outperforming the binary competitors by at least 0.3 dB)...
In energy harvesting communication systems, an exogenous recharge process supplies energy for the data transmission and arriving energy can be buffered in a battery before consumption. Transmission is interrupted if there is not sufficient energy. We address communication with such random energy arrivals in an information-theoretic setting. Based on the classical additive white Gaussian noise (AWGN)...
In this paper, we derive stability conditions for nonbinary low-density-parity-check (LDPC) codes with Gray mapped M-ary phase-shift keying (M-PSK) and M-ary quadrate-amplitude-modulation (M-QAM) constellations. The stability of the GF (q) LDPC decoder with higher order modulation schemes is examined on both additive-white-Gaussian-noise (AWGN) and block Rayleigh fading channels and threshold stability...
Adaptive relaying schemes significantly improve the performance of relay networks by switching the forwarding technique according to the reliability of the received signal. Moreover, efficient resource allocation is vital for meliorating the relay network performance. In this paper, the minimization of the number of active relays in conjunction with power optimization for adaptive relay networks is...
Multimedia applications like high definition digital television push the manufacturers to increase available bandwidth mainly in Powerline Communication (PLC) links. Because of this needs in this work a PLC link control is developed to maximize the information rate meanwhile the bit error rate (BER) is maintained under a desired reference limit. The developed control system has a unique variable called...
In this paper we present Low Density Parity Check decoding algorithm that assemble two different algorithms: Sum-Product and Bit-Flipping; we denote Bit Flipping-Sum Product Algorithm (BFSP). To reduce the bit error rate, we perform the Bit-Flipping algorithm after the Sum-Product algorithm. Simulation results over an additive white Gaussian channel show that the error performance of a LDPC codes...
Iterative Joint Source Channel Decoding (IJSCD) is an effective technique to improve the overall performance of communication systems. However, it is based on Soft-in Soft-out (SISO) decoding of error correcting codes. In this paper, a new SISO decoding method of error resilient arithmetic codes (ERAC) is proposed, which is based on the conventional BCJR algorithm but sequentially prune nodes according...
We investigate the design of Luby Transform (LT) codes with minimum-shift-keying (MSK) modulation over additive white Gaussian noise (AWGN) channels. Both systematic and nonsystematic LT codes are considered from the perspectives of decoding threshold and bit error rate. Using systematic LT codes, coding complexity can be reduced by eliminating the need for decoder-doping, and less parity bits are...
A reduced-complexity modified decoding algorithm for turbo trellis-coded modulation (TTCM) is proposed and evaluated in terms of complexity and bit error rate (BER) performance in an additive white Gaussian noise (AWGN) channel. A novel method is derived from the Chebyshev inequality. In this approach, the max* operation is performed on n≥2 arguments, thus the recursive calculations are avoided and...
Abstract-In this paper, a novel methodology for design irregular quasi-cyclic LDPC codes is presented. The quasi-cyclic structure facilitates encoder and decoder implementation through shift-register-based circuits. The irregularity characteristic improves the code performance in waterfall region. The structure imposed on the bipartite graphs together with shifting matrix, Lead to a class of this...
This paper investigates the design of LDPC codes over mobile DTV multipath channels. Most of the existing LDPC codes are optimized for additive white Gaussian noise (AWGN) channel, and not feasible to encounter the long burst error occurring in mobile DTV channel. Accordingly, we study the error propagation statistics of decision feedback equalizer (DFE) and formulate it into a gated noise model....
A near optimal BP (NOBP) algorithm for low-density parity-check (LDPC) coded M-ary BICM communication system is proposed in this paper. Due to the good code structure of LDPC code, we derive the NOBP algorithm with the generalized distributive law from the generalized M-ary BP algorithm. The simulation results show that the NOBP algorithm outperforms the traditional BICM-BP algorithm over both the...
The error-floor performance of low-density parity-check (LDPC) codes under iterative decoding is governed by combinatorial configurations in the Tanner graph of the code termed trapping sets. Finding the smallest trapping set in a Tanner graph is an NP-hard problem. However, for codes constructed from designs one can partially characterize trapping sets and enumerate them efficiently. We focus on...
Designing realizable Maximum Likelihood (ML) decoders for low-density parity-check (LDPC) codes has always been a challenging problem. Maxwell decoder is a well-known ML decoder for LDPC codes over a binary erasure channel (BEC). Based on the concept used in the Maxwell decoder, it may be possible to design near-ML decoders for LDPC codes over an additive white Gaussian noise (AWGN) channel. In this...
The problem of communicating over an N-user additive white Gaussian noise broadcast channel with feedback is studied from a control theoretic perspective. We construct a code for this channel and characterize the set of achievable rates using the theory of linear quadratic Gaussian control. In the special case of a two-receiver channel with independent Gaussian noises, the rate region achieved by...
We demonstrate a decoding scheme for nested lattice codes which is able to decode a list of a particular size which contains the transmitted codeword with high probability. This list decoder is analogous to that used in random coding arguments in achievability schemes of relay channels, and allows for the effective combination of information from the relay and source node. Using this list decoding...
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.