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.
The most popular methods for the analysis of LDPC codes, e.g. density evolution and EXIT charts, apply to infinite length ensembles. Finite length analysis is less common, among the notable examples are scaling law analysis and the EXIT band chart. The scaling law is limited to the waterfall region and furthermore is limited to the final error rates and does not give insight into the progression and...
This paper presents a simple method of designing a protograph-based LDPC codes which has excellent performance with a small number of decoding iterations. In addition to designing LDPC codes based on the iterative decoding threshold as before, we add one more dimension into the design process which is a predefined number of decoding iterations. Simulation results show that the proposed codes have...
This paper exposes a new decoder for linear bloc codes. The proposed decoder is based on the resolution of the parity equations system. Elsewhere, to reduce its complexity we have developed a criteria for early terminating the decoding, on the one hand. On the other hand, we introduced a fast method for generating test error patterns. Our decoder is suitable for linear bloc code of medium and high...
This paper investigates the construction and iterative threshold decoding of low rate Quasi-Cyclic One Step Majority logic codes based on combinatorial designs. These codes are constructed with two type of difference family: cyclic disjoint difference sets and cyclic disjoint difference family. They can be encoded with low complexity, and perform very well when decoded with the Iterative threshold...
In this paper, the sphere bound (SB) is revisited within a general bounding framework based on nested Gallager regions. We show that the SB proposed by Herzberg et al. is equivalent to the SB proposed by Kasami et al‥ Interestingly, this general framework provides a new way to evaluate the performance of binary linear codes over additive white Gaussian noise (AWGN) channels. This simulation approach...
The development of smart platforms in the Internet-of-Things (IoT) paradigm requires a number of technological advances to go hand in hand. IoT devices and entities have very diverse set of capabilities in terms of memory, power, and processing and are connected via a wide range of links with various qualities and capacities. This work focuses on the design of state-of-the-art data transmission methodology...
In optical communication systems using wavelength division multiplexing, the transmission link can no longer be described as an AWGN channel as the co-propagating signals influence each other due to the nonlinearity of the fiber. As a consequence of the resulting phase noise, frequent cycle slips may occur in the carrier phase estimation which can be counteracted by the use of differential modulation...
In this paper, we establish the ε-capacity region for the AWGN multiple access channel (MAC) with feedback under an expected power constraint by combining ideas from binary hypothesis testing, information spectrum analysis, Ozarow's coding scheme, and power control.
Forward Error Correction codes are required to remove errors such as noise, crosstalk etc that transpire in communication channel. In this paper, we propose a concatenated (Single Parity Check, BCH and Low Density Parity Check) coding method to remove the errors and improve the efficiency of the system. Simulation results shows that Single Parity Check method along with BCH and Low Density Parity...
This paper presents an extrinsic information transfer (EXIT) chart based irregular repeat-accumulate (IRA) code design technique for a two-dimensional magnetic recording (TDMR) turbo-equalizer that employs a Voronoi magnetic grain model. The channel model also includes two-dimensional inter-symbol interference (2D-ISI) and additive white Gaussian noise (AWGN). At high bit densities (e.g., between...
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...
Continuous phase modulation (CPM) is a family of bandwidth-efficient signaling schemes with memory. In this paper we introduce a simulation-based method to compute a lower bound, namely the dependence testing (DT) bound, on the maximum achievable rate of general CPM schemes under finite blocklength, probability of error, and equiprobable input distribution constraints. The proposed method utilizes...
This paper focuses on the signal constellation shaping in LDPC coded modulation system. A novel constellation is presented by combining geometric shaping with probabilistic shaping based on quadrature amplitude modulation (QAM)constellation. With the shaped signal constellation, the signal mapping is optimized by using the extrinsic information transfer (EXIT) chart analysis. We further consider the...
In this paper, we take an arbitrarily varying channel (AVC) approach to examine the problem of writing on a dirty paper in the presence of an adversary. We consider an additive white Gaussian noise (AWGN) channel with an additive white Gaussian state, where the state is known non-causally to the encoder and the adversary, but not the decoder. We determine the randomized coding capacity of this AVC...
In this paper, the performance of state of the art decoding methods of polar codes, such as the SC (Successive Cancellation), BP (belief propagation), LP (Linear Programming), LSC(List Successive Cancellation) and ML(Maximum Likelihood) decoding, over different binary-input discrete memoryless channels (B-DMCs) are presented. Simulation results indicate that decoding algorithms of polar codes have...
To get a generalized version of LDPC code, we construct (7, 4)-Hamming GLDPC code with (7, 4) Hamming component code in this paper, and give the number of short cycles of this GLDPC code as well as the code weight distribution. Via MLD, the negative effects of short cycles limited in the Hamming block can be eliminated. Simulation results show that, up to 2 dB coding gain can be obtained for GLDPC...
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...
State-of-the-art channel coding schemes promise data rates close to the wireless channel capacity. However, efficient link adaptation techniques are required in order to deliver such throughputs in practice. Traditional rate adaptation schemes, which are reactive and try to “predict” the transmission mode that maximizes throughput based on “transmission quality indicators”, can be highly inefficient...
We consider analog multiple description joint source-channel schemes for the transmission of a Gaussian source over two independent AWGN parallel channels under a quadratic error distortion criteria. For such systems, Lines mapping was proved to be a simple and efficient mapping when MMSE decoding is used. However, MMSE decoding presents a high computational load. In order to reduce complexity of...
We consider the problem of transmitting confidential messages over a two-user broadcast multiple-input multiple-output (MIMO) channel. Surprisingly, the capacity region of this setting under a covariance matrix constraint was shown by Liu et al. to be rectangular. That is, there is no tension, and both users can attain their respective MIMO wiretap capacities, simultaneously. In this work, we provide...
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.