FEEDBACK does not increase the capacity of a discrete
|
|
- Shawn Montgomery
- 5 years ago
- Views:
Transcription
1 1 Sequential Differential Optimization of Incremental Redundancy Transmission Lengths: An Example with Tail-Biting Convolutional Codes Nathan Wong, Kasra Vailinia, Haobo Wang, Sudarsan V. S. Ranganathan, and Richard D. Wesel {nsc.wong, vailinia, whb12, sudarsanvsr, Abstract This paper applies the sequential differential optimization SDO algorithm to optimize the transmission lengths of incremental redundancy for a 124-state tail-biting convolutional code. The tail-biting reliability-output Viterbi algorithm is used to determine whether to inform the transmitter that a message has been successfully received or to request that the transmitter provide additional convolutional code bits. In order to maximize the average throughput, SDO is used to determine the rate of the initial codeword and the number of bits of incremental redundancy to be sent in each increment. With the help of SDO, this paper demonstrates a system that achieves 86.3 percent of the binary-input AWGN capacity for SNR 2 db with an average bloclength of symbols. I. INTRODUCTION FEEDB does not increase the capacity of a discrete memoryless channel [1], but it does provide benefits. Polyansiy et al. [2] show that transmitting incremental redundancy in response to feedbac can approach capacity at significantly shorter average bloclengths than a system without feedbac. This paper continues an exploration of incremental redundancy with feedbac where the transmission lengths have been optimized using sequential differential optimization SDO. The paper focuses on the specific example of a 124- state tail-biting convolutional code [3] on the 2 db binary-input BI additive white Gaussian noise AWGN channel. Short pacet communications are important for future wireless systems [4], and Liva et al. [5] confirm that tail-biting convolutional codes provide competitive performance at the short bloclengths considered in this paper, maing the use of TBCCs interesting in this context. For a message of bits of information, we consider a system that, based on feedbac, sends at most m transmissions that have lengths in symbols l 1,..., l m. To prove theoretical limits, Polyansiy et al. [2] focus on the limiting case in which feedbac is used to decide whether or not to transmit each subsequent symbol of possible incremental redundancy. Thus, the analysis of [2] considers a possibly infinite number of increments of length 1, i.e. m = and l j = 1, j. Williamson et al. [6] began to explore how closely capacity might be approached practically by using feedbac on the This research is supported in part by NSF grants CCF and CCF Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the NSF. This wor used computational and storage services associated with the Hoffman2 Shared Cluster provided by UCLA Institute for Digital Research and Education s Research Technology Group. BI-AWGN channel. Focusing on average bloclengths less than 15 symbols, they use a tail-biting convolutional code TBCC with a hybrid ARQ that uses a small number m = 5 of incremental transmissions. Incremental transmissions are facilitated by pseudo-random rate-compatible puncturing [7] [8] of a 124-state, rate-1/3 convolutional mother code with polynomials 2325, 2731, 3747 in octal. In [6], after receiving the j th increment, the tail-biting reliability-output Viterbi algorithm TB-ROVA developed in [9] provides the decoder with reliability information. The receiver uses this reliability information to instruct the transmitter via feedbac either to terminate or to send additional incremental redundancy in the j + 1 th transmission. Williamson et al. show simulation results in [6] that exceed the random-coding lower bound on achievability given in Theorem 3 of [2] using m = 5, with transmission lengths l 1,..., l 5 optimized by an exhaustive search. The complexity of optimization by exhaustive search prevented exploration of performance beyond m = 5 in [6]. Vailinia et al. [1] explore approaching capacity for larger average bloclengths approximately 15-5 symbols using a rate-compatible system based on non-binary LDPC codes with incremental redundancy, where feedbac requests additional incremental transmissions when the cyclic redundancy chec does not pass. Using m = 1 possible incremental transmissions, Vailinia et al. achieve a throughput of 93% of capacity at a frame error rate of 1 3 for an average bloclength of about 5 symbols. This result was facilitated by the technique of sequential differential optimization SDO developed in [1] that enables optimization of the lengths l 1,..., l m of numerous incremental transmissions without the need for exhaustive search. Empowered by the newly available SDO technique of [1], this paper returns to the question of what can be achieved with the system initially studied in [6]: a hybrid ARQ with average bloclengths below 15 symbols and using a 124-state tailbiting convolutional code and the TB-ROVA of [9] to decide when to request additional transmissions. The rest of the paper proceeds as follows: Section II provides a description of SDO. Section III shows the improved throughput achievable with increased m as well as a calculation of the throughput possible for this system in the limiting case when l j = 1 essentially m =. Section IV shows that for small enough values, the Gaussian rate model becomes inaccurate, and Section V concludes the paper.
2 2 II. SEQUENTIAL DIFFERENTIAL OPTIMIZATION SDO Consider a system that communicates a -bit message by using incremental redundancy to send up to m possible transmissions in an accumulation cycle. The transmissions have lengths of l 1,..., l m, where sending each additional transmission depends on /N feedbac. Each subsequent attempt in the accumulation cycle has the advantage of a successively larger cumulative bloclength of N i, where i N i = l j. 1 j=1 The decision of whether to send an to terminate the transmission or to send a N to request additional redundancy is based on an indicator of reliable decoding that is available at the receiver. In this paper that indicator is a reliability function computed by the ROVA algorithm of [9]. The receiver does not now whether it has truly decoded correctly; the ROVA threshold is designed to achieve a desired target probability of undetected error P UE. A decoding error is only possible when the receiver maes a final decision and an is sent, and all such errors are undetected. Let P Nj Nj and P N be the marginal probabilities of a decoding success or failure based on the reliability indicator when the decoder is presented with a received codeword having bloclength N j. Note that P Nj + P Nj N = 1. If decoding is still unsuccessful after all m decoding attempts in the accumulation cycle, the associated -bit message is not lost, rather the transmission is attempted again from scratch. This is referred to by Heindlmaier and Soljanin in [11] as a fixed incremental redundancy scheme, but as shown in [11] the loss from the infinite incremental redundancy scheme where m = is small when the failure rate is low. Let I be the number of successfully transmitted information bits in an accumulation cycle. Let N be the number of symbols transmitted in an accumulation cycle. The throughput rate R t is defined as where E[N] N 1 P N1 R t = E[I] E[N] = + m j=2 1 P Nm N P UE N j [ P Nj E[N], 2 ] P Nj 1 + N m P Nm N. The expression for E[N] above is an approximation because it assumes that if an was sent when decoding a message of length N j 1, then certainly an would also be sent when decoding the corresponding longer message with length N j. While observed to be true for the non-binary LDPC codes explored in [1], this is not true in general and specifically not the case for the convolutional codes explored in this paper. However, events where an would be followed by a N are relatively rare, and ignoring this effect simply leads to a slight underestimate of throughput by under-counting the s that occur for the first time on the j th attempt. To further simplify the optimization of R t, noting that E[I], maximizing R t is essentially equivalent to minimizing E[N]. TABLE I GAUSSIAN APPROXIMATION RESULTS OBTAINED USING BASED ON 1, AND 5, SAMPLES TO CREATE HISTOGRAM MODELED AS A GAUSSIAN CURVE TO FIND MEAN AND VARIANCE TO BE USED WITH SDO FOR m = 2 DECODING ATTEMPTS AND = 64 INFORMATION BITS Number of Samples Category 1 5 Mean Standard Deviation Transmission Lengths l j 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 2, 2, 3, 3, 96, 4, 3, 2, 2, 2, 2, 96, 4, 3, 2, 2, 2, 2, 3, 4, 5, 6, 1, 21 3, 4, 5, 6, 9, 18 R t λ At each bloclength N j there is an associated rate /N j at which decoding is either successful or not. In [1], the probability of the rate R s being the first successful decoding rate is modeled as a Gaussian distribution. Section II-A shows that this model is sufficiently accurate for a message size of = 64 for the specific system in question. Section II-B describes how SDO sequentially sets relevant derivatives to zero to identify an optimal set of bloclengths N 1,..., N m that minimizes E[N]. A. A Gaussian Approximation for the Highest Successful Rate To empirically determine a model for P Nj, or equivalently R s the decoder successively attempts decoding with the bloclength increasing one symbol at a time until the message is decoded successfully. This is performed for multiple iterations until an empirical p.m.f. is obtained with sufficient resolution and confidence. This must be done separately for each message length of bits that is considered. To model the empirical p.m.f. with a Gaussian, the mean and variance are estimated using linear regression applied to the following model P Nj Q /Nj µ s, 3 Here, Q is the probability of the tail of a Gaussian with zero mean and unit variance. The variable R s = /N j represents the rate at which a codeword is first successfully decoded. We can rearrange 3 to get the following: µ + Q 1 P Nj = R s, 4 where µ and are regression coefficients that we estimate by linear regression techniques to solve for mean and variance. We found that 1, simulation points are sufficient to estimate the regression coefficients for the = 64 case. A larger number of simulation points did not significantly affect the accuracy of the mean and variance estimates. Table I compares the linear regression estimates of mean and variance values for the example case of = 64 and m = 2 with the number of simulated points being 1, and 5, to illustrate that 1, is sufficient. Table I also provides the resulting values of l 1,..., l 2, the average bloclength λ = E[N], and the rate R t for these two examples.
3 3 Decoding Probability 1.8 Probability of Acnowledgement for = 64 GR Approximation Bloclength N i Fig. 1. Empirical probability of acnowledgement P N j as blac asteriss as a function of the bloclength N j for 5, simulation points for decoding the variable-rate 124-state TBCC over the AWGN channel with SNR 2. db and = 64. Also shown is the Gaussian approximation using the mean and variance computed by linear regression. Fig. 1 shows, for the = 64 case, the empirical probability of acnowledgement P Nj as blac asteriss as a function of the bloclength N j for 5, simulation points and also plots the approximation using the Gaussian rate model with the mean and variance computed by linear regression. We see that the Gaussian approximation fits the curve well. B. A Tree-based Approach for SDO Let, µ, and be fixed. For a given value of N 1, the optimal values of N i for i > 1 can be determined by solving a set of differential equations. Sequentially setting the derivatives of E[N] with respect to N i to zero as described in [1] yields the following equations: Q N 2 = N i = N s 1 Q N i 1 + N 1 Q N s 1 5 Q N s 1 + N i 1 Q Q N i 1 N i 1 Q N i 2 where 6 is for the case where i > 2. While 5 and 6 yield real numbers, the actual N i values must be integers. We create a tree that stores both the floor and ceiling of each solution, using 6 for both values until all m values of N i have been computed. Thus 2 m 1 sequences of potential bloclengths N 1,..., N m are computed for each candidate value of N 1 that is considered. Finally, from among these possibilities, the sequence of bloclengths N 1,..., N m that meets the required frame error rate FER and minimizes E[N] is selected. A lower complexity alternative is simply to compute all values of N i as real numbers. As a final step, each of these N i 6 TABLE II GAUSSIAN APPROXIMATION RESULTS FOR FLOOR-AND-CEILING AND STANDARD-ROUNDING APPROACHES OF CALCULATING TRANSMISSION LENGTHS USING SDO FOR m = 16 AND = 48 INFORMATION BITS SDO Approach and Method Category floor and ceiling standard rounding Transmission Lengths 73, 3, 2, 2, 2, 74, 3, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 3, 4, 5, 7, 14 2, 2, 2, 2, 2 Rate values is rounded in the standard way. This produces a single sequence of potential bloclengths N 1,..., N m rather than the 2 m 1 sequences produced by the floor-and-ceiling approach. Table II compares the tree-based floor-and-ceiling approach to the standard-rounding approach for = 48 and m = 16. Not surprisingly, the simpler standard-rounding approach achieves lower rates than the floor-and-ceiling approach. The benefits of the floor-and-ceiling approach go beyond an exhaustive solution to the integer constraint problem. The SDO equations 5 and 6 inherently assume an infinite number of transmissions can be sent, but we will only use the first m. The tree produced by the floor-and-ceiling provides a set of solutions in the neighborhood of the infinite transmissions solutions from which the best solution for a finite m value can be identified. This is seen in Table II where the floorand-ceiling approach uses longer increments at the end of the finite-length horizon whereas the standard approach does not. For large values of m, it is computationally prohibitive to perform a full floor-and-ceiling search for every possible value of N 1. For these cases, we used a "targeted" floor-and-ceiling approach in which the SDO equations are used to produce a single real-valued N i sequence for each possible integervalued N 1. The N 1 whose induced real-valued sequence produced the best smallest value of E[N] is then used in a floor-and-ceiling search to identify the best set of integer N i values for that N 1. We used the full tree-based floor-andceiling approach below for m {4, 8, 16} and the targeted floor-and-ceiling approach for m = 32. III. APPLYING SDO TO 124-STATE TBCC WITH = 64 As an initial sanity chec, we compare the throughput results for m = 5 obtained using SDO to the results of [6] using exhaustive search. Table III confirms that the transmission lengths l 1,..., l 5 are very similar. Fig. 2 confirms that the throughput values are quite similar. TABLE III ES AND SDO TRANSMISSION LENGTHS FOR m = 5 FOR VARIOUS Transmission Lengths l 1,..., l 5 Info. Bits Exhaustive Search Sequen. Diff. Opt , 4, 4, 4, 7 29, 3, 3, 4, , 5, 5, 7, 12 55, 5, 5, 7, , 7, 7, 9, 16 8, 6, 6, 8, , 9, 9, 12, 22 16, 8, 8, 1, , 13, 14, 17, , 12, 12, 16, 3
4 =16 =32 =48 =64 =91 BI-AWGN capacity Random coding lower bound [2] m= m=32, SDO m=5, Exhaustive Search [3] m=5, SDO R t =/E[N] =16,32,48,64, Expected Bloclength E[N] Fig. 2. Throughput rate R t as a function of average bloclength E[N] for the = 64, 124-state TBCC transmission scheme with lengths determined by SDO for m = 5 and m = 32 and by exhaustive search for m = 5 simulated over the BI-AWGN channel with SNR 2. db and target probability of error P UE = 1 3. Also shown for reference are the BI-AWGN capacity of 42 bits at 2 db, the random coding lower bound of [2], and the m = R t predicted by the Gaussian approximation illustrated in Fig. 1 A. Throughput with an Increased Number of Transmissions Fig. 2 shows throughput rate R t as a function of expected bloclength E[N] for the incremental redundancy system studied in Williamson et al. [6] using a 124-state TBCC with feedbac controlling m = 5 possible incremental transmissions. Larger values of m were not considered in [6] because exhaustive search could not find optimal transmission lengths for m > 5. However, even with m = 5 the system exceeds the random coding lower bound of [2] for 37 < E[N] < 8. SDO facilitates characterization of performance for larger values of m. Fig. 2 shows that a consistent throughput increase of about.26 bits is achieved by increasing m = 5 to m = 32 possible incremental transmissions. With m = 32, the random coding lower bound is exceeded for 35 < E[N] < 12, a larger range than for m = 5. Moreover, the theoretical curve in Fig. 2 for m = obtained by using the Gaussian approximation on R s shown in Fig. 1 reveals that no significant improvement is expected for m > 32. Fig. 2 shows that for = 91 the throughput R t decreases in contrast to the random coding lower bound, which monotonically increases with average bloclength. As pointed out in [6], convolutional code frame error rate performance degrades once the bloclength is beyond twice Anderson s analytical decision depth [12]. Thus, it is not surprising to see R t begin to decrease as bloclength increases for a convolutional code with a fixed number of memory elements. The highest throughput point is = 64 and m = 32 which achieves 86.3% of BI-AWGN capacity with an E[N] of symbols as compared to the m = 5 system which achieves 82.2% of capacity with an E[N] of symbols. Receiver complexity and overall system complexity increase with m. However, as shown in Figs. 3 and 4, the complexity increase is less than might be expected. Fig. 3 shows that the average number of transmissions for the = 64 case that Average Number of Transmissions Maximum Number of Transmission Lengths m Fig. 3. Average number of transmissions in an accumulation cycle as a function of m for = 64 TBCC with lengths determined by SDO except for m = 11 where all lengths are 1 simulated over the BI-AWGN channel with SNR 2. db and target probability of error P UE = 1 3. Average / m Maximum Number of Transmission Lengths m Fig. 4. Ratio of the average number of transmissions in an accumulation cycle divided by m for the same system and channel as Fig. 3 maximizes throughput is 1 even when m = 32. Fig. 4 shows that as m increases the average number of transmissions becomes a smaller fraction of m. Indeed, when m = 11, which is essentially m = since the increments are all a single symbol and decoding starts at N 1 = 92 which has a very low P 92 from Fig. 1, the average number of transmissions for the = 64 system computed by simulation is only Fig. 5 shows simulated throughput for m {4, 8, 16, 32}. Throughput increases with m, but by m = 32, throughput results are near the limiting curve of m = =16 =32 =48 =64 =91 m=4 m=8 m=16 m=32 m= R t =/E[N] =16,32,48,64, Expected Bloclength E[N] Fig. 5. R t as a function of E[N] for the same channel as Fig. 2 with lengths determined by SDO for various values of m.
5 = E[N] 125 = E[N] 66 = E[N] 38 = E[N] 177 GR-Model Number of Transmissions log 2 m Probability of Acnowledgement Probability of Acnowledgement for = 16 GR Approximation Bloclength N j Fig. 6. R t as a function of m for various values of both from simulation and computed using the Gaussian rate model shown in Fig. 1 for the 124- state TBCC over the BI-AWGN channel with SNR 2. db. Fig. 7. Empirical probability of acnowledgement and its approximation based on a Gaussian rate model for decoding the variable-rate 124-state TBCC over the AWGN channel with SNR 2. db and = 16. IV. GAUSSIAN RATE MODEL INACCURATE FOR < 64 The Gaussian rate model for computing P Nj in 3 can be used to compute an approximation of R t using 2, which can be compared with the simulated R t. Fig. 6 compares R t results obtained by simulation with R t values computed using the Gaussian model illustrated in Fig. 1. For lower values of, the difference between the values computed using the model and the simulation results is significant. This reveals limitations in the Gaussian model of rate for smaller values of. To further examine the limitations of the Gaussian rate model, Fig. 7 shows, for the = 16 case, the empirical probability of acnowledgement P Nj as blac asteriss as a function of the bloclength N j for 5, simulation points and also plots the approximation using the Gaussian rate model with the mean and variance computed by linear regression. For this case, the Gaussian rate model simply does not match the behavior produced by simulation. In a future wor, we explore this disparity and develop a more refined model that wors well even for these very small values of. V. CONCLUSION Sequential differential optimization SDO, introduced in [1], provides a way to optimize a large number of incremental transmission lengths to maximize the throughput of systems that use /N feedbac to control transmissions of incremental redundancy. In this paper, we used SDO to improve the throughputs obtained in [6] by using a larger number of incremental transmissions. As in [1], for the = 64 case, the Gaussian rate model provides an accurate model of the probability of successful decoding and acnowledgement observed in simulation. For the = 64 case, by increasing the maximum number of incremental transmissions from m = 5 to m = 32, the throughput R t was increased from 82.2% of BI-AWGN capacity to 86.3%, a value which exceeds the random coding lower bound of [2] at its corresponding average bloclength of symbols. Although the Gaussian rate model proved to be excellent for = 64, for smaller values of it does not accurately characterize the probability of acnowledgement. An area of ongoing investigation is to develop a model that remains accurate for small values of. Another area of investigation is to explicitly include the finite-m constraint in the SDO computation. As it is, SDO optimizes transmission lengths assuming an infinite sequence of transmissions. Finally, TBCCs with more states should achieve an even greater percentage of capacity. REFERENCES [1] C. E. Shannon, The zero error capacity of a noisy channel, IRE Trans. Inf. Theory, vol. 2, no. 3, pp. 8 19, Sep [2] Y. Polyansiy, H. V. Poor, and S. Verdu, Feedbac in the nonasymptotic regime, IEEE Trans. Inf. Theory, vol. 57, no. 8, pp , August 211. [3] H. Ma and J. Wolf, On tail biting convolutional codes, IEEE Trans. Comm., vol. 34, no. 2, pp , Feb [4] G. Durisi, T. Koch, and P. Popovsi, Toward massive, ultrareliable, and low-latency wireless communication with short pacets, Proc. of the IEEE, vol. 14, no. 9, pp , Sept 216. [5] G. Liva, L. Gaudio, N. Tudor, and T. Jerovits, Code design for short blocs: A survey, arxiv, 216, v1. [6] A. R. Williamson, T.-Y. Chen, and R. D. Wesel, Variable-length convolutional coding for short bloclengths with decision feedbac, IEEE Trans. Comm., vol. 63, no. 7, pp , July 215. [7] J. Hagenauer, Rate-compatible punctured convolutional codes rcpc codes and their applications, IEEE Trans. Comm., vol. 36, no. 4, pp , Apr [8] K. M. Rege and S. Nanda, Irreducible FER for convolutional codes with random bit puncturing: application to cdma forward channel, in Proc. of Veh.Tech. Conf. - VTC, vol. 2, Apr 1996, pp vol.2. [9] A. R. Williamson, M. J. Marshall, and R. D. Wesel, Reliabilityoutput decoding of tail-biting convolutional codes, IEEE Trans. Comm., vol. 62, no. 6, pp , June 214. [1] K. Vailinia, S. V. S. Ranganathan, D. Divsalar, and R. D. Wesel, Optimizing transmission lengths for limited feedbac with nonbinary ldpc examples, IEEE Trans. Comm., vol. 64, no. 6, pp , June 216. [11] M. Heindlmaier and E. Soljanin, Isn t hybrid ARQ sufficient? in 52nd Annu. Allerton Conf. Commun., Control, and Computing Allerton, Sep. 214, pp [12] J. B. Anderson and K. Balachandran, Decision depths of convolutional codes, IEEE Trans. Inf. Theory, vol. 35, no. 2, pp , Mar 1989.
International Zurich Seminar on Communications (IZS), March 2 4, 2016
Resource-Aware Incremental Redundancy in Feedbac and Broadcast Richard D. Wesel, Kasra Vailinia, Sudarsan V. S. Ranganathan, Tong Mu University of California, Los Angeles, CA 90095 Email: {wesel,vailinia,
More informationOptimizing Flash based Storage Systems
Optimizing Flash based Storage Systems 1 Lifetime Reliability Latency Throughput 2 Projects Reliability/Latency/Throughput: Error Correction Code (ECC) Parallelization and Incremental Redundancy Lifetime:
More informationTransmitting k samples over the Gaussian channel: energy-distortion tradeoff
Transmitting samples over the Gaussian channel: energy-distortion tradeoff Victoria Kostina Yury Polyansiy Sergio Verdú California Institute of Technology Massachusetts Institute of Technology Princeton
More informationRCA Analysis of the Polar Codes and the use of Feedback to aid Polarization at Short Blocklengths
RCA Analysis of the Polar Codes and the use of Feedback to aid Polarization at Short Blocklengths Kasra Vakilinia, Dariush Divsalar*, and Richard D. Wesel Department of Electrical Engineering, University
More informationChannel Codes for Short Blocks: A Survey
11th International ITG Conference on Systems, Communications and Coding February 6, 2017 Channel Codes for Short Blocks: A Survey Gianluigi Liva, gianluigi.liva@dlr.de Fabian Steiner, fabian.steiner@tum.de
More informationMaking Error Correcting Codes Work for Flash Memory
Making Error Correcting Codes Work for Flash Memory Part I: Primer on ECC, basics of BCH and LDPC codes Lara Dolecek Laboratory for Robust Information Systems (LORIS) Center on Development of Emerging
More informationGraph-based codes for flash memory
1/28 Graph-based codes for flash memory Discrete Mathematics Seminar September 3, 2013 Katie Haymaker Joint work with Professor Christine Kelley University of Nebraska-Lincoln 2/28 Outline 1 Background
More informationTHIS paper is aimed at designing efficient decoding algorithms
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 45, NO. 7, NOVEMBER 1999 2333 Sort-and-Match Algorithm for Soft-Decision Decoding Ilya Dumer, Member, IEEE Abstract Let a q-ary linear (n; k)-code C be used
More informationSC-Fano Decoding of Polar Codes
SC-Fano Decoding of Polar Codes Min-Oh Jeong and Song-Nam Hong Ajou University, Suwon, Korea, email: {jmo0802, snhong}@ajou.ac.kr arxiv:1901.06791v1 [eess.sp] 21 Jan 2019 Abstract In this paper, we present
More informationIN this paper, we consider the capacity of sticky channels, a
72 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 1, JANUARY 2008 Capacity Bounds for Sticky Channels Michael Mitzenmacher, Member, IEEE Abstract The capacity of sticky channels, a subclass of insertion
More informationImage Dependent Log-likelihood Ratio Allocation for Repeat Accumulate Code based Decoding in Data Hiding Channels
Image Dependent Log-likelihood Ratio Allocation for Repeat Accumulate Code based Decoding in Data Hiding Channels Anindya Sarkar and B. S. Manjunath Department of Electrical and Computer Engineering, University
More informationPractical Polar Code Construction Using Generalised Generator Matrices
Practical Polar Code Construction Using Generalised Generator Matrices Berksan Serbetci and Ali E. Pusane Department of Electrical and Electronics Engineering Bogazici University Istanbul, Turkey E-mail:
More informationIntroduction to Wireless & Mobile Systems. Chapter 4. Channel Coding and Error Control Cengage Learning Engineering. All Rights Reserved.
Introduction to Wireless & Mobile Systems Chapter 4 Channel Coding and Error Control 1 Outline Introduction Block Codes Cyclic Codes CRC (Cyclic Redundancy Check) Convolutional Codes Interleaving Information
More informationSOFT DECISION FANO DECODING OF BLOCK CODES OVER DISCRETE MEMORYLESS CHANNEL USING TREE DIAGRAM
Journal of ELECTRICAL ENGINEERING, VOL. 63, NO. 1, 2012, 59 64 SOFT DECISION FANO DECODING OF BLOCK CODES OVER DISCRETE MEMORYLESS CHANNEL USING TREE DIAGRAM H. Prashantha Kumar Udupi Sripati K. Rajesh
More informationRate-Compatible Low Density Parity Check Codes for Capacity-Approaching ARQ Schemes in Packet Data Communications
Rate-Compatible Low Density Parity Check Codes for Capacity-Approaching ARQ Schemes in Packet Data Communications Jing Li (Tiffany) Electrical Engineering Dept, Texas A&M University College Station, TX
More informationLecture 12. Block Diagram
Lecture 12 Goals Be able to encode using a linear block code Be able to decode a linear block code received over a binary symmetric channel or an additive white Gaussian channel XII-1 Block Diagram Data
More informationPerformance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels
Performance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels Jilei Hou, Paul H. Siegel and Laurence B. Milstein Department of Electrical and Computer Engineering
More informationThe Effect of Memory Order on the Capacity of Finite-State Markov and Flat-Fading Channels
The Effect of Memory Order on the Capacity of Finite-State Markov and Flat-Fading Channels Parastoo Sadeghi National ICT Australia (NICTA) Sydney NSW 252 Australia Email: parastoo@student.unsw.edu.au Predrag
More informationCSCI 2570 Introduction to Nanocomputing
CSCI 2570 Introduction to Nanocomputing Information Theory John E Savage What is Information Theory Introduced by Claude Shannon. See Wikipedia Two foci: a) data compression and b) reliable communication
More informationPerformance of Multi Binary Turbo-Codes on Nakagami Flat Fading Channels
Buletinul Ştiinţific al Universităţii "Politehnica" din Timişoara Seria ELECTRONICĂ şi TELECOMUNICAŢII TRANSACTIONS on ELECTRONICS and COMMUNICATIONS Tom 5(65), Fascicola -2, 26 Performance of Multi Binary
More informationExact Probability of Erasure and a Decoding Algorithm for Convolutional Codes on the Binary Erasure Channel
Exact Probability of Erasure and a Decoding Algorithm for Convolutional Codes on the Binary Erasure Channel Brian M. Kurkoski, Paul H. Siegel, and Jack K. Wolf Department of Electrical and Computer Engineering
More informationImproved Successive Cancellation Flip Decoding of Polar Codes Based on Error Distribution
Improved Successive Cancellation Flip Decoding of Polar Codes Based on Error Distribution Carlo Condo, Furkan Ercan, Warren J. Gross Department of Electrical and Computer Engineering, McGill University,
More informationTurbo Compression. Andrej Rikovsky, Advisor: Pavol Hanus
Turbo Compression Andrej Rikovsky, Advisor: Pavol Hanus Abstract Turbo codes which performs very close to channel capacity in channel coding can be also used to obtain very efficient source coding schemes.
More informationOn a Problem of Massey
On a Problem of Massey Jon Hamkins Jet Propulsion Laboratory California Institute of Technology Pasadena, CA 909, USA Email: Jon.Hamkins@jpl.nasa.gov Abstract In 976, Massey introduced a method to compute
More informationTurbo Codes for Deep-Space Communications
TDA Progress Report 42-120 February 15, 1995 Turbo Codes for Deep-Space Communications D. Divsalar and F. Pollara Communications Systems Research Section Turbo codes were recently proposed by Berrou, Glavieux,
More informationDesign of Non-Binary Quasi-Cyclic LDPC Codes by Absorbing Set Removal
Design of Non-Binary Quasi-Cyclic LDPC Codes by Absorbing Set Removal Behzad Amiri Electrical Eng. Department University of California, Los Angeles Los Angeles, USA Email: amiri@ucla.edu Jorge Arturo Flores
More informationCSE 123: Computer Networks
CSE 123: Computer Networks Total points: 40 Homework 1 - Solutions Out: 10/4, Due: 10/11 Solutions 1. Two-dimensional parity Given below is a series of 7 7-bit items of data, with an additional bit each
More informationVariable-Rate Universal Slepian-Wolf Coding with Feedback
Variable-Rate Universal Slepian-Wolf Coding with Feedback Shriram Sarvotham, Dror Baron, and Richard G. Baraniuk Dept. of Electrical and Computer Engineering Rice University, Houston, TX 77005 Abstract
More informationCodes on graphs and iterative decoding
Codes on graphs and iterative decoding Bane Vasić Error Correction Coding Laboratory University of Arizona Prelude Information transmission 0 0 0 0 0 0 Channel Information transmission signal 0 0 threshold
More informationGraph-based Codes for Quantize-Map-and-Forward Relaying
20 IEEE Information Theory Workshop Graph-based Codes for Quantize-Map-and-Forward Relaying Ayan Sengupta, Siddhartha Brahma, Ayfer Özgür, Christina Fragouli and Suhas Diggavi EPFL, Switzerland, UCLA,
More informationCS6304 / Analog and Digital Communication UNIT IV - SOURCE AND ERROR CONTROL CODING PART A 1. What is the use of error control coding? The main use of error control coding is to reduce the overall probability
More information16.36 Communication Systems Engineering
MIT OpenCourseWare http://ocw.mit.edu 16.36 Communication Systems Engineering Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 16.36: Communication
More informationInformation Theoretic Imaging
Information Theoretic Imaging WU Faculty: J. A. O Sullivan WU Doctoral Student: Naveen Singla Boeing Engineer: James Meany First Year Focus: Imaging for Data Storage Image Reconstruction Data Retrieval
More informationError Floors of LDPC Coded BICM
Electrical and Computer Engineering Conference Papers, Posters and Presentations Electrical and Computer Engineering 2007 Error Floors of LDPC Coded BICM Aditya Ramamoorthy Iowa State University, adityar@iastate.edu
More informationCooperative HARQ with Poisson Interference and Opportunistic Routing
Cooperative HARQ with Poisson Interference and Opportunistic Routing Amogh Rajanna & Mostafa Kaveh Department of Electrical and Computer Engineering University of Minnesota, Minneapolis, MN USA. Outline
More informationChapter 9 Fundamental Limits in Information Theory
Chapter 9 Fundamental Limits in Information Theory Information Theory is the fundamental theory behind information manipulation, including data compression and data transmission. 9.1 Introduction o For
More informationECE 564/645 - Digital Communications, Spring 2018 Homework #2 Due: March 19 (In Lecture)
ECE 564/645 - Digital Communications, Spring 018 Homework # Due: March 19 (In Lecture) 1. Consider a binary communication system over a 1-dimensional vector channel where message m 1 is sent by signaling
More information4 An Introduction to Channel Coding and Decoding over BSC
4 An Introduction to Channel Coding and Decoding over BSC 4.1. Recall that channel coding introduces, in a controlled manner, some redundancy in the (binary information sequence that can be used at the
More informationCooperative Spectrum Sensing for Cognitive Radios under Bandwidth Constraints
Cooperative Spectrum Sensing for Cognitive Radios under Bandwidth Constraints Chunhua Sun, Wei Zhang, and haled Ben Letaief, Fellow, IEEE Department of Electronic and Computer Engineering The Hong ong
More informationSingle-Gaussian Messages and Noise Thresholds for Low-Density Lattice Codes
Single-Gaussian Messages and Noise Thresholds for Low-Density Lattice Codes Brian M. Kurkoski, Kazuhiko Yamaguchi and Kingo Kobayashi kurkoski@ice.uec.ac.jp Dept. of Information and Communications Engineering
More informationTurbo Code Design for Short Blocks
Turbo Code Design for Short Blocks Thomas Jerkovits, Balázs Matuz Abstract This work considers the design of short parallel turbo codes (PTCs) with block lengths in the order of (a few) hundred code bits.
More informationSIPCom8-1: Information Theory and Coding Linear Binary Codes Ingmar Land
SIPCom8-1: Information Theory and Coding Linear Binary Codes Ingmar Land Ingmar Land, SIPCom8-1: Information Theory and Coding (2005 Spring) p.1 Overview Basic Concepts of Channel Coding Block Codes I:
More informationNew Puncturing Pattern for Bad Interleavers in Turbo-Codes
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 6, No. 2, November 2009, 351-358 UDK: 621.391.7:004.052.4 New Puncturing Pattern for Bad Interleavers in Turbo-Codes Abdelmounaim Moulay Lakhdar 1, Malika
More informationChapter 7: Channel coding:convolutional codes
Chapter 7: : Convolutional codes University of Limoges meghdadi@ensil.unilim.fr Reference : Digital communications by John Proakis; Wireless communication by Andreas Goldsmith Encoder representation Communication
More informationChannel Coding I. Exercises SS 2017
Channel Coding I Exercises SS 2017 Lecturer: Dirk Wübben Tutor: Shayan Hassanpour NW1, Room N 2420, Tel.: 0421/218-62387 E-mail: {wuebben, hassanpour}@ant.uni-bremen.de Universität Bremen, FB1 Institut
More informationFault Tolerance Technique in Huffman Coding applies to Baseline JPEG
Fault Tolerance Technique in Huffman Coding applies to Baseline JPEG Cung Nguyen and Robert G. Redinbo Department of Electrical and Computer Engineering University of California, Davis, CA email: cunguyen,
More informationAdvances in Error Control Strategies for 5G
Advances in Error Control Strategies for 5G Jörg Kliewer The Elisha Yegal Bar-Ness Center For Wireless Communications And Signal Processing Research 5G Requirements [Nokia Networks: Looking ahead to 5G.
More informationLower Bounds on the Graphical Complexity of Finite-Length LDPC Codes
Lower Bounds on the Graphical Complexity of Finite-Length LDPC Codes Igal Sason Department of Electrical Engineering Technion - Israel Institute of Technology Haifa 32000, Israel 2009 IEEE International
More informationCodes on graphs and iterative decoding
Codes on graphs and iterative decoding Bane Vasić Error Correction Coding Laboratory University of Arizona Funded by: National Science Foundation (NSF) Seagate Technology Defense Advanced Research Projects
More informationThe Capacity of the Semi-Deterministic Cognitive Interference Channel and its Application to Constant Gap Results for the Gaussian Channel
The Capacity of the Semi-Deterministic Cognitive Interference Channel and its Application to Constant Gap Results for the Gaussian Channel Stefano Rini, Daniela Tuninetti, and Natasha Devroye Department
More informationAn Introduction to Low Density Parity Check (LDPC) Codes
An Introduction to Low Density Parity Check (LDPC) Codes Jian Sun jian@csee.wvu.edu Wireless Communication Research Laboratory Lane Dept. of Comp. Sci. and Elec. Engr. West Virginia University June 3,
More informationAdaptive Cut Generation for Improved Linear Programming Decoding of Binary Linear Codes
Adaptive Cut Generation for Improved Linear Programming Decoding of Binary Linear Codes Xiaojie Zhang and Paul H. Siegel University of California, San Diego, La Jolla, CA 9093, U Email:{ericzhang, psiegel}@ucsd.edu
More informationConvolutional Codes ddd, Houshou Chen. May 28, 2012
Representation I, II Representation III, IV trellis of Viterbi decoding Turbo codes Convolutional Codes ddd, Houshou Chen Department of Electrical Engineering National Chung Hsing University Taichung,
More informationEVALUATION OF PACKET ERROR RATE IN WIRELESS NETWORKS
EVALUATION OF PACKET ERROR RATE IN WIRELESS NETWORKS Ramin Khalili, Kavé Salamatian LIP6-CNRS, Université Pierre et Marie Curie. Paris, France. Ramin.khalili, kave.salamatian@lip6.fr Abstract Bit Error
More informationCoding theory: Applications
INF 244 a) Textbook: Lin and Costello b) Lectures (Tu+Th 12.15-14) covering roughly Chapters 1,9-12, and 14-18 c) Weekly exercises: For your convenience d) Mandatory problem: Programming project (counts
More informationOn the Computation of EXIT Characteristics for Symbol-Based Iterative Decoding
On the Computation of EXIT Characteristics for Symbol-Based Iterative Decoding Jörg Kliewer, Soon Xin Ng 2, and Lajos Hanzo 2 University of Notre Dame, Department of Electrical Engineering, Notre Dame,
More informationAnalysis of Sum-Product Decoding of Low-Density Parity-Check Codes Using a Gaussian Approximation
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 2, FEBRUARY 2001 657 Analysis of Sum-Product Decoding of Low-Density Parity-Check Codes Using a Gaussian Approximation Sae-Young Chung, Member, IEEE,
More informationLDPC Codes. Intracom Telecom, Peania
LDPC Codes Alexios Balatsoukas-Stimming and Athanasios P. Liavas Technical University of Crete Dept. of Electronic and Computer Engineering Telecommunications Laboratory December 16, 2011 Intracom Telecom,
More informationRun-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE
General e Image Coder Structure Motion Video x(s 1,s 2,t) or x(s 1,s 2 ) Natural Image Sampling A form of data compression; usually lossless, but can be lossy Redundancy Removal Lossless compression: predictive
More informationThe Poisson Channel with Side Information
The Poisson Channel with Side Information Shraga Bross School of Enginerring Bar-Ilan University, Israel brosss@macs.biu.ac.il Amos Lapidoth Ligong Wang Signal and Information Processing Laboratory ETH
More informationRoll No. :... Invigilator's Signature :.. CS/B.TECH(ECE)/SEM-7/EC-703/ CODING & INFORMATION THEORY. Time Allotted : 3 Hours Full Marks : 70
Name : Roll No. :.... Invigilator's Signature :.. CS/B.TECH(ECE)/SEM-7/EC-703/2011-12 2011 CODING & INFORMATION THEORY Time Allotted : 3 Hours Full Marks : 70 The figures in the margin indicate full marks
More informationAnalytical Performance of One-Step Majority Logic Decoding of Regular LDPC Codes
Analytical Performance of One-Step Majority Logic Decoding of Regular LDPC Codes Rathnakumar Radhakrishnan, Sundararajan Sankaranarayanan, and Bane Vasić Department of Electrical and Computer Engineering
More informationChapter 7 Reed Solomon Codes and Binary Transmission
Chapter 7 Reed Solomon Codes and Binary Transmission 7.1 Introduction Reed Solomon codes named after Reed and Solomon [9] following their publication in 1960 have been used together with hard decision
More informationLow-Complexity Fixed-to-Fixed Joint Source-Channel Coding
Low-Complexity Fixed-to-Fixed Joint Source-Channel Coding Irina E. Bocharova 1, Albert Guillén i Fàbregas 234, Boris D. Kudryashov 1, Alfonso Martinez 2, Adrià Tauste Campo 2, and Gonzalo Vazquez-Vilar
More informationECE Information theory Final (Fall 2008)
ECE 776 - Information theory Final (Fall 2008) Q.1. (1 point) Consider the following bursty transmission scheme for a Gaussian channel with noise power N and average power constraint P (i.e., 1/n X n i=1
More informationChannel Probing in Communication Systems: Myopic Policies Are Not Always Optimal
Channel Probing in Communication Systems: Myopic Policies Are Not Always Optimal Matthew Johnston, Eytan Modiano Laboratory for Information and Decision Systems Massachusetts Institute of Technology Cambridge,
More informationSub-Gaussian Model Based LDPC Decoder for SαS Noise Channels
Sub-Gaussian Model Based LDPC Decoder for SαS Noise Channels Iulian Topor Acoustic Research Laboratory, Tropical Marine Science Institute, National University of Singapore, Singapore 119227. iulian@arl.nus.edu.sg
More informationDecision-Point Signal to Noise Ratio (SNR)
Decision-Point Signal to Noise Ratio (SNR) Receiver Decision ^ SNR E E e y z Matched Filter Bound error signal at input to decision device Performance upper-bound on ISI channels Achieved on memoryless
More informationCapacity-achieving Feedback Scheme for Flat Fading Channels with Channel State Information
Capacity-achieving Feedback Scheme for Flat Fading Channels with Channel State Information Jialing Liu liujl@iastate.edu Sekhar Tatikonda sekhar.tatikonda@yale.edu Nicola Elia nelia@iastate.edu Dept. of
More informationOne-Bit LDPC Message Passing Decoding Based on Maximization of Mutual Information
One-Bit LDPC Message Passing Decoding Based on Maximization of Mutual Information ZOU Sheng and Brian M. Kurkoski kurkoski@ice.uec.ac.jp University of Electro-Communications Tokyo, Japan University of
More informationConstellation Shaping for Communication Channels with Quantized Outputs
Constellation Shaping for Communication Channels with Quantized Outputs Chandana Nannapaneni, Matthew C. Valenti, and Xingyu Xiang Lane Department of Computer Science and Electrical Engineering West Virginia
More informationInformation Theory Meets Game Theory on The Interference Channel
Information Theory Meets Game Theory on The Interference Channel Randall A. Berry Dept. of EECS Northwestern University e-mail: rberry@eecs.northwestern.edu David N. C. Tse Wireless Foundations University
More informationRandom Redundant Soft-In Soft-Out Decoding of Linear Block Codes
Random Redundant Soft-In Soft-Out Decoding of Linear Block Codes Thomas R. Halford and Keith M. Chugg Communication Sciences Institute University of Southern California Los Angeles, CA 90089-2565 Abstract
More informationEfficient Bit-Channel Reliability Computation for Multi-Mode Polar Code Encoders and Decoders
Efficient Bit-Channel Reliability Computation for Multi-Mode Polar Code Encoders and Decoders Carlo Condo, Seyyed Ali Hashemi, Warren J. Gross arxiv:1705.05674v1 [cs.it] 16 May 2017 Abstract Polar codes
More informationShort-Packet Communications in Non-Orthogonal Multiple Access Systems
Short-Packet Communications in Non-Orthogonal Multiple Access Systems Xiaofang Sun, Shihao Yan, Nan Yang, Zhiguo Ding, Chao Shen, and Zhangdui Zhong State Key Lab of Rail Traffic Control and Safety, Beijing
More informationEncoder. Encoder 2. ,...,u N-1. 0,v (0) ,u 1. ] v (0) =[v (0) 0,v (1) v (1) =[v (1) 0,v (2) v (2) =[v (2) (a) u v (0) v (1) v (2) (b) N-1] 1,...
Chapter 16 Turbo Coding As noted in Chapter 1, Shannon's noisy channel coding theorem implies that arbitrarily low decoding error probabilities can be achieved at any transmission rate R less than the
More informationChapter 7. Error Control Coding. 7.1 Historical background. Mikael Olofsson 2005
Chapter 7 Error Control Coding Mikael Olofsson 2005 We have seen in Chapters 4 through 6 how digital modulation can be used to control error probabilities. This gives us a digital channel that in each
More informationLow-Complexity Puncturing and Shortening of Polar Codes
Low-Complexity Puncturing and Shortening of Polar Codes Valerio Bioglio, Frédéric Gabry, Ingmar Land Mathematical and Algorithmic Sciences Lab France Research Center, Huawei Technologies Co. Ltd. Email:
More informationConstruction of low complexity Array based Quasi Cyclic Low density parity check (QC-LDPC) codes with low error floor
Construction of low complexity Array based Quasi Cyclic Low density parity check (QC-LDPC) codes with low error floor Pravin Salunkhe, Prof D.P Rathod Department of Electrical Engineering, Veermata Jijabai
More informationSoft-Output Trellis Waveform Coding
Soft-Output Trellis Waveform Coding Tariq Haddad and Abbas Yongaçoḡlu School of Information Technology and Engineering, University of Ottawa Ottawa, Ontario, K1N 6N5, Canada Fax: +1 (613) 562 5175 thaddad@site.uottawa.ca
More informationThe Concept of Soft Channel Encoding and its Applications in Wireless Relay Networks
The Concept of Soft Channel Encoding and its Applications in Wireless Relay Networks Gerald Matz Institute of Telecommunications Vienna University of Technology institute of telecommunications Acknowledgements
More informationEXTENDING THE DORSCH DECODER FOR EFFICIENT SOFT DECISION DECODING OF LINEAR BLOCK CODES SEAN MICHAEL COLLISON
EXTENDING THE DORSCH DECODER FOR EFFICIENT SOFT DECISION DECODING OF LINEAR BLOCK CODES By SEAN MICHAEL COLLISON A thesis submitted in partial fulfillment of the requirements for the degree of MASTER OF
More informationANALYSIS OF A PARTIAL DECORRELATOR IN A MULTI-CELL DS/CDMA SYSTEM
ANAYSIS OF A PARTIA DECORREATOR IN A MUTI-CE DS/CDMA SYSTEM Mohammad Saquib ECE Department, SU Baton Rouge, A 70803-590 e-mail: saquib@winlab.rutgers.edu Roy Yates WINAB, Rutgers University Piscataway
More informationUpper Bounds on the Capacity of Binary Intermittent Communication
Upper Bounds on the Capacity of Binary Intermittent Communication Mostafa Khoshnevisan and J. Nicholas Laneman Department of Electrical Engineering University of Notre Dame Notre Dame, Indiana 46556 Email:{mhoshne,
More informationModeling and Simulation NETW 707
Modeling and Simulation NETW 707 Lecture 6 ARQ Modeling: Modeling Error/Flow Control Course Instructor: Dr.-Ing. Maggie Mashaly maggie.ezzat@guc.edu.eg C3.220 1 Data Link Layer Data Link Layer provides
More informationIEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 64, NO. 10, OCTOBER
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 64, NO. 10, OCTOBER 2016 4029 Optimized Design of Finite-Length Separable Circulant-Based Spatially-Coupled Codes: An Absorbing Set-Based Analysis Behzad Amiri,
More informationLDPC Decoder LLR Stopping Criterion
International Conference on Innovative Trends in Electronics Communication and Applications 1 International Conference on Innovative Trends in Electronics Communication and Applications 2015 [ICIECA 2015]
More informationLow-density parity-check codes
Low-density parity-check codes From principles to practice Dr. Steve Weller steven.weller@newcastle.edu.au School of Electrical Engineering and Computer Science The University of Newcastle, Callaghan,
More informationCapacity of Memoryless Channels and Block-Fading Channels With Designable Cardinality-Constrained Channel State Feedback
2038 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 9, SEPTEMBER 2004 Capacity of Memoryless Channels and Block-Fading Channels With Designable Cardinality-Constrained Channel State Feedback Vincent
More informationDigital Image Processing Lectures 25 & 26
Lectures 25 & 26, Professor Department of Electrical and Computer Engineering Colorado State University Spring 2015 Area 4: Image Encoding and Compression Goal: To exploit the redundancies in the image
More informationError Correction Methods
Technologies and Services on igital Broadcasting (7) Error Correction Methods "Technologies and Services of igital Broadcasting" (in Japanese, ISBN4-339-06-) is published by CORONA publishing co., Ltd.
More informationImproved Multiple Feedback Successive Interference Cancellation Algorithm for Near-Optimal MIMO Detection
Improved Multiple Feedback Successive Interference Cancellation Algorithm for Near-Optimal MIMO Detection Manish Mandloi, Mohammed Azahar Hussain and Vimal Bhatia Discipline of Electrical Engineering,
More informationData Detection for Controlled ISI. h(nt) = 1 for n=0,1 and zero otherwise.
Data Detection for Controlled ISI *Symbol by symbol suboptimum detection For the duobinary signal pulse h(nt) = 1 for n=0,1 and zero otherwise. The samples at the output of the receiving filter(demodulator)
More informationGuess & Check Codes for Deletions, Insertions, and Synchronization
Guess & Chec Codes for Deletions, Insertions, and Synchronization Serge Kas Hanna, Salim El Rouayheb ECE Department, IIT, Chicago sashann@hawiitedu, salim@iitedu Abstract We consider the problem of constructing
More informationDesign of Diversity-Achieving LDPC Codes for H-ARQ with Cross-Packet Channel Coding
Design of Diversity-Achieving LDPC Codes for H-ARQ with Cross-Packet Coding Dieter Duyck Ghent University Gent, Belgium dduyck@telin.ugent.be Daniele Capirone Politecnico di Torino Torino, Italy daniele.capirone@polito.it
More informationOn the Capacity of the Two-Hop Half-Duplex Relay Channel
On the Capacity of the Two-Hop Half-Duplex Relay Channel Nikola Zlatanov, Vahid Jamali, and Robert Schober University of British Columbia, Vancouver, Canada, and Friedrich-Alexander-University Erlangen-Nürnberg,
More informationOn the Channel Statistics in Hybrid ARQ Systems for Correlated Channels
On the Channel Statistics in Hybrid ARQ Systems for Correlated Channels Marco Levorato, Leonardo Badia, Michele Zorzi Department of Information Engineering, University of Padova, Via Gradenigo 6/B, 35131
More informationA Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying
A Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying Ahmad Abu Al Haija, and Mai Vu, Department of Electrical and Computer Engineering McGill University Montreal, QC H3A A7 Emails: ahmadabualhaija@mailmcgillca,
More informationCan the sample being transmitted be used to refine its own PDF estimate?
Can the sample being transmitted be used to refine its own PDF estimate? Dinei A. Florêncio and Patrice Simard Microsoft Research One Microsoft Way, Redmond, WA 98052 {dinei, patrice}@microsoft.com Abstract
More informationUNIT I INFORMATION THEORY. I k log 2
UNIT I INFORMATION THEORY Claude Shannon 1916-2001 Creator of Information Theory, lays the foundation for implementing logic in digital circuits as part of his Masters Thesis! (1939) and published a paper
More information