Goa, India, October Question: 4/15 SOURCE 1 : IBM. G.gen: Low-density parity-check codes for DSL transmission.
|
|
- Frederica Ferguson
- 5 years ago
- Views:
Transcription
1 ITU - Telecommunication Standardization Sector STUDY GROUP 15 Temporary Document BI-095 Original: English Goa, India, 3 7 October 000 Question: 4/15 SOURCE 1 : IBM TITLE: G.gen: Low-density parity-check codes for DSL transmission. ABSTRACT We propose the application of low-density parity-check (LDPC) codes for DSL transmission. We present simulation results that show that LDPC codes achieve excellent performance for bandwidthefficient QAM transmission. LDPC codes do not suffer from error floors and offer some unique advantages in terms of practical implementation. They therefore represent an alternative to turbocodes for advanced coding in ADSL. 1 Contact: E. Eleftheriou ele@zurich.ibm.com S. Ölçer oel@zurich.ibm.com IBM Zurich Research Laboratory 8803 Rüschlikon, Switzerland
2 1. Introduction Low-density parity-check (LDPC) codes were introduced by Gallager [1] as a family of linear block codes with parity-check matrices containing mostly zeros and only a small number of ones. The sparsity of the paritycheck matrices defining these codes is key in enabling their efficient decoding by a message-passing procedure also known as the sum-product algorithm. LDPC codes and their decoding were reinvented by MacKay and Neal [], [3] in the mid 1990 s, shortly after Berrou et al. introduced the turbo-codes [4] and demonstrated the importance of iterative decoding techniques for approaching channel capacity in practical systems. Subsequently, LDPC codes have generated tremendous interest both theoretically and from an implementation viewpoint and many new developments have taken place. It is today well acknowledged that LDPC codes are as good as turbo codes. LDPC codes and turbo-codes are based on a similar design philosophy both can be described from a constrained random code ensemble viewpoint. Also the decoding techniques used for both methods can be viewed as different instantiations of the same basic decoding process. However, the soft-input soft-output BCJR algorithm [5], or suboptimal versions of it, used for turbo-decoding is rather complex while the sum-product algorithm used for LDPC decoding lends itself to parallel implementation and is computationally simpler. LDPC codes, on the other side, may lead to more stringent requirements in terms of storage. In this contribution we investigate the application of LDPC codes to the DSL transmission problem [6]. We present simulation results for three specific high-rate binary LDPC codes, which are specified in Table 1 in terms of the parameters K, the length of the information block, and N, the code length. Transmitted QAM symbols are obtained from code bits via simple Gray mapping. Table 1 summarizes the main results in terms of the net coding gains obtained at a symbol-error rate of 10 7 on an additive white Gaussian noise (AWGN) channel for three different QAM formats. We note that the coding gain values given in this table can be increased further by allowing a larger number of iterations during the decoding process: here, we have intentionally limited the number of iterations in order to shorten the simulation time on the computer. K N Rate K/N 16-QAM 64-QAM 4096-QAM Code db 4.6 db 3.5 db (3.49 b/s/hz) (5.4 b/s/hz) (10.49 b/s/hz) Code db 5.9 db 4.8 db (3.55 b/s/hz) (5.33 b/s/hz) (10.67 b/s/hz) Code db 6.1 db 5.6 db (3.74 b/s/hz) (5.61 b/s/hz) (11. b/s/hz) Table 1 : LDPC codes considered for the simulations and net coding gains achieved at a symbol-error rate of 10-7 for different QAM constellations. The spectral efficiencies are indicated in parentheses. The codes given in Table 1 are due to MacKay and have been obtained by a random construction method. These codes are used in this contribution to demonstrate the performance of LDPC codes for bandwidthefficient modulation. The results of Table 1 confirm that LDPC codes offer net coding gains that are similar to those that have been reported for turbo codes, e.g., [7]. LDPC codes achieve asymptotically an excellent performance without exhibiting error floors and admit a wide range of trade-offs between performance and decoding complexity. For these reasons, they can be considered as an alternative to turbo-codes for DSL transmission. In Section, we give a brief description of LDPC codes and present the principles of the iterative technique used to decode them. In Section 3, we study by simulation the performance of binary LDPC codes for multilevel modulation and, in Section 4, discuss implementation aspects. Finally, we give in Section 5 some conclusions and describe future work. BI-095.doc Page of :59
3 . Low-density parity-check (LDPC) codes A linear block code can be described in terms of a parity-check matrix H which satisfies Hx = 0 for all codewords x. Each row of the M N parity-check matrix defines a parity-check equation that must be satisfied by each codeword x. For example, the well-known (7,4) Hamming code is defined by the following parity-check equations x1 x x x x x x (check 1) x x 5 x 6 x 7 parity-check matrix H codeword x x x x x check bits x x 3 3 x x 4 4 (check ) (check 3) LDPC codes differ in three major ways with respect to this simple example: they usually have long block lengths N in order to achieve near Shannon-limit performance, their parity-check matrices are defined, by construction, in nonsystematic form and exhibit a number of 1 s that is much less than M N. A parity-check matrix for a (j,k)- regular LDPC code has exactly j ones in each of its columns and k ones in each of its rows. A parity-check matrix can generally be represented by a graph with two types of nodes: the symbol nodes and the parity-check nodes (or check nodes). A symbol node n, representing code bit x n, is connected to check node m only if the (m,n)-th element of the parity-check matrix is a 1. No symbol (check) node is connected to a symbol (check) node. For example, the (7,4) Hamming code can be represented by the graph shown in Fig. 1. x 1 x x 3 x 4 x 5 x 6 x 7 check 1 check check 3 Figure 1: Graph corresponding to the parity-check matrix of the (7,4) Hamming code. We note in this specific case that, because the parity-check matrix is given in systematic form, symbol nodes x 5, x 6 and x 7 in the associated graph are connected to single distinct check nodes. The parity-check matrix of a (j,k)- regular LDPC code leads to a graph where every symbol node is connected to precisely j check nodes and every check node is connected to precisely k symbol nodes. Graphical representations of LDPC codes are useful both for deriving and for implementing the iterative decoding procedure introduced in [1]. Gallager s decoder is a message-passing decoder (in a sense to be made clear below) based on the so-called sum-product algorithm. We note that the sum-product algorithm is a general algorithm to decode codes defined on graphs..1 Encoding procedure A wide variety of other algorithms (e.g., the Viterbi algorithm, the forward/backward algorithm, the iterative turbodecoding algorithm, the fast Fourier transform, ) can also be derived as specific instances of the sum-product algorithm. BI-095.doc Page 3 of :59
4 Encoding is in principle performed by multiplying in GF() the information block u by the generator matrix G of the LDPC code: x = u G. Recall that generator and parity-check matrices satisfy the relation G H T = 0.. Decoding of LDPC codes We assume binary transmission initially. Let the codeword x with elements x i = 0 or 1 be mapped onto the vector of bipolar signals s with elements s i = +1 or 1 (i = 0, 1, N-1). The vector of channel output signals is given by y = s + n (n: vector of noise samples). The decoding procedure aims at finding the most probable codeword x such that x H T = 0. We will not repeat here the details of the LDPC decoding algorithm, which can be found in several of the references given at the end of this contribution. Fundamentally, the algorithm has two alternating parts. Beginning for example at the check nodes (first part), quantities r mn associated with check node m are updated and passed as messages to the symbol nodes checked by check node m. This operation is performed for all check nodes. In the second part, quantities q mn associated with symbol node n are updated and passed as messages to the check nodes that involve variable node n. This operation is performed for all symbol nodes. update N symbol nodes n n r mn q mn m m update M check nodes Figure : Message-passing decoding. These two alternating parts, illustrated in Fig., make up one iteration of the decoding algorithm. At each iteration, it is possible to compute a codeword estimate xˆ. Decoding is stopped if xˆ H T = 0, or if some other stopping criterion is met (e.g., maximum number of iterations). We note that the quantity r mn represents the probability that check m is satisfied, given that symbol n is fixed, say, at 0 and given the (posterior) probability for each of the other symbols entering check m. The quantity q mn represents the probability that bit n is a 0 (or a 1) given the information obtained via checks other than check m. Messages passed between the nodes need not be posterior probabilities but can be likelihood or loglikelihood ratios. In fact, various simplifications of the decoding algorithm have been explored in the published literature and can be adopted for practical implementations, see e.g., [8]. 3. Performance of LDPC codes for bandwidth-efficient communications We study in this section the application of binary LDPC codes to two-dimensional QAM transmission over an AWGN channel. Our objective is to show typical attainable performance with simple encoding and symbol mapping schemes. BI-095.doc Page 4 of :59
5 The block-diagram of the encoding and decoding processes is shown in Fig. 3. For symbol mapping, b LDPC code bits are translated into one QAM symbol taken from a b -point constellation using Gray mapping. At the receiver, soft demapping of received noisy QAM symbols provides soft information on individual code bits in the form of a posteriori probabilities. These probabilities are employed to carry out the message passing LDPC decoding procedure described in Section. Block of k info bits Rate k/n LDPC encoder Block of N code bits QAM symbol mapper Block of QAM symbols decoded information decoding success/failure message passing decoder Block of N soft info Soft demapper Block of noisy QAM symbols Figure 3: Multilevel LDPC encoding and decoding. When the employed QAM constellation is square (b even) and the in-phase and quadrature noise components are independent, it is computationally advantageous to perform soft demapping independently for the real and imaginary parts of the received complex signals. We will therefore consider only square LL QAM constellations. Symbol mapping for the real or the imaginary part of transmitted QAM symbols is performed by translating a group of b/ code bits (i0, i1,...,i b/-1 ) into one of the L real symbols A m within the set A {A 0 (L 1), A1 (L 3),..., A L/-1 1, A L/ 1,...,A L-1 (L 1)}. Denoting by y the real or the imaginary part of a noisy received signal: y A n, with A A and n an AWGN sample with variance n, the a posteriori probability that bit i is zero (alternately one) is computed as n e j b Pr(i 0 y), 0,1,..., 1, (y-a j) L-1 n e j 0 (y-a ) j where the summation in the numerator is taken over all symbols A j A for which i Performance and net coding gain Performance is measured in terms of E b /N 0, the ratio of energy-per-bit to noise-power-spectral-density: BI-095.doc Page 5 of :59
6 E N b 0 a n 1, where a is the variance of the symbols taken from the b -point QAM constellation and n is the noise variance per dimension. If a rate-k/n LDPC code is employed, each QAM symbol carries (K/N) b information bits. To determine the net coding gain from simulations, we need to compare at given error probability the signal-tonoise ratios required for data transmission with bit/symbol using uncoded and coded modulations. Since is generally a rational number, a baseline uncoded two-dimensional QAM system would need to have a noninteger number of constellation points. To avoid this difficulty, we proceed as follows. For a modulation and coding scheme transmitting bit/symbol, a normalized signal-to-noise ratio SNR norm can be defined as [9], [10] SNR norm E 1 N b 0. In the case of uncoded transmission ( b ), SNR norm allows the average symbol-error probability to be expressed as PS (E) Q( 3 SNR norm ), with Q(x) (1/ ) exp( z / ) dz, nearly independently of the constellation size provided the latter is large enough. The curve of P S (E) versus SNR norm indicates that the gap to capacity for uncoded QAM is equal to ~ 9.8 db at a symbol-error rate of * We therefore determine the value of the normalized signal-to-noise ratio ( SNR norm, say) needed for the coded system to achieve a symbol-error rate of 10-7 and compute the net coding gain at that symbol-error rate as G log (SNR ) [db]. 10 * norm We note that an upper limit to the net coding gain measured in this way is ~ 8.7 db since the Shannon limit cannot be approached to within less than 1.53 db without shaping. x 3. Simulation results Simulations were performed for the LDPC codes specified in Table 1 and for 16-QAM, 64-QAM and QAM. To measure error rates, we transmit one codeword over the AWGN channel and decode using the message-passing (sum-product) algorithm for given maximum number of iterations. We repeat this experiment a large number of times to ensure that the number of observed block errors is at least equal to 100. Figure 4 shows the effect on performance of the maximum number of iterations allowed in the decoding process for a specific code and QAM format. Very similar results are obtained for other LDPC codes and spectral efficiencies. For the subsequent simulations, we shall set the maximum number of iterations to 0 in order to limit the simulation time on the computer, with the understanding that the performance results shown can still be improved by allowing a larger value for this parameter. BI-095.doc Page 6 of :59
7 Figure 4: Effect of the maximum number of iterations for LDPC decoding with Code and 16-QAM. Figures 5, 6, and 7 give the performance achieved with Code 1, Code and Code 3, respectively, for different QAM constellations in terms of bit-error rate (BER) versus E b /N 0. Note that the different systems cannot be compared with each other based on these figures since they all involve different spectral efficiencies. Figure 5: Bit-error rate versus E b /N 0 for 16, 64 and 4096-QAM using LDPC Code 1. BI-095.doc Page 7 of :59
8 Figure 6: Bit-error rate versus E b /N 0 for 16, 64 and 4096-QAM using LDPC Code. Figure 7: Bit-error rate versus E b /N 0 for 16, 64 and 4096-QAM using LDPC Code 3. Figures 8, 9, and 10 give the performance achieved with Code 1, Code and Code 3, respectively, for different QAM constellations in terms of symbol-error rate (SER) versus SNR norm. These figures also show P S (E), the SER for uncoded modulation. The net coding gains derived from Fig. 8, 9, and 10 are those summarized in Table 1 presented earlier in Section 1. Note that the coding gains given in this table are obtained by extrapolating the results for an error rate of This can be done since the LDPC codes do not exhibit error floors. BI-095.doc Page 8 of :59
9 Figure 8: Symbol-error rate versus SNR norm for 16, 64 and 4096-QAM using LDPC Code 1. Figure 9: Symbol-error rate versus SNR norm for 16, 64 and 4096-QAM using LDPC Code. BI-095.doc Page 9 of :59
10 Figure 10: Symbol-error rate versus SNR norm for 16, 64 and 4096-QAM using LDPC Code Implementation The decoding procedure described in Section is appealing from an implementation viewpoint. For example, as illustrated in Fig., parallel processing can be used to update all check nodes, or all symbol nodes, simultaneously. For regular LDPC codes, each symbol or check node can be implemented as an instantiation of a basic computation unit an ASIC macro or a DSP routine. For fixed (j,k) parameters, it is then possible to decode for different codes simply either by rearranging the connections between the computation units or redefining the routine call parameters. It is furthermore possible to decode for codes of different rates and lengths by switching some of the computation units on or off. 4.1 Complexity For reasons of implementation complexity, it is usually preferable to avoid realizing the LDPC decoding algorithm in the form where messages being passed directly represent posterior probabilities. A variety of algorithms have been described in the published literature leading to efficient implementations of the decoder at the price of some loss in achievable coding gain. For the present discussion, we consider the algorithm presented in [8], which for the signal-to-noise ratio values of interest in DSLs, leads to very small performance penalty. The complexity of this algorithm amounts to 3N(j-1) additions and M(k-3) comparisons for one iteration, with M the number of rows in the parity check matrix (this complexity could in fact even be reduced further). Accordingly, the decoding complexity per code bit and per iteration is summarized in Table (a) for the three codes studied in Section 3. Adds Comps Code Code Code (a) BI-095.doc Page 10 of :59
11 Log-MAP Max-Log-MAP Adds Comps Mults TLUs Adds Comps Mults (b) Table : Decoding complexity of (a) LDPC codes and (b) turbo-codes in number of operations per bit and per iteration. (TLU: table lookup) For comparison, we included in Table (b) the complexity of BCJR-based decoding for binary turbo-codes. We assume parallel concatenation of a pair of 16-state convolution codes as proposed in [7]. The BCJR algorithm is assumed to be realized in the log-map and the max-log-map forms. We see that the implementation complexity of LDPC decoding is significantly less than for the turbo-coding approach. The number of operations given in Table does not take into account the soft demapping by which soft information on individual code bits is obtained from channel symbols since all the algorithms require the same computational effort for this step. They do not also include the GF() operations needed for encoding. Although these exclusive-or operations are traditionally not taken into account when comparing implementation complexities, it should be kept in mind that they may represent a nonnegligible computational effort for long LDPC codes. 5. Conclusion The study presented in this contribution has considered three specific high-rate LDPC codes to demonstrate that excellent performance can be achieved by LDPC coding for DSL transmission even with simple encoding/mapping schemes. We will complement the present study by presenting a family of LDPC codes and the specific symbol mapping scheme to be used for ADSL transmission. Performance under simulated impulse noise and coding/decoding latency are two important issues that will also be discussed, but our preliminary results indicate that the LDPC codes are no worse than turbo-codes from these aspects. LDPC codes offer net coding gains that are similar to the ones obtained with turbo-codes. They furthermore present some distinct advantages, including - the absence of error floors, - a low computational complexity, and - a wide range of trade-offs for implementation. We therefore propose to add as an open item in the issues list the use of LDPC codes as an alternative for advanced coding in G.dmt.bis and G.lite.bis. This contribution is to be presented under G.gen. BI-095.doc Page 11 of :59
12 References [1] Low-density parity-check codes, R. G. Gallager, IRE Trans. Info. Theory, vol. IT-8, pp. 1-8, Jan [] Near Shannon limit performance of low density parity check codes, D. J. C. MacKay and R. M. Neal, Electron. Lett., vol. 3, no. 18, pp , Aug [3] Good error-correcting codes based on very sparse matrices, D. J. C. MacKay, IEEE Trans. on Inform. Theory, vol. 45, No., pp , Mar [4] Near Shannon limit error-correcting coding and decoding: Turbo-codes, C. Berrou, A. Glavieux, and P. Thitimajshima, in Proc IEEE Int. Conf. on Communications, Geneva, Switzerland, pp , May [5] Optimal decoding of linear codes for minimizing symbol error rate, L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, IEEE Trans. on Inform. Theory, vol. IT-0, pp , Mar [6] On advanced signal processing and coding techniques for digital subscriber lines, G. Cherubini, E. Eleftheriou, and S. Ölçer, presented at the What is next in xdsl workshop, Vienna, Austria, September 15, 000. [7] Results of the requirements requested in the coding ad hoc report (BA-108R1) for the proposed turbo codes for ADSL modems by VoCAL Technologies Ltd in BA-00R1, Temporary Document HC-073, Study Group 15/4, Huntsville, Canada, 31 Jul. 4 Aug [8] Reduced complexity iterative decoding of low-density parity check codes based on belief propagation M. P. C. Fossorier, M. Mihaljevic, and H. Imai, IEEE Trans. Comm., vol. 47, No. 5, pp , May [9] Modulation and coding for linear Gaussian channels G. D. Forney and G. Ungerboeck, IEEE Trans. on Inform. Theory, vol. 44, No. 6, pp , Oct [10] Trellis precoding: combined coding, precoding and shaping for intersymbol interference channels M. V. Eyuboglu and G. D. Forney, IEEE Trans. on Inform. Theory, vol. 38, No., pp , Mar BI-095.doc Page 1 of :59
Low-Density Parity-Check Codes for Digital Subscriber Lines
Low-Density Parity-Check Codes for Digital Subscriber Lines E. Eleftheriou and S. Ölçer IBM Research, Zurich Research Laboratory 8803 Rüschlikon, Switzerland Abstract- The paper investigates the application
More informationn Based on the decision rule Po- Ning Chapter Po- Ning Chapter
n Soft decision decoding (can be analyzed via an equivalent binary-input additive white Gaussian noise channel) o The error rate of Ungerboeck codes (particularly at high SNR) is dominated by the two codewords
More informationTHE idea behind constellation shaping is that signals with
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 52, NO. 3, MARCH 2004 341 Transactions Letters Constellation Shaping for Pragmatic Turbo-Coded Modulation With High Spectral Efficiency Dan Raphaeli, Senior Member,
More informationPerformance Evaluation of Low Density Parity Check codes with Hard and Soft decision Decoding
Performance Evaluation of Low Density Parity Check codes with Hard and Soft decision Decoding Shalini Bahel, Jasdeep Singh Abstract The Low Density Parity Check (LDPC) codes have received a considerable
More informationMULTILEVEL CODING (MLC) with multistage decoding
350 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 52, NO. 3, MARCH 2004 Power- and Bandwidth-Efficient Communications Using LDPC Codes Piraporn Limpaphayom, Student Member, IEEE, and Kim A. Winick, Senior
More informationChapter 3 Convolutional Codes and Trellis Coded Modulation
Chapter 3 Convolutional Codes and Trellis Coded Modulation 3. Encoder Structure and Trellis Representation 3. Systematic Convolutional Codes 3.3 Viterbi Decoding Algorithm 3.4 BCJR Decoding Algorithm 3.5
More informationSIMULATIONS OF ERROR CORRECTION CODES FOR DATA COMMUNICATION OVER POWER LINES
SIMULATIONS OF ERROR CORRECTION CODES FOR DATA COMMUNICATION OVER POWER LINES Michelle Foltran Miranda Eduardo Parente Ribeiro mifoltran@hotmail.com edu@eletrica.ufpr.br Departament of Electrical Engineering,
More informationStudy of Turbo Coded OFDM over Fading Channel
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 3, Issue 2 (August 2012), PP. 54-58 Study of Turbo Coded OFDM over Fading Channel
More informationPerformance comparison of convolutional and block turbo codes
Performance comparison of convolutional and block turbo codes K. Ramasamy 1a), Mohammad Umar Siddiqi 2, Mohamad Yusoff Alias 1, and A. Arunagiri 1 1 Faculty of Engineering, Multimedia University, 63100,
More informationDigital Television Lecture 5
Digital Television Lecture 5 Forward Error Correction (FEC) Åbo Akademi University Domkyrkotorget 5 Åbo 8.4. Error Correction in Transmissions Need for error correction in transmissions Loss of data during
More informationPower Efficiency of LDPC Codes under Hard and Soft Decision QAM Modulated OFDM
Advance in Electronic and Electric Engineering. ISSN 2231-1297, Volume 4, Number 5 (2014), pp. 463-468 Research India Publications http://www.ripublication.com/aeee.htm Power Efficiency of LDPC Codes under
More informationPerformance of Nonuniform M-ary QAM Constellation on Nonlinear Channels
Performance of Nonuniform M-ary QAM Constellation on Nonlinear Channels Nghia H. Ngo, S. Adrian Barbulescu and Steven S. Pietrobon Abstract This paper investigates the effects of the distribution of a
More informationA Survey of Advanced FEC Systems
A Survey of Advanced FEC Systems Eric Jacobsen Minister of Algorithms, Intel Labs Communication Technology Laboratory/ Radio Communications Laboratory July 29, 2004 With a lot of material from Bo Xia,
More informationFOR THE PAST few years, there has been a great amount
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 53, NO. 4, APRIL 2005 549 Transactions Letters On Implementation of Min-Sum Algorithm and Its Modifications for Decoding Low-Density Parity-Check (LDPC) Codes
More informationIterative Decoding for MIMO Channels via. Modified Sphere Decoding
Iterative Decoding for MIMO Channels via Modified Sphere Decoding H. Vikalo, B. Hassibi, and T. Kailath Abstract In recent years, soft iterative decoding techniques have been shown to greatly improve the
More informationDecoding of Block Turbo Codes
Decoding of Block Turbo Codes Mathematical Methods for Cryptography Dedicated to Celebrate Prof. Tor Helleseth s 70 th Birthday September 4-8, 2017 Kyeongcheol Yang Pohang University of Science and Technology
More informationOutline. Communications Engineering 1
Outline Introduction Signal, random variable, random process and spectra Analog modulation Analog to digital conversion Digital transmission through baseband channels Signal space representation Optimal
More informationLow-density parity-check codes: Design and decoding
Low-density parity-check codes: Design and decoding Sarah J. Johnson Steven R. Weller School of Electrical Engineering and Computer Science University of Newcastle Callaghan, NSW 2308, Australia email:
More informationA Capacity Achieving and Low Complexity Multilevel Coding Scheme for ISI Channels
A Capacity Achieving and Low Complexity Multilevel Coding Scheme for ISI Channels arxiv:cs/0511036v1 [cs.it] 8 Nov 2005 Mei Chen, Teng Li and Oliver M. Collins Dept. of Electrical Engineering University
More informationNear-Optimal Low Complexity MLSE Equalization
Near-Optimal Low Complexity MLSE Equalization Abstract An iterative Maximum Likelihood Sequence Estimation (MLSE) equalizer (detector) with hard outputs, that has a computational complexity quadratic in
More informationMultilevel RS/Convolutional Concatenated Coded QAM for Hybrid IBOC-AM Broadcasting
IEEE TRANSACTIONS ON BROADCASTING, VOL. 46, NO. 1, MARCH 2000 49 Multilevel RS/Convolutional Concatenated Coded QAM for Hybrid IBOC-AM Broadcasting Sae-Young Chung and Hui-Ling Lou Abstract Bandwidth efficient
More informationQ-ary LDPC Decoders with Reduced Complexity
Q-ary LDPC Decoders with Reduced Complexity X. H. Shen & F. C. M. Lau Department of Electronic and Information Engineering, The Hong Kong Polytechnic University, Hong Kong Email: shenxh@eie.polyu.edu.hk
More informationTurbo Codes for Pulse Position Modulation: Applying BCJR algorithm on PPM signals
Turbo Codes for Pulse Position Modulation: Applying BCJR algorithm on PPM signals Serj Haddad and Chadi Abou-Rjeily Lebanese American University PO. Box, 36, Byblos, Lebanon serj.haddad@lau.edu.lb, chadi.abourjeily@lau.edu.lb
More informationOn Performance Improvements with Odd-Power (Cross) QAM Mappings in Wireless Networks
San Jose State University From the SelectedWorks of Robert Henry Morelos-Zaragoza April, 2015 On Performance Improvements with Odd-Power (Cross) QAM Mappings in Wireless Networks Quyhn Quach Robert H Morelos-Zaragoza
More informationMultitree Decoding and Multitree-Aided LDPC Decoding
Multitree Decoding and Multitree-Aided LDPC Decoding Maja Ostojic and Hans-Andrea Loeliger Dept. of Information Technology and Electrical Engineering ETH Zurich, Switzerland Email: {ostojic,loeliger}@isi.ee.ethz.ch
More informationMultiple-Bases Belief-Propagation for Decoding of Short Block Codes
Multiple-Bases Belief-Propagation for Decoding of Short Block Codes Thorsten Hehn, Johannes B. Huber, Stefan Laendner, Olgica Milenkovic Institute for Information Transmission, University of Erlangen-Nuremberg,
More informationA rate one half code for approaching the Shannon limit by 0.1dB
100 A rate one half code for approaching the Shannon limit by 0.1dB (IEE Electronics Letters, vol. 36, no. 15, pp. 1293 1294, July 2000) Stephan ten Brink S. ten Brink is with the Institute of Telecommunications,
More informationLinear Turbo Equalization for Parallel ISI Channels
860 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 51, NO. 6, JUNE 2003 Linear Turbo Equalization for Parallel ISI Channels Jill Nelson, Student Member, IEEE, Andrew Singer, Member, IEEE, and Ralf Koetter,
More informationPerformance Optimization of Hybrid Combination of LDPC and RS Codes Using Image Transmission System Over Fading Channels
European Journal of Scientific Research ISSN 1450-216X Vol.35 No.1 (2009), pp 34-42 EuroJournals Publishing, Inc. 2009 http://www.eurojournals.com/ejsr.htm Performance Optimization of Hybrid Combination
More informationNear-Optimal Low Complexity MLSE Equalization
Near-Optimal Low Complexity MLSE Equalization HC Myburgh and Jan C Olivier Department of Electrical, Electronic and Computer Engineering, University of Pretoria RSA Tel: +27-12-420-2060, Fax +27 12 362-5000
More informationISSN: ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 4, July 2013
Design and Implementation of -Ring-Turbo Decoder Riyadh A. Al-hilali Abdulkareem S. Abdallah Raad H. Thaher College of Engineering College of Engineering College of Engineering Al-Mustansiriyah University
More informationInternational Journal of Digital Application & Contemporary research Website: (Volume 1, Issue 7, February 2013)
Performance Analysis of OFDM under DWT, DCT based Image Processing Anshul Soni soni.anshulec14@gmail.com Ashok Chandra Tiwari Abstract In this paper, the performance of conventional discrete cosine transform
More informationIN 1993, powerful so-called turbo codes were introduced [1]
206 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 16, NO. 2, FEBRUARY 1998 Bandwidth-Efficient Turbo Trellis-Coded Modulation Using Punctured Component Codes Patrick Robertson, Member, IEEE, and
More informationOn the performance of Turbo Codes over UWB channels at low SNR
On the performance of Turbo Codes over UWB channels at low SNR Ranjan Bose Department of Electrical Engineering, IIT Delhi, Hauz Khas, New Delhi, 110016, INDIA Abstract - In this paper we propose the use
More informationConstellation Shaping for LDPC-Coded APSK
Constellation Shaping for LDPC-Coded APSK Matthew C. Valenti Lane Department of Computer Science and Electrical Engineering West Virginia University U.S.A. Mar. 14, 2013 ( Lane Department LDPCof Codes
More informationAn Improved Design of Gallager Mapping for LDPC-coded BICM-ID System
16 ELECTRONICS VOL. 2 NO. 1 JUNE 216 An Improved Design of Gallager Mapping for LDPC-coded BICM-ID System Lin Zhou Weicheng Huang Shengliang Peng Yan Chen and Yucheng He Abstract Gallager mapping uses
More informationTHE computational complexity of optimum equalization of
214 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 53, NO. 2, FEBRUARY 2005 BAD: Bidirectional Arbitrated Decision-Feedback Equalization J. K. Nelson, Student Member, IEEE, A. C. Singer, Member, IEEE, U. Madhow,
More informationHigh-Rate Non-Binary Product Codes
High-Rate Non-Binary Product Codes Farzad Ghayour, Fambirai Takawira and Hongjun Xu School of Electrical, Electronic and Computer Engineering University of KwaZulu-Natal, P. O. Box 4041, Durban, South
More informationMaster s Thesis Defense
Master s Thesis Defense Serially Concatenated Coded Continuous Phase Modulation for Aeronautical Telemetry Kanagaraj Damodaran August 14, 2008 Committee Dr. Erik Perrins (Chair) Dr. Victor Frost Dr. James
More information_ MAPequalizer _ 1: COD-MAPdecoder. : Interleaver. Deinterleaver. L(u)
Iterative Equalization and Decoding in Mobile Communications Systems Gerhard Bauch, Houman Khorram and Joachim Hagenauer Department of Communications Engineering (LNT) Technical University of Munich e-mail:
More informationDepartment of Electronic Engineering FINAL YEAR PROJECT REPORT
Department of Electronic Engineering FINAL YEAR PROJECT REPORT BEngECE-2009/10-- Student Name: CHEUNG Yik Juen Student ID: Supervisor: Prof.
More informationPerformance and Complexity Tradeoffs of Space-Time Modulation and Coding Schemes
Performance and Complexity Tradeoffs of Space-Time Modulation and Coding Schemes The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation
More informationIEEE C /02R1. IEEE Mobile Broadband Wireless Access <http://grouper.ieee.org/groups/802/mbwa>
23--29 IEEE C82.2-3/2R Project Title Date Submitted IEEE 82.2 Mobile Broadband Wireless Access Soft Iterative Decoding for Mobile Wireless Communications 23--29
More informationCombining Modern Codes and Set- Partitioning for Multilevel Storage Systems
Combining Modern Codes and Set- Partitioning for Multilevel Storage Systems Presenter: Sudarsan V S Ranganathan Additional Contributors: Kasra Vakilinia, Dariush Divsalar, Richard Wesel CoDESS Workshop,
More informationANALYSIS OF ADSL2 s 4D-TCM PERFORMANCE
ANALYSIS OF ADSL s 4D-TCM PERFORMANCE Mohamed Ghanassi, Jean François Marceau, François D. Beaulieu, and Benoît Champagne Department of Electrical & Computer Engineering, McGill University, Montreal, Quebec
More informationUsing TCM Techniques to Decrease BER Without Bandwidth Compromise. Using TCM Techniques to Decrease BER Without Bandwidth Compromise. nutaq.
Using TCM Techniques to Decrease BER Without Bandwidth Compromise 1 Using Trellis Coded Modulation Techniques to Decrease Bit Error Rate Without Bandwidth Compromise Written by Jean-Benoit Larouche INTRODUCTION
More informationIterative Joint Source/Channel Decoding for JPEG2000
Iterative Joint Source/Channel Decoding for JPEG Lingling Pu, Zhenyu Wu, Ali Bilgin, Michael W. Marcellin, and Bane Vasic Dept. of Electrical and Computer Engineering The University of Arizona, Tucson,
More informationConstruction of Adaptive Short LDPC Codes for Distributed Transmit Beamforming
Construction of Adaptive Short LDPC Codes for Distributed Transmit Beamforming Ismail Shakeel Defence Science and Technology Group, Edinburgh, South Australia. email: Ismail.Shakeel@dst.defence.gov.au
More informationNotes 15: Concatenated Codes, Turbo Codes and Iterative Processing
16.548 Notes 15: Concatenated Codes, Turbo Codes and Iterative Processing Outline! Introduction " Pushing the Bounds on Channel Capacity " Theory of Iterative Decoding " Recursive Convolutional Coding
More informationA low cost soft mapper for turbo equalization with high order modulation
University of Wollongong Research Online Faculty of Engineering and Information Sciences - Papers: Part A Faculty of Engineering and Information Sciences 2012 A low cost soft mapper for turbo equalization
More informationAN IMPROVED NEURAL NETWORK-BASED DECODER SCHEME FOR SYSTEMATIC CONVOLUTIONAL CODE. A Thesis by. Andrew J. Zerngast
AN IMPROVED NEURAL NETWORK-BASED DECODER SCHEME FOR SYSTEMATIC CONVOLUTIONAL CODE A Thesis by Andrew J. Zerngast Bachelor of Science, Wichita State University, 2008 Submitted to the Department of Electrical
More informationON THE PERFORMANCE OF ITERATIVE DEMAPPING AND DECODING TECHNIQUES OVER QUASI-STATIC FADING CHANNELS
ON THE PERFORMNCE OF ITERTIVE DEMPPING ND DECODING TECHNIQUES OVER QUSI-STTIC FDING CHNNELS W. R. Carson, I. Chatzigeorgiou and I. J. Wassell Computer Laboratory University of Cambridge United Kingdom
More informationFOR wireless applications on fading channels, channel
160 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 16, NO. 2, FEBRUARY 1998 Design and Analysis of Turbo Codes on Rayleigh Fading Channels Eric K. Hall and Stephen G. Wilson, Member, IEEE Abstract
More informationVector-LDPC Codes for Mobile Broadband Communications
Vector-LDPC Codes for Mobile Broadband Communications Whitepaper November 23 Flarion Technologies, Inc. Bedminster One 35 Route 22/26 South Bedminster, NJ 792 Tel: + 98-947-7 Fax: + 98-947-25 www.flarion.com
More informationImprovement Of Block Product Turbo Coding By Using A New Concept Of Soft Hamming Decoder
European Scientific Journal June 26 edition vol.2, No.8 ISSN: 857 788 (Print) e - ISSN 857-743 Improvement Of Block Product Turbo Coding By Using A New Concept Of Soft Hamming Decoder Alaa Ghaith, PhD
More informationRecent Progress in Mobile Transmission
Recent Progress in Mobile Transmission Joachim Hagenauer Institute for Communications Engineering () Munich University of Technology (TUM) D-80290 München, Germany State University of Telecommunications
More informationCapacity-Approaching Bandwidth-Efficient Coded Modulation Schemes Based on Low-Density Parity-Check Codes
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 9, SEPTEMBER 2003 2141 Capacity-Approaching Bandwidth-Efficient Coded Modulation Schemes Based on Low-Density Parity-Check Codes Jilei Hou, Student
More informationAdvanced channel coding : a good basis. Alexandre Giulietti, on behalf of the team
Advanced channel coding : a good basis Alexandre Giulietti, on behalf of the T@MPO team Errors in transmission are fowardly corrected using channel coding e.g. MPEG4 e.g. Turbo coding e.g. QAM source coding
More informationPERFORMANCE OF TWO LEVEL TURBO CODED 4-ARY CPFSK SYSTEMS OVER AWGN AND FADING CHANNELS
ISTANBUL UNIVERSITY JOURNAL OF ELECTRICAL & ELECTRONICS ENGINEERING YEAR VOLUME NUMBER : 006 : 6 : (07- ) PERFORMANCE OF TWO LEVEL TURBO CODED 4-ARY CPFSK SYSTEMS OVER AWGN AND FADING CHANNELS Ianbul University
More informationMultiple Input Multiple Output Dirty Paper Coding: System Design and Performance
Multiple Input Multiple Output Dirty Paper Coding: System Design and Performance Zouhair Al-qudah and Dinesh Rajan, Senior Member,IEEE Electrical Engineering Department Southern Methodist University Dallas,
More informationPhysical-Layer Network Coding Using GF(q) Forward Error Correction Codes
Physical-Layer Network Coding Using GF(q) Forward Error Correction Codes Weimin Liu, Rui Yang, and Philip Pietraski InterDigital Communications, LLC. King of Prussia, PA, and Melville, NY, USA Abstract
More informationFOR applications requiring high spectral efficiency, there
1846 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 52, NO. 11, NOVEMBER 2004 High-Rate Recursive Convolutional Codes for Concatenated Channel Codes Fred Daneshgaran, Member, IEEE, Massimiliano Laddomada, Member,
More informationCoding for the Slepian-Wolf Problem With Turbo Codes
Coding for the Slepian-Wolf Problem With Turbo Codes Jan Bajcsy and Patrick Mitran Department of Electrical and Computer Engineering, McGill University Montréal, Québec, HA A7, Email: {jbajcsy, pmitran}@tsp.ece.mcgill.ca
More informationRekha S.M, Manoj P.B. International Journal of Engineering and Advanced Technology (IJEAT) ISSN: , Volume-2, Issue-6, August 2013
Comparing the BER Performance of WiMAX System by Using Different Concatenated Channel Coding Techniques under AWGN, Rayleigh and Rician Fading Channels Rekha S.M, Manoj P.B Abstract WiMAX (Worldwide Interoperability
More informationIN data storage systems, run-length-limited (RLL) coding
IEEE TRANSACTIONS ON MAGNETICS, VOL. 44, NO. 9, SEPTEMBER 2008 2235 Low-Density Parity-Check Coded Recording Systems With Run-Length-Limited Constraints Hsin-Yi Chen 1, Mao-Chao Lin 1;2, and Yeong-Luh
More informationMULTIPATH fading could severely degrade the performance
1986 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 53, NO. 12, DECEMBER 2005 Rate-One Space Time Block Codes With Full Diversity Liang Xian and Huaping Liu, Member, IEEE Abstract Orthogonal space time block
More informationAn Improved Rate Matching Method for DVB Systems Through Pilot Bit Insertion
Research Journal of Applied Sciences, Engineering and Technology 4(18): 3251-3256, 2012 ISSN: 2040-7467 Maxwell Scientific Organization, 2012 Submitted: December 28, 2011 Accepted: March 02, 2012 Published:
More informationPerformance of Combined Error Correction and Error Detection for very Short Block Length Codes
Performance of Combined Error Correction and Error Detection for very Short Block Length Codes Matthias Breuninger and Joachim Speidel Institute of Telecommunications, University of Stuttgart Pfaffenwaldring
More informationContents Chapter 1: Introduction... 2
Contents Chapter 1: Introduction... 2 1.1 Objectives... 2 1.2 Introduction... 2 Chapter 2: Principles of turbo coding... 4 2.1 The turbo encoder... 4 2.1.1 Recursive Systematic Convolutional Codes... 4
More informationShort-Blocklength Non-Binary LDPC Codes with Feedback-Dependent Incremental Transmissions
Short-Blocklength Non-Binary LDPC Codes with Feedback-Dependent Incremental Transmissions Kasra Vakilinia, Tsung-Yi Chen*, Sudarsan V. S. Ranganathan, Adam R. Williamson, Dariush Divsalar**, and Richard
More informationLDPC Decoding: VLSI Architectures and Implementations
LDPC Decoding: VLSI Architectures and Implementations Module : LDPC Decoding Ned Varnica varnica@gmail.com Marvell Semiconductor Inc Overview Error Correction Codes (ECC) Intro to Low-density parity-check
More informationdesigning the inner codes Turbo decoding performance of the spectrally efficient RSCC codes is further evaluated in both the additive white Gaussian n
Turbo Decoding Performance of Spectrally Efficient RS Convolutional Concatenated Codes Li Chen School of Information Science and Technology, Sun Yat-sen University, Guangzhou, China Email: chenli55@mailsysueducn
More informationDEGRADED broadcast channels were first studied by
4296 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 54, NO 9, SEPTEMBER 2008 Optimal Transmission Strategy Explicit Capacity Region for Broadcast Z Channels Bike Xie, Student Member, IEEE, Miguel Griot,
More informationPolar Codes for Magnetic Recording Channels
Polar Codes for Magnetic Recording Channels Aman Bhatia, Veeresh Taranalli, Paul H. Siegel, Shafa Dahandeh, Anantha Raman Krishnan, Patrick Lee, Dahua Qin, Moni Sharma, and Teik Yeo University of California,
More informationERROR CONTROL CODING From Theory to Practice
ERROR CONTROL CODING From Theory to Practice Peter Sweeney University of Surrey, Guildford, UK JOHN WILEY & SONS, LTD Contents 1 The Principles of Coding in Digital Communications 1.1 Error Control Schemes
More informationThe BICM Capacity of Coherent Continuous-Phase Frequency Shift Keying
The BICM Capacity of Coherent Continuous-Phase Frequency Shift Keying Rohit Iyer Seshadri, Shi Cheng and Matthew C. Valenti Lane Dept. of Computer Sci. and Electrical Eng. West Virginia University Morgantown,
More informationBANDWIDTH EFFICIENT TURBO CODING FOR HIGH SPEED MOBILE SATELLITE COMMUNICATIONS
BANDWIDTH EFFICIENT TURBO CODING FOR HIGH SPEED MOBILE SATELLITE COMMUNICATIONS S. Adrian BARBULESCU, Wade FARRELL Institute for Telecommunications Research, University of South Australia, Warrendi Road,
More informationPerformance Analysis of Maximum Likelihood Detection in a MIMO Antenna System
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 50, NO. 2, FEBRUARY 2002 187 Performance Analysis of Maximum Likelihood Detection in a MIMO Antenna System Xu Zhu Ross D. Murch, Senior Member, IEEE Abstract In
More informationISSN: International Journal of Innovative Research in Science, Engineering and Technology
ISSN: 39-8753 Volume 3, Issue 7, July 4 Graphical User Interface for Simulating Convolutional Coding with Viterbi Decoding in Digital Communication Systems using Matlab Ezeofor C. J., Ndinechi M.C. Lecturer,
More informationECE 6640 Digital Communications
ECE 6640 Digital Communications Dr. Bradley J. Bazuin Assistant Professor Department of Electrical and Computer Engineering College of Engineering and Applied Sciences Chapter 8 8. Channel Coding: Part
More informationBlind Iterative Channel Identification and Equalization
Blind Iterative Channel Identification and Equalization R. R. Lopes and J. R. Barry School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta, GA 333-5 Abstract We propose an
More informationPROJECT 5: DESIGNING A VOICE MODEM. Instructor: Amir Asif
PROJECT 5: DESIGNING A VOICE MODEM Instructor: Amir Asif CSE4214: Digital Communications (Fall 2012) Computer Science and Engineering, York University 1. PURPOSE In this laboratory project, you will design
More informationSNR Estimation in Nakagami-m Fading With Diversity Combining and Its Application to Turbo Decoding
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 50, NO. 11, NOVEMBER 2002 1719 SNR Estimation in Nakagami-m Fading With Diversity Combining Its Application to Turbo Decoding A. Ramesh, A. Chockalingam, Laurence
More informationFPGA based Prototyping of Next Generation Forward Error Correction
Symposium: Real-time Digital Signal Processing for Optical Transceivers FPGA based Prototyping of Next Generation Forward Error Correction T. Mizuochi, Y. Konishi, Y. Miyata, T. Inoue, K. Onohara, S. Kametani,
More informationThe throughput analysis of different IR-HARQ schemes based on fountain codes
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the WCNC 008 proceedings. The throughput analysis of different IR-HARQ schemes
More informationEFFECTIVE CHANNEL CODING OF SERIALLY CONCATENATED ENCODERS AND CPM OVER AWGN AND RICIAN CHANNELS
EFFECTIVE CHANNEL CODING OF SERIALLY CONCATENATED ENCODERS AND CPM OVER AWGN AND RICIAN CHANNELS Manjeet Singh (ms308@eng.cam.ac.uk) Ian J. Wassell (ijw24@eng.cam.ac.uk) Laboratory for Communications Engineering
More informationEE 435/535: Error Correcting Codes Project 1, Fall 2009: Extended Hamming Code. 1 Introduction. 2 Extended Hamming Code: Encoding. 1.
EE 435/535: Error Correcting Codes Project 1, Fall 2009: Extended Hamming Code Project #1 is due on Tuesday, October 6, 2009, in class. You may turn the project report in early. Late projects are accepted
More informationLow-Density Parity-Check Codes for Volume Holographic Memory Systems
University of Massachusetts Amherst From the SelectedWorks of Hossein Pishro-Nik February 10, 2003 Low-Density Parity-Check Codes for Volume Holographic Memory Systems Hossein Pishro-Nik, University of
More informationImproved Modulation Classification using a Factor-Graph-based Iterative Receiver
Improved Modulation Classification using a Factor-Graph-based Iterative Receiver Daniel Jakubisin and R. Michael Buehrer Mobile and Portable Radio Research Group MPRG), Wireless@VT, Virginia Tech, Blacksburg,
More informationLDPC codes for OFDM over an Inter-symbol Interference Channel
LDPC codes for OFDM over an Inter-symbol Interference Channel Dileep M. K. Bhashyam Andrew Thangaraj Department of Electrical Engineering IIT Madras June 16, 2008 Outline 1 LDPC codes OFDM Prior work Our
More informationOn the reduced-complexity of LDPC decoders for ultra-high-speed optical transmission
On the reduced-complexity of LDPC decoders for ultra-high-speed optical transmission Ivan B Djordjevic, 1* Lei Xu, and Ting Wang 1 Department of Electrical and Computer Engineering, University of Arizona,
More informationClosing the Gap to the Capacity of APSK: Constellation Shaping and Degree Distributions
Closing the Gap to the Capacity of APSK: Constellation Shaping and Degree Distributions Xingyu Xiang and Matthew C. Valenti Lane Department of Computer Science and Electrical Engineering West Virginia
More informationSimplified a Posteriori Probability Calculation for Binary LDPC Codes
Pertanika J. Sci. & Technol. 26 (4): 1751-1763 (2018) SCIENCE & TECHNOLOGY Journal homepage: http://www.pertanika.upm.edu.my/ Simplified a Posteriori Probability Calculation for Binary LDPC Codes Mostari,
More informationOn short forward error-correcting codes for wireless communication systems
University of Wollongong Research Online Faculty of Engineering and Information Sciences - Papers: Part A Faculty of Engineering and Information Sciences 27 On short forward error-correcting codes for
More informationLab/Project Error Control Coding using LDPC Codes and HARQ
Linköping University Campus Norrköping Department of Science and Technology Erik Bergfeldt TNE066 Telecommunications Lab/Project Error Control Coding using LDPC Codes and HARQ Error control coding is an
More informationA Sphere Decoding Algorithm for MIMO
A Sphere Decoding Algorithm for MIMO Jay D Thakar Electronics and Communication Dr. S & S.S Gandhy Government Engg College Surat, INDIA ---------------------------------------------------------------------***-------------------------------------------------------------------
More informationA Novel Approach for FEC Decoding Based On the BP Algorithm in LTE and Wimax Systems
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn : 2278-8X, www.ijerd.com Volume 5, Issue 2 (December 22), PP. 06-13 A Novel Approach for FEC Decoding Based On the
More informationIEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 1, JANUARY
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 1, JANUARY 2004 31 Product Accumulate Codes: A Class of Codes With Near-Capacity Performance and Low Decoding Complexity Jing Li, Member, IEEE, Krishna
More information3GPP TSG RAN WG1 Meeting #85 R Decoding algorithm** Max-log-MAP min-sum List-X
3GPP TSG RAN WG1 Meeting #85 R1-163961 3GPP Nanjing, TSGChina, RAN23 WG1 rd 27Meeting th May 2016 #87 R1-1702856 Athens, Greece, 13th 17th February 2017 Decoding algorithm** Max-log-MAP min-sum List-X
More informationSerially Concatenated Coded Continuous Phase Modulation for Aeronautical Telemetry
Serially Concatenated Coded Continuous Phase Modulation for Aeronautical Telemetry c 2008 Kanagaraj Damodaran Submitted to the Department of Electrical Engineering & Computer Science and the Faculty of
More information