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.
Firstly, this paper gives a simple introduction of the encoding/decoding theory of LDPC and Space-time coding. And it carries out a detailed research and analysis on LDPC coding system and the space-time block coding system. Then, LDPC and space-time coding are combined. The performance of LDPC-STBC under AWGN channel is given through computer simulation. The simulation results show that this method...
Polar codes have been recently proposed as the first low complexity class of codes that can provably achieve the capacity of symmetric binary-input memoryless channels. Here, we study the bit error rate performance of finite-length polar codes under Belief Propagation (BP) decoding. We analyze the stopping sets of polar codes and the size of the minimal stopping set, called “stopping distance”. Stopping...
Recently, it was observed that spatially-coupled LDPC code ensembles approach the Shannon capacity for a class of binary-input memoryless symmetric (BMS) channels. The fundamental reason for this was attributed to a threshold saturation phenomena derived in. In particular, it was shown that the belief propagation (BP) threshold of the spatially coupled codes is equal to the maximum a posteriori (MAP)...
Low-density parity-check (LDPC) codes become very popular in channel coding, since they can achieve the performance close maximum-likelihood (ML) decoding with linear complexity of the block length. Muramatsu et al. proposed a code using LDPC matrices for Slepian-Wolf source coding. However, since they employed ML decoding, their code is not universal, that is their decoder needs to know the probability...
In this paper, we investigate the low density parity-check (LDPC) decoding algorithms and the detection methods of the multiple-input multiple-output (MIMO) systems. For LDPC codes, min-sum and layered decoding algorithms are discussed, and for MIMO detection, the maximum likelihood (ML) decision based on the sphere decoding algorithm is mainly analyzed. Also, the performance of the combination of...
In this paper a novel framework for packet loss recovery in the Consultative Committee for space data systems (CCSDS) telemetry downlink is presented. The framework relies on packet-level LDPC erasure correcting codes and on low-complexity maximum likelihood (ML) decoding. A code design tailored to the ML decoder is presented, which is based on generalized irregular repeat-accumulate (GeIRA) codes...
Recently, dirty-paper coding has been attracting a lot of attentions due to its connection with various problems such as data hiding, precoding for ISI channels and MIMO Gaussian broadcasting. One of the main challenges is to design codes with practical encoding and decoding algorithms. In this paper we propose a simple coding scheme for the binary dirty-paper channel -with the interference known...
In this paper, we consider communication over the binary erasure channel (BEC) using low-density parity-check (LDPC) codes. We consider MAP decoding not using a whole Tanner graph but only a neighborhood graph of fixed depth referred to as local-MAP decoding for deriving lower bounds of the error probability under message-passing decoding and bit-flipping decoding. The main result of this paper is...
The ML redundancy of a code is defined as the smallest number of rows in its parity-check matrix such that a message-passing decoder working in the corresponding Tanner graph achieves maximum-likelihood (ML) performance on an erasure channel. General upper bounds on ML redundancy are obtained. In particular, it is shown that the ML redundancy of a q-ary code is at most the number of minimal codewords...
The features of long delay, great error rate and packet loss, asymmetric bandwidth between uplink and downlink and links easily interrupted in deep space communication determine the technology of encoding and decoding is a difficult issue. The basic conception and features of fountain codes are introduced, and the question of all-selected, degree distribution and the decoding algorithm of fountain...
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.