Irregular Designs for Two-State Systematic with Serial Concatenated Parity Codes
|
|
- Kristopher Crawford
- 8 years ago
- Views:
Transcription
1 rregular Designs for Two-State Systematic with Serial Concatenated Parity Codes Jordan Melzer and Keith M. Chugg Electrical Engineering Department, University of Southern California Los Angeles, California {jmelzer, Abstract The rregular Repeat Accumulate (RA) codes introduced by Jin et al. [1] are structured Low Density Parity Check (LDPC) codes that are known to perform as well as the best unstructured LDPCs. RAs reach rates that are quite close to capacity on the additive white Gaussian noise (AWGN) channel, can be both encoded and decoded in linear time, are perceived to be low complexity codes, and have been adopted into recent standards. Systematic with Serially Concatenated Parity (S-SCP) codes were recently introduced in [2], [3] as a class of turbo like codes with members that exhibit good performance over a wide range of block sizes, code rates, and target error probabilities. n this paper we introduce irregular designs for Systematic with Serially Concatenated Parity (r-s-scp) codes and show that both for near-capacity and more practical lower-complexity designs, irregular two-state S-SCP codes can be designed to achieve the performance of RA codes at lower complexity.. NTRODUCTON Repeat Accumulate (RA) codes [4] and rregular Repeat Accumulate (RA) codes [1] are a code family that can be viewed either as structured Low Density Parity Check (LDPC) codes [5] or as concatenated codes. RA codes are known to perform as well as the best unstructured LDPC codes, reaching rates approaching capacity on the Additive White Gaussian Noise (AWGN) channel. They are perceived to be low-complexity, offer linear-time encoding, and have been adopted into recent standards, most notably the DVB- S2 digital television standard [6]. Systematic with Serially Concatenated Parity (S-SCP) codes were introduced in [2], [3] as a class of codes with universally good performance. For these codes, a single decoder can provide performance close to theoretical limits over a wide range of block sizes, code rates, and desired frame error rates. rregular design [7] is known to lower the E b /N 0 threshold the lowest E b /N 0 that will give perfect error correction in the limit of infinite block size and an infinite number of iterations and has been proposed as a way to increase the coding gain of a range of turbo-like codes. The improvement in performance that irregular design allows comes at the cost of extra computation. For a fixed decoding complexity, the code with the lowest threshold usually does not give the best performance. n employing irregular design, it is more useful to find a good trade-off between complexity and performance than to create a code with the best asymptotic performance. Despite its importance, this trade-off is not frequently explored in the literature. n this paper we continue the design of S-SCP codes begun in [3]. No codes were presented in [3] with r < 1 2 and many codes with superior r = 1/2 performance, though higher complexity, have been published. n this paper we extend the design of S-SCP codes to low rates and demonstrate designs that offer an attractive mix of low-complexity and high-performance. rregular design was suggested in [3] as a method to increase the coding gain of S-SCP codes at the expense of complexity. Here we present design techniques for irregular S-SCP (r-s- SCP) codes aimed at producing codes with good performance vs. complexity trade-offs and demonstrate them in designing r-s-scp codes with structures similar to those of [3] and RA codes. We show that, both for large and moderate block-size codes, r-s-scp codes achieve lower block error rates than RA codes with similar complexities. A second way to achieve larger coding gains, one that also usually increases the per-bit decoding complexity, is to reduce the rate of a code. We illustrate low-rate designs for r-s- SCP codes as well as an incremental redundancy scheme that exhibits performance vs. complexity tradeoffs very close to those of r-s-scp point designs. n section we describe irregular S-SCP codes, in section we discuss optimization techniques for r-s-scps based on EXT (EXtrinsic nformation Transfer) charts, and in section V we compare the complexity vs. performance tradeoffs of RA and r-s-scp codes. n section V we introduce low-rate r-s-scp codes and an incremental redundancy scheme for which the complexity and performance of the code are, at each rate, similar to those of an optimized r-s-scp point design.. RREGULAR S-SCPS An irregular Systematic with Serial Concatenated Parity (r-s-scp) code is an S-SCP code with varying inner or outer codes. For many modern codes, irregularity has been successfully used to reduce E b /N 0 requirements to quite near the constrained capacity [8] [1] [9]. Heuristic optimization techniques based on density evolution [8] or EXT charts [10] are used as an aid to irregular design. These methods simulate the performance of the code in the limit of infinite block size and, usually, infinite iterations. n this paper we limit our attention to r-s-scp codes with an inner code comprising a punctured accumulator (G(D) = 1 1+D ) and an irregular outer code comprising a duo-binary
2 (a) General S-SCP structure b d Q Q/J P = kq/j j pm i outer nner Parity parity bits code Generator (PG) kq bits k systematic bits b i (b) rregular Repeat Accumulate (c) Example 2-state r-s-scp b i 1+D = Q(i) P/S d j PG = d Accumulator b P/S d j P = kq/j pm i repetition parity bits code 1/(1+D) J:1 (=) Q(i) k systematic bits b i PG = d Accumulator 1/(1+D) J:1 P = kq/j parity bits p m k systematic bits Fig. 1. (a) General r-s-scp code (b) RA code (c) Example 2-state r-s-scp code encoder (G(D) = 1 + D) with outputs that are repeated a variable number of times. We use this example because it is simple and similar in structure to the Flexible LDPC S- SCP code presented in [3]: a two-state regular S-SCP code with the inner and outer code polynomials of our example code and outer code outputs repeated twice. Similar two-state S-SCP codes are the Accumulate Repeat Accumulate codes of [11]. The design methods presented here are general, and other designs may prove to have superior properties. Figure 1 illustrates the general r-s-scp code structure, the structure of the two-state r-s-scp codes considered in this paper, and the structure of the systematic RA codes to which our r-s-scp codes are compared. Note that, though RA codes may be seen as a sub-class of S-SCP codes with G(D) = 1 outer codes, in this paper we refer to example codes with outer G(D) = 1+D by S-SCP and outer G(D) = 1 by RA. We call the number of times that a bit i from the outer code is repeated Q(i), and the average repetition factor for a code Q. Much of our design work will be aimed at producing distributions on Q with desirable properties. We call the rate of the puncturer after the inner code J, and calculate it as the ratio between the number of output bits from the outer code and the number of parity bits. The rate of such an r-s-scp is r = J J+Q.. EXT CHART BASED OPTMZATON OF R-S-SCP CODES Because of the similarity between S-SCP and seriallyconcatenated codes, the optimization heuristics of [9] and [12] for irregular serially-concatenated codes may be used, with slight modification, to design irregular S-SCP codes. Both methods rely on EXT (EXtrinsic nformation Transfer) curves [10] characterizations of component codes based on the single variable of mutual information between the extrinsic likelihoods and their true values for the bits passing b i through the interleaver of a concatenated code. When applied to irregular designs, these methods exploit the property that the EXT curve of a mixture of codes is (excluding interaction through trellis state at points where the code used is varied) a linear mixture of the EXT curves of the individual codes. n both methods a fixed inner code is assumed and optimization is performed by using an EXT chart of the EXT curve of the inner code and the EXT curve of mixtures of outer codes to predict performance. n particular, for a code to be decodable the EXT curve of the inner code must lie above the EXT curve of the outer code. For a serial code, only the inner code is directly in contact with the channel, so the EXT charts of the outer code are not a function of channel SNR. With S-SCPs, both inner and outer codes are directly in contact with the channel, requiring that EXT curves for both codes be created at each signal-to-noise ratio (SNR) of interest. n [9], the optimization proceeds as follows. An initial mixture of codes expressed as a vector of positive fractions of coded bits from each code is repeatedly projected onto constraints on the rate of the outer code and the existence of a decoding tunnel between the EXT curves of the two codes. f a code mixture is found that satisfies those constraints, the technique uses a gradient search to find the curve with lowest mean-square distance between the EXT curves which satisfies the constraints. f no code mixture is found that satisfies the constraints, the code is determined to be below threshold. n [12], an optimization heuristic for fixed-iteration performance is described. Here the constraint requiring the existence of a decoding tunnel is relaxed and a gradient search is performed for the code with the largest mutual information after a fixed number of iterations on the EXT chart. We opted to perform the optimization for finite iterations using the Nelder-Mead Simplex non-gradient method [13]. n our formulation of this problem as a standard simplex optimization, we chose the dimensions of the simplex as the smallest number needed to meet the rate constraint: the number of individual or even mixtures of two outer codes (expressed as pairs of positive weights that sum to one) that have the desired rate at the interleaver. The goal of the optimization is, then, to select a unit-sum, positive vector in this space with the largest mutual-information. To meet the constraint that the selected fractions sum to one, we exclude one dimension from the optimization. Using an objective function that returns less than zero when the inner and outer curves meet and the mutual information on the log-likelihood ratios at the end of the iteration otherwise forms the problem as a standard Nelder Mead Simplex maximization. This method can be easily extended to designs with irregular inner codes. V. COMPLEXTY VS. PERFORMANCE TRADE-OFF OF RA AND R-S-SCP CODES terative decoders for turbo-like codes are sub-optimal and exhibit a trade-off between computational complexity and error-rate. n this section we compare the complexity vs. performance trade-offs of several RA and r-s-scp code designs. We express this trade-off in terms of block error rate
3 (BLER) and 2-state trellis sections, and give operation counts for each design that justify the use of trellis sections as a measure of complexity. Following [3, section V], the computation done in the decoder for RA and two-state S-SCP codes on each iteration is expressed as g( ) and addition operations, where 1 g(x, y) = min (x, y) min (0, x + y) (1) and min is a log-sum: min (x, y) = log[exp(x) + exp(y)] = min(x, y) ln[1 + exp( x y )] n table V, we list this per-decoded-bit, per-iteration complexity as {C g, C + } for the codes considered in this section. For these codes, each two-state trellis-section requires three g( ) operations and additions. Since the complexity of the g( ) operation, though architecture dependent, is several times that of an addition, the average complexity per trellis section of each of the codes is almost identical, justifying the use of trellis sections as a clear, single-dimensional measure of complexity. The complexity in two-state trellis sections per decoded bit is listed as C T S in table V. For RA codes, C T S = Q while for our example S-SCP codes C T S = Q + 1. For both codes, smaller Q gives lower per-iteration complexity. As demonstrated for our example codes in table V, the typical Q of a good r-s-scp code is smaller than that of a good RA code. For our example S-SCP codes, the outer and inner code are inverse operations: G(D) for the inner code is 1/G(D) for the outer code. Since the soft-in, soft-out (SSO) decoder performs both probabilistic encoding and decoding, the SSOs of a function and its inverse are identical, just with the sense of which variables are coded and which are uncoded switched. Thus, for this example code, the SSO(s) used for decoding the inner code during one half of an iteration may be used to decode the outer code in the other half of an iteration. For some hardware architectures, the area of decoders for this code will scale directly with Q. To demonstrate the low-threshold performance as well as the complexity advantage offered by r-s-scp codes, we first consider a pair of rate-1/2 codes designed to give low thresholds for large block sizes. We compare the RA with average repetition Q = 8 and a minimum degree of three found in [1] with a Q = 4 irregular S-SCP designed for low threshold using the EXT chart method of section and the regular two-state S-SCP code of [3]. The two irregular codes were simulated using repetition profiles of period n table V, the Q column lists repetition factors while the repetitions column for each code indicates the number of inputs, out of each 1024, that are repeated by each repetition factor. Table V also lists the complexity per input bit for each code in terms of g( ) and + operations as {C g, C + } and in terms of trellissections as C T S. The last row in table V, labelled ( E b N 0 ) 1 For min-sum decoding, changing min*( ) in (1) to min( ) yields the appropriate decoder. (2) Regular Low Low Low Low S-SCP Threshold Complexity Threshold Complexity r-s-scp r-s-scp Jin RA RA Q Q repetitions repetitions C T S C G, C + 9, 7 15, , , 17 15, 11 ( E b N 0 ) db TABLE CODE PARAMETERS FOR FVE RA OR 2-STATE S-SCP CODES db, lists the approximate E b /N 0 threshold of each code, as calculated on an EXT chart. The EXT threshold calculated for both irregular codes is 0.35 db and agrees closely with the threshold obtained via density evolution for the RA code in [1]. This threshold is similar to those for unstructured Low Density Parity Check codes [14]. n figure 2, block error rate (BLER) and bit error rate (BER) vs. E b /N 0 curves are given for the low threshold r-s-scp and RA and the regular S-SCP codes at a complexity of 400 trellis sections per input bit, a large complexity figure equivalent to, respectively, 80, 50, and 133 iterations at a block size k = input bits. Note that this block size is one of the larger ones used in current communication systems. At this fixed complexity, the r-s-scp shows a 0.05 db gain over the RA and a 0.2 db gain over the regular code. n figure 3, BLER and BER vs complexity curves are given for the same codes and block size at E b /N 0 = 0.9 db. Here the low-threshold r-s-scp code reaches the performance of the low-threshold RA code with approximately 60% of the computational complexity. This is also, roughly, the difference in per-iteration complexity: 5/8. r-s-scp codes also offer complexity advantages for the practical case of moderate complexity and block size. Here design heuristics based on an infinite number of iterations may no longer be appropriate. Using the finite-iteration method of [12] and the technique outlined in section, we designed low-complexity RA and r-s-scp codes targetting rate- 1 2 and k = The repeat profiles of these codes are listed in
4 Fig. 2. Large block size BER and BLER vs E b /N 0 for low threshold RA, r-s-scp, and regular S-SCP codes with, respectively, 50, 80, and 133 iterations (400 2 state trellis sections), k = 16384, r = 1 2. Fig. 4. Moderate block size BER and BLER vs E b /N 0 for regular S- SCP, low-complexity S-SCP and RA, and low threshold r-s-scp and RA codes with 33, 25, 20, 20, and 13 iterations (100 2 state trellis sections), k = 1024, r = 1 2. Fig. 3. Large block size BER and BLER vs. computational complexity in 2 state trellis sections for low threshold RA, r-s-scp, and regular S-SCP codes at E b /N 0 = 0.9 db, k = 16384, r = 1 2. Fig. 5. Moderate block size BER and BLER vs complexity for regular S- SCP, low-complexity R-S-SCP and RA and low threshold r-s-scp and RA codes at E b /N 0 = 1.5 db, k = 1024, r = 1 2 table V. BLER and BER vs E b /N 0 for these low-complexity designs as well as for the low threshold designs and the regular code are given at a fixed complexity of 100 trellis sections in figure 4. Here the low-complexity r-s-scp code shows a BLER advantage of approximately 0.05 db over both the low-complexity irregular repeat accumulate code and the lowthreshold irregular S-SCP code and more than 0.3 db over the low-threshold RA code of [1]. Figure 5 gives BLER and BER vs. complexity curves for these codes at E b /N 0 = 1.5 db. Here the low-complexity r-s-scp code shows a computational complexity advantage in BLER of approximately 75% similar to the per-iteration complexity advantage of 4/5 over both the low complexity RA and low-threshold r-s-scp codes and much larger complexity gains over the low threshold RA code. The regular S-SCP gives the lowest BLER until a complexity of 60 trellissections per bit but shows little iteration gain beyond that. V. R-S-SCPS FOR NCREMENTAL REDUNDANCY WTH NCREMENTAL COMPLEXTY ncremental redundancy is a hybrid-arq technique being deployed in current cellular systems. With this method a highrate codeword is first sent. f a receiver fails to decode this codeword, each retransmission is composed of additional bits that, together with all previously transmitted bits, form a codeword of a lower rate code. Here the codewords for higher rates can be seen as punctured versions of codewords from lower rates. An incremental redundancy scheme based on uniform puncturing of parity bits from a systematic mother code has been adopted into CDMA2000 1XEV-DO [15]. With uniform
5 Q min (i) High Rate 1+D = 1/(1+D) Low Rate Q (i) P/S J:1 P=kQ/J parity bits k systematic bits Fig. 6. Progressive transmission encoder with a two-component interleaver for a G o(d) = 1 + D, G i (D) = 1 r-s-scp family 1+D Bit ndex Pattern a) b) c) xxxo... xoxo high rate 4096 low rate xoxooo......xxxo xxxx......xoxo xxxx......xxxx...xxxx...xoxooo 6144 Fig. 7. Example puncturer for a progressive transmission scheme. x s represent punctured bits, o s transmitted bits, and underlined o s new bits to transmit: (a) r = 2/3, Q = 2, J = 4, 2048 trellis sections (b) r = 1/3, Q = 4, J = 2, 4096 trellis sections (c) r = 1/5, Q = 6, J = 6, 6144 trellis sections puncturing of parity bits from a turbo-like code, regardless of the rate of the code the decoder must process each trellis section of the mother code. Each punctured parity bit allows the decoder to perform two fewer additions per iteration, but this saving is small and may not translate into an area saving or speed increase in a hardware implementation. For S-SCP codes, using uniform puncturing of parity bits to provide incremental redundancy would create a family of codes for which the Q distribution is fixed by the Q distribution of the lowest rate code and the J parameter increases with the rate. Fixing the Q distribution both fixes the per-iteration complexity of the code regardless of the code rate and allows for an optimal design only at one rate. n contrast, we present a technique whereby at any rate an optimal Q and J and a near optimal Q distribution may be selected, allowing for a better performance vs. complexity trade-off over a wide range of rates. As the rate increases, the optimal Q reduces, reducing the size of the interleaver and the number of trellis sections of the inner code. To reduce Q through puncturing requires using puncturing to remove sections from the end of the inner trellis and, with them, the corresponding bits from the end of the codeword. Without any additional structure to the code, reducing the size of the interleaver will quickly tend to produce Q s of 1 and 0, leading to a loss in interleaver gain and poor BER and BLER performance [3, section V]. An interleaver structured to produce a desirable Q distribution for the highest rate codes will produce interleaver gain for all lower rates. Such a structured interleaver for an incremental redundancy code with incremental complexity may be constructed of two or more parallel interleavers. The encoder for such a progressive transmission S-SCP code with two interleaver components is shown in figure 6. Sample puncture patterns for this scheme are shown in figure 7 for three rates 1/5, 1/3, and 2/3 from an example code with k = 1024, component interleavers of 2048 and 4096 bits, and a Q ranging from 6 to 2. The Q distributions of the interleaver and its components are listed in table. The code parameters for each rate are listed in table. Note that in these tables indicates the size of the interleaver which is also the complexity in trellis sections of the inner code. Performance curves for this code at six rates are shown in figure 8. These curves are within 0.2 db of E b /N 0 of those for good r-s-scp point designs. One component of this interleaver is designed for the highest code rate to be considered, and at this highest rate the puncturer selects only bits output from this component. n figure 6, this interleaver component is labelled high rate and the repetition profile on the inputs to it is labelled Q min (i). The puncture pattern used for this high-rate code is listed as (a) in figure 7, and in this example Q min (i) = 2, r = 2/3, and the code has 2048 inner trellis sections. f the r-s- SCP code has been designed to satisfy the design rules in [3, section V], this high-rate interleaver component ensures interleaver gain at all rates. At the lowest rate, the puncturer selects bits from all sections of the composite interleaver. Any interleaver components beyond the highest rate interleaver may be designed such that the Q distribution of the composite interleaver is optimal. For the two-component interleaver in figure 6, the difference distribution Q (i) which describes the inputs to the second interleaver component marked low rate is designed so that Q min (i) + Q (i) is drawn from the optimal Q distribution for the lower rate. pattern (c) in figure 7 illustrates the puncture pattern for the example lowest-rate, a r = 1/5, Q = 6 code which has 6144 inner trellis sections. At intermediate rates, the puncturer operates at the J of the optimal Q distribution for that rate. There should be, at most, a small mismatch between the actual Q distribution and this desired Q distribution. The puncture pattern used for the example intermediate rate r = 1/3 code is listed as (b) in 7. This rate has Q = 4 and 4096 inner trellis sections. This design achieves rate compatible puncturing, so is suitable for an incremental redundancy scheme. At each rate, there is flexibility in the per-iteration complexity that allows a near-optimal trade-off between complexity and performance. n contrast to the uniform puncturing scheme used in the CDMA2000 1xEV-DO code and other turbo-codes, this incremental redundancy scheme allows for substantial reductions in complexity at higher rates. Since only a small fraction of the blocks transmitted under an incremental redundancy scheme will be decoded at their lower-rates while all have decoding attempts made at higher rates, the improvement that r-s-scps offer at higher rates is especially attractive for incremental redundancy schemes. The EXT chart design method described in section assumes that there is little interaction between the trellissections corresponding to bits that are repeated a different number of times. For smaller block sizes, grouping high
6 E Fig. 8. Plot of BER and BLER vs. b for k = 1024, r = N 0 1/5, 1/3, 1/2, 2/3, 4/5, 8/9, Q = 6, 4, 3, 2, 2, 2 progressive transmission with progressive complexity r-s-scp code. The 6144 bit interleaver is derived from a 2048 bit interleaver for rates 2/3 and a 4096 bit interleaver. The repetition profile after the outer code is scrambled. min full Q Q Rep., Period= TABLE REPETTON PROFLES FOR NCREMENTAL REDUNDANCY R-S-SCP Rate Q J Pattern 8/ xxxxxxxxxxxxxxxo 4/ xxxxxxxoxxxxxxxo 2/ xxxoxxxoxxxoxxxo 1/ xxxoxxxoxoxoxxxo 1/ xoxoxoxoxoxoxoxo 1/ xoooxoxoooxoxooo One period of each puncture pattern is bolded. ncremental bits for each rate are underlined. TABLE CODE PARAMETERS FOR NCREMENTAL REDUNDANCY R-S-SCP repetition degree trellis sections on the outer code into small interleaver components may increase the difficulty of avoiding short cycles. For these block sizes, a designer may wish to use few interleaver components and avoid grouping high repetition degree outer trellis sections together. This mixing of different repetition degree trellis sections will further reduce the accuracy of the already approximate EXT chart design method. A more accurate EXT chart design method would model the repetition code separately from the outer code, describing the soft-information passing from the outer code to the repetition code using a single variable or one variable per interleaver component. V. CONCLUSON rregular S-SCP designs bring additional good properties to the Systematic with Serial Concatenated Parity code family. r- S-SCP codes can be designed to achieve computational complexity advantages over well-designed RA codes in reaching moderate to low thresholds. These designs allow for low-rate codes with low thresholds. For codes with smaller block sizes, the finite-iteration design method of [12] is a practical method. Although not discussed in detail in this paper, S-SCP designs also exhibit similar reduction in memory requirements relative to RA codes because of their smaller interleavers. For the example two-state designs, both inner and outer codes may be decoded with the same two-state SSOs, allowing for single SSO decoder units to be used on both halves of an iteration with little additional logic [3]. n these examples, a single decoder implementation may support rates from at least 1/5 to 19/20 with fine granularity over a wide range of block sizes and even support progressive transmission with performance complexity-tradeoffs that are competitive with point designs of other popular codes. ACKNOWLEDGMENT This work was supported in part by NSF grant CCF and TrellisWare Technologies nc. REFERENCES [1] H. Jin, A. Khandekar, and R. McEliece, rregular repeat-accumulate codes, in Proc. 2nd nternational Conference on Turbo Codes, Brest, France, [2] K. M. Chugg, A new class turbo-like codes with desirable practical properties, in EEE Communication Theory Workshop (no proceedings), Capri sland, May 2004, (recent results session). [3] K. M. Chugg, P. Thiennviboon, G. D. Dimou, P. Gray, and J. Melzer, A new class of turbo-like codes with universally good performance and high-speed decoding, in Proc. EEE Military Comm. Conf., Atlantic City, NJ, October [4] D. Divsalar, H. Jin, and R. McEliece, Coding theorems for turbo-like codes, in Proc. 36th Allerton Conference on Communication, Control, and Computing, September 1998, pp [5] R. G. Gallager, Low density parity check codes, EEE Trans. nformation Theory, vol. 8, pp , January [6] F. Kienle, T. Brack, and N. Wehn, A synthesizable P core for DVB-S2 LDPC code decoding, in Proc. Design, Automation and Test in Europe, 2005, pp [7] M. Luby, M. A. Shokrolloahi, M. Mizenmacher, and D. Spielman, mproved low-density parity-check codes using irregular graphs and belief propagation, in Proc. EEE nternational Symp. on nformation Theory, August [8] T. Richardson and R. Urbanke, The capacity of low-density paritycheck codes under message-passing decoding, EEE Trans. nformation Theory, vol. 47, pp , Feb [9] M. Tüchler and J. Hagenauer, Exit charts of irregular codes, in Proc. Conference on nformation Sciences and Systems, Princeton University, March [10] S. ten Brink, Convergence behavior of iteratively decoded parallel concatenated codes, EEE Trans. Communications, vol. 49, no. 10, pp , October [11] A. Abbasfar, D. Divsalar, and K. Yao, Accumulate repeat accumulate codes, in Proc. Globecom Conf., Dallas, Texas, December 2004, pp [12] M. Tüchler, Design of serially concatenated systems depending on the block length, EEE Trans. Communications, vol. 32, pp , February [13] J. A. Nelder and R. Mead, A simplex method for function minimization, Computer Journal, vol. 7, pp , [14] T. Richardson, M. Shokrollahi, and R. Urbanke, Design of capacityapproaching irregular low-density parity-check codes, EEE Trans. nformation Theory, vol. 47, no. 2, pp , February [15] N. T. Sindhushavana and P. J. Black, Forward link coding and modulation for CDMA2000 1XEV-DO (S-856), in Proc. of Personal, ndoor and Mobile Communications, vol. 4, May 2002, pp
MOST error-correcting codes are designed for the equal
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 55, NO. 3, MARCH 2007 387 Transactions Letters Unequal Error Protection Using Partially Regular LDPC Codes Nazanin Rahnavard, Member, IEEE, Hossein Pishro-Nik,
More informationCoding Theorems for Turbo Code Ensembles
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 6, JUNE 2002 1451 Coding Theorems for Turbo Code Ensembles Hui Jin and Robert J. McEliece, Fellow, IEEE Invited Paper Abstract This paper is devoted
More informationAn Adaptive Decoding Algorithm of LDPC Codes over the Binary Erasure Channel. Gou HOSOYA, Hideki YAGI, Toshiyasu MATSUSHIMA, and Shigeichi HIRASAWA
2007 Hawaii and SITA Joint Conference on Information Theory, HISC2007 Hawaii, USA, May 29 31, 2007 An Adaptive Decoding Algorithm of LDPC Codes over the Binary Erasure Channel Gou HOSOYA, Hideki YAGI,
More informationCoding Theorems for Turbo-Like Codes Abstract. 1. Introduction.
Coding Theorems for Turbo-Like Codes Dariush Divsalar, Hui Jin, and Robert J. McEliece Jet Propulsion Laboratory and California Institute of Technology Pasadena, California USA E-mail: dariush@shannon.jpl.nasa.gov,
More informationTuned Turbo Codes. Christian Koller, Alexandre Graell i Amat, Jörg Kliewer, Francesca Vatta and Daniel J. Costello, Jr.
International Symposium on Information Theory and its Applications, ISITA2008 Auckland, New Zealand, 7-10, December, 2008 Tuned Turbo Codes Christian Koller, Alexandre Graell i Amat, Jörg Kliewer, Francesca
More informationAdaptive Linear Programming Decoding
Adaptive Linear Programming Decoding Mohammad H. Taghavi and Paul H. Siegel ECE Department, University of California, San Diego Email: (mtaghavi, psiegel)@ucsd.edu ISIT 2006, Seattle, USA, July 9 14, 2006
More informationCoding and decoding with convolutional codes. The Viterbi Algor
Coding and decoding with convolutional codes. The Viterbi Algorithm. 8 Block codes: main ideas Principles st point of view: infinite length block code nd point of view: convolutions Some examples Repetition
More informationDigital Video Broadcasting By Satellite
Digital Video Broadcasting By Satellite Matthew C. Valenti Lane Department of Computer Science and Electrical Engineering West Virginia University U.S.A. Apr. 2, 2012 ( Lane Department LDPCof Codes Computer
More informationCODED SOQPSK-TG USING THE SOFT OUTPUT VITERBI ALGORITHM
CODED SOQPSK-TG USING THE SOFT OUTPUT VITERBI ALGORITHM Daniel Alam Department of Electrical Engineering & Computer Science University of Kansas Lawrence, KS 66045 danich@ku.edu Faculty Advisor: Erik Perrins
More informationAdaptive Cut Generation Algorithm for Improved Linear Programming Decoding of Binary Linear Codes
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 10, OCTOBER 2012 6581 Adaptive Cut Generation Algorithm for Improved Linear Programming Decoding of Binary Linear Codes Xiaojie Zhang, Student Member,
More informationJoint Message-Passing Decoding of LDPC Codes and Partial-Response Channels
1410 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 6, JUNE 2002 Joint Message-Passing Decoding of LDPC Codes Partial-Response Channels Brian M. Kurkoski, Student Member, IEEE, Paul H. Siegel, Fellow,
More informationDesign of LDPC codes
Design of LDPC codes Codes from finite geometries Random codes: Determine the connections of the bipartite Tanner graph by using a (pseudo)random algorithm observing the degree distribution of the code
More informationSemi-Parallel Reconfigurable Architectures for Real-Time LDPC Decoding
Semi-Parallel Reconfigurable Architectures for Real-Time LDPC Decoding Marjan Karkooti and Joseph R. Cavallaro Center for Multimedia Communication Department of Electrical and Computer Engineering Rice
More information1872 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 52, NO. 11, NOVEMBER 2004
1872 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 52, NO. 11, NOVEMBER 2004 Transactions Papers Performance Analysis and Design Criteria for Finite-Alphabet Source-Channel Codes Ahmadreza Hedayat, Student
More informationTeaching Convolutional Coding using MATLAB in Communication Systems Course. Abstract
Section T3C2 Teaching Convolutional Coding using MATLAB in Communication Systems Course Davoud Arasteh Department of Electronic Engineering Technology, LA 70813, USA Abstract Convolutional codes are channel
More informationFACULTY OF GRADUATE STUDIES. On The Performance of MSOVA for UMTS and cdma2000 Turbo Codes
FACULTY OF GRADUATE STUDIES On The Performance of MSOVA for UMTS and cdma2000 Turbo Codes By Hani Hashem Mis ef Supervisor Dr. Wasel Ghanem This Thesis was submitted in partial ful llment of the requirements
More information954 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 3, MARCH 2005
954 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 3, MARCH 2005 Using Linear Programming to Decode Binary Linear Codes Jon Feldman, Martin J. Wainwright, Member, IEEE, and David R. Karger, Associate
More informationDESIGN OF LOW-FLOOR QUASI-CYCLIC IRA CODES AND THEIR FPGA DECODERS. Yifei Zhang. A Dissertation Submitted to the Faculty of the
DESIGN OF LOW-FLOOR QUASI-CYCLIC IRA CODES AND THEIR FPGA DECODERS by Yifei Zhang A Dissertation Submitted to the Faculty of the DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING In Partial Fulfillment
More informationRegularized Variable-Node LT Codes with Improved Erasure Floor Performance
Regularized Variable-Node LT Codes with Improved Erasure Floor Performance Iqbal Hussain, Ming Xiao, and Lars K. Rasmussen School of Electrical Engineering, Communication Theory Laboratory KTH Royal Institute
More informationLinear-Time Encodable Rate-Compatible Punctured LDPC Codes with Low Error Floors
Linear-Time Encodable Rate-Compatible Punctured LDPC Codes with Low Error Floors Seungmoon Song, Daesung Hwang, Sungloc Seo, and Jeongseo Ha School of Electrical and Computer Engineering Information and
More informationPerformance of Quasi-Constant Envelope Phase Modulation through Nonlinear Radio Channels
Performance of Quasi-Constant Envelope Phase Modulation through Nonlinear Radio Channels Qi Lu, Qingchong Liu Electrical and Systems Engineering Department Oakland University Rochester, MI 48309 USA E-mail:
More informationPractical Covert Channel Implementation through a Timed Mix-Firewall
Practical Covert Channel Implementation through a Timed Mix-Firewall Richard E. Newman 1 and Ira S. Moskowitz 2 1 Dept. of CISE, PO Box 116120 University of Florida, Gainesville, FL 32611-6120 nemo@cise.ufl.edu
More informationFunctional-Repair-by-Transfer Regenerating Codes
Functional-Repair-by-Transfer Regenerating Codes Kenneth W Shum and Yuchong Hu Abstract In a distributed storage system a data file is distributed to several storage nodes such that the original file can
More informationEfficient Data Recovery scheme in PTS-Based OFDM systems with MATRIX Formulation
Efficient Data Recovery scheme in PTS-Based OFDM systems with MATRIX Formulation Sunil Karthick.M PG Scholar Department of ECE Kongu Engineering College Perundurau-638052 Venkatachalam.S Assistant Professor
More informationA New Digital Communications Course Enhanced by PC-Based Design Projects*
Int. J. Engng Ed. Vol. 16, No. 6, pp. 553±559, 2000 0949-149X/91 $3.00+0.00 Printed in Great Britain. # 2000 TEMPUS Publications. A New Digital Communications Course Enhanced by PC-Based Design Projects*
More informationA Distance Spectrum Interpretation of Turbo Codes
1698 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 42, NO. 6, NOVEMBER 1996 A Distance Spectrum Interpretation of Turbo Codes Lance C. Perez, Member, IEEE, Jan Seghers, and Daniel J. Costello, Jr., Fellow,
More informationThe Effect of Network Cabling on Bit Error Rate Performance. By Paul Kish NORDX/CDT
The Effect of Network Cabling on Bit Error Rate Performance By Paul Kish NORDX/CDT Table of Contents Introduction... 2 Probability of Causing Errors... 3 Noise Sources Contributing to Errors... 4 Bit Error
More informationCommunication on the Grassmann Manifold: A Geometric Approach to the Noncoherent Multiple-Antenna Channel
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 2, FEBRUARY 2002 359 Communication on the Grassmann Manifold: A Geometric Approach to the Noncoherent Multiple-Antenna Channel Lizhong Zheng, Student
More informationCNR Requirements for DVB-T2 Fixed Reception Based on Field Trial Results
CNR Requirements for DVB-T2 Fixed Reception Based on Field Trial Results Iñaki Eizmendi, Gorka Berjon-Eriz, Manuel Vélez, Gorka Prieto, Amaia Arrinda This letter presents the C/N requirements for DVB-T2
More informationAalborg Universitet. Published in: I E E E Signal Processing Letters. DOI (link to publication from Publisher): 10.1109/LSP.2014.
Aalborg Universitet Message-Passing Receivers for Single Carrier Systems with Frequency-Domain Equalization Zhang, Chuanzong; Manchón, Carles Navarro; Wang, Zhongyong; Fleury, Bernard Henri Published in:
More informationAN ANALYSIS OF DELAY OF SMALL IP PACKETS IN CELLULAR DATA NETWORKS
AN ANALYSIS OF DELAY OF SMALL IP PACKETS IN CELLULAR DATA NETWORKS Hubert GRAJA, Philip PERRY and John MURPHY Performance Engineering Laboratory, School of Electronic Engineering, Dublin City University,
More informationADVANCED APPLICATIONS OF ELECTRICAL ENGINEERING
Development of a Software Tool for Performance Evaluation of MIMO OFDM Alamouti using a didactical Approach as a Educational and Research support in Wireless Communications JOSE CORDOVA, REBECA ESTRADA
More informationLog-Likelihood Ratio-based Relay Selection Algorithm in Wireless Network
Recent Advances in Electrical Engineering and Electronic Devices Log-Likelihood Ratio-based Relay Selection Algorithm in Wireless Network Ahmed El-Mahdy and Ahmed Walid Faculty of Information Engineering
More informationIN RECENT YEARS, multimedia transmission over various
1092 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 52, NO. 7, JULY 2004 Scalable Image and Video Transmission Using Irregular Repeat-Accumulate Codes With Fast Algorithm for Optimal Unequal Error Protection
More informationPerformance of Multicast MISO-OFDM Systems
Performance of Multicast MISO-OFDM Systems Didier Le Ruyet Electronics and Communications Lab CNAM, 292 rue Saint Martin 75141, Paris, France Email: leruyet@cnamfr Berna Özbek Electrical and Electronics
More informationHardware Implementation for Error Correction Using Software-Defined Radio Platform
European Journal of Scientific Research ISSN 1450-216X Vol.38 No.2 (2009), pp.337-350 EuroJournals Publishing, Inc. 2009 http://www.eurojournals.com/ejsr.htm Hardware Implementation for Error Correction
More information5 Capacity of wireless channels
CHAPTER 5 Capacity of wireless channels In the previous two chapters, we studied specific techniques for communication over wireless channels. In particular, Chapter 3 is centered on the point-to-point
More informationLinear Codes. Chapter 3. 3.1 Basics
Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length
More informationLDPC Codes: An Introduction
LDPC Codes: An Introduction Amin Shokrollahi Digital Fountain, Inc. 39141 Civic Center Drive, Fremont, CA 94538 amin@digitalfountain.com April 2, 2003 Abstract LDPC codes are one of the hottest topics
More informationWhitepaper November 2008. Iterative Detection Read Channel Technology in Hard Disk Drives
Whitepaper November 2008 Iterative Detection Read Channel Technology in Hard Disk Drives / Table of Contents Table of Contents Executive Summary... 1 Background...2 Achieving Enhanced Performance Through
More informationError Control Coding and Ethernet
Error Control Coding and Ethernet Steven W. McLaughlin and David Warland Calimetrics, Inc. Alameda, CA smclaughlin@calimetrics.com 1 Agenda Background on error control coding History of error control coding
More informationReliability Level List Based Direct Target Codeword Identification Algorithm for Binary BCH Codes
Reliability Level List Based Direct Target Codeword Identification Algorithm for Binary BCH Codes B.YAMUNA, T.R.PADMANABHAN 2 Department of ECE, 2 Department of IT Amrita Vishwa Vidyapeetham. Amrita School
More informationEuler: A System for Numerical Optimization of Programs
Euler: A System for Numerical Optimization of Programs Swarat Chaudhuri 1 and Armando Solar-Lezama 2 1 Rice University 2 MIT Abstract. We give a tutorial introduction to Euler, a system for solving difficult
More informationInterleave-Division Multiple-Access (IDMA) Communications 1
Interleave-Division Multiple-Access (IDMA) Communications 1 Li Ping, Lihai Liu,. Y. Wu, and W.. Leung Department of Electronic Engineering City University of Hong ong, Hong ong eeliping@cityu.edu.h Abstract:
More informationThe QOOL Algorithm for fast Online Optimization of Multiple Degree of Freedom Robot Locomotion
The QOOL Algorithm for fast Online Optimization of Multiple Degree of Freedom Robot Locomotion Daniel Marbach January 31th, 2005 Swiss Federal Institute of Technology at Lausanne Daniel.Marbach@epfl.ch
More informationCapacity Limits of MIMO Channels
Tutorial and 4G Systems Capacity Limits of MIMO Channels Markku Juntti Contents 1. Introduction. Review of information theory 3. Fixed MIMO channels 4. Fading MIMO channels 5. Summary and Conclusions References
More informationA Network Flow Approach in Cloud Computing
1 A Network Flow Approach in Cloud Computing Soheil Feizi, Amy Zhang, Muriel Médard RLE at MIT Abstract In this paper, by using network flow principles, we propose algorithms to address various challenges
More informationBreaking the Interleaving Bottleneck in Communication Applications for Efficient SoC Implementations
Microelectronic System Design Research Group University Kaiserslautern www.eit.uni-kl.de/wehn Breaking the Interleaving Bottleneck in Communication Applications for Efficient SoC Implementations Norbert
More informationComparison of Network Coding and Non-Network Coding Schemes for Multi-hop Wireless Networks
Comparison of Network Coding and Non-Network Coding Schemes for Multi-hop Wireless Networks Jia-Qi Jin, Tracey Ho California Institute of Technology Pasadena, CA Email: {jin,tho}@caltech.edu Harish Viswanathan
More informationOn the Traffic Capacity of Cellular Data Networks. 1 Introduction. T. Bonald 1,2, A. Proutière 1,2
On the Traffic Capacity of Cellular Data Networks T. Bonald 1,2, A. Proutière 1,2 1 France Telecom Division R&D, 38-40 rue du Général Leclerc, 92794 Issy-les-Moulineaux, France {thomas.bonald, alexandre.proutiere}@francetelecom.com
More informationIntroduction to Machine Learning and Data Mining. Prof. Dr. Igor Trajkovski trajkovski@nyus.edu.mk
Introduction to Machine Learning and Data Mining Prof. Dr. Igor Trakovski trakovski@nyus.edu.mk Neural Networks 2 Neural Networks Analogy to biological neural systems, the most robust learning systems
More information858-651-4351 858-845-7566
Conference Call C30-20030930-062 Title: R-PDCCH Performance Evaluation Abstract: The performance of R-PDCCH is evaluated in this contribution. In particular, we study different approaches for error detection
More informationCooperative Communication in Wireless Networks
ADAPTIVE ANTENNAS AND MIMO SYSTEMS FOR WIRELESS COMMUNICATIONS Cooperative Communication in Wireless Networks Aria Nosratinia, University of Texas, Dallas, Todd E. Hunter, Nortel Networks Ahmadreza Hedayat,
More informationPATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION
PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION Introduction In the previous chapter, we explored a class of regression models having particularly simple analytical
More informationIN current film media, the increase in areal density has
IEEE TRANSACTIONS ON MAGNETICS, VOL. 44, NO. 1, JANUARY 2008 193 A New Read Channel Model for Patterned Media Storage Seyhan Karakulak, Paul H. Siegel, Fellow, IEEE, Jack K. Wolf, Life Fellow, IEEE, and
More informationThe Degrees of Freedom of Compute-and-Forward
The Degrees of Freedom of Compute-and-Forward Urs Niesen Jointly with Phil Whiting Bell Labs, Alcatel-Lucent Problem Setting m 1 Encoder m 2 Encoder K transmitters, messages m 1,...,m K, power constraint
More informationComputer Networks and Internets, 5e Chapter 6 Information Sources and Signals. Introduction
Computer Networks and Internets, 5e Chapter 6 Information Sources and Signals Modified from the lecture slides of Lami Kaya (LKaya@ieee.org) for use CECS 474, Fall 2008. 2009 Pearson Education Inc., Upper
More informationDiscussion Paper Category 6 vs Category 5e Cabling Systems and Implications for Voice over IP Networks
Discussion Paper Category 6 vs Category 5e Cabling Systems and Implications for Voice over IP Networks By Galen Udell Belden CDT Networking 2006 Category 6 vs Category 5e Cabling Systems and Implications
More informationFundamental to determining
GNSS Solutions: Carrierto-Noise Algorithms GNSS Solutions is a regular column featuring questions and answers about technical aspects of GNSS. Readers are invited to send their questions to the columnist,
More informationHSDPA Mobile Broadband Data A Smarter Approach to UMTS Downlink Data
HSDPA Mobile Broadband Data A Smarter Approach to UMTS Downlink Data UMTS mobile wireless systems have enjoyed widespread uptake of high-quality circuit-switched applications like voice and video telephony.
More informationPAPR and Bandwidth Analysis of SISO-OFDM/WOFDM and MIMO OFDM/WOFDM (Wimax) for Multi-Path Fading Channels
PAPR and Bandwidth Analysis of SISO-OFDM/WOFDM and MIMO OFDM/WOFDM (Wimax) for Multi-Path Fading Channels Ahsan Adeel Lecturer COMSATS Institute of Information Technology Islamabad Raed A. Abd-Alhameed
More informationSolution of Linear Systems
Chapter 3 Solution of Linear Systems In this chapter we study algorithms for possibly the most commonly occurring problem in scientific computing, the solution of linear systems of equations. We start
More informationLecture 3: Linear methods for classification
Lecture 3: Linear methods for classification Rafael A. Irizarry and Hector Corrada Bravo February, 2010 Today we describe four specific algorithms useful for classification problems: linear regression,
More informationResearch on the UHF RFID Channel Coding Technology based on Simulink
Vol. 6, No. 7, 015 Research on the UHF RFID Channel Coding Technology based on Simulink Changzhi Wang Shanghai 0160, China Zhicai Shi* Shanghai 0160, China Dai Jian Shanghai 0160, China Li Meng Shanghai
More informationTHE general view is that the use of a continuous thin-film
IEEE TRANSACTIONS ON MAGNETICS, VOL. 43, NO. 10, OCTOBER 2007 3925 Improved Data Recovery from Patterned Media With Inherent Jitter Noise Using Low-Density Parity-Check Codes Ioannis T. Ntokas 1, Paul
More informationISTANBUL AYDIN UNIVERSITY
ISTANBUL AYDIN UNIVERSITY 2013-2014 Academic Year Fall Semester Department of Software Engineering SEN361 COMPUTER ORGANIZATION HOMEWORK REPORT STUDENT S NAME : GÖKHAN TAYMAZ STUDENT S NUMBER : B1105.090068
More informationEvolution from Voiceband to Broadband Internet Access
Evolution from Voiceband to Broadband Internet Access Murtaza Ali DSPS R&D Center Texas Instruments Abstract With the growth of Internet, demand for high bit rate Internet access is growing. Even though
More informationBandwidth Adaptation for MPEG-4 Video Streaming over the Internet
DICTA2002: Digital Image Computing Techniques and Applications, 21--22 January 2002, Melbourne, Australia Bandwidth Adaptation for MPEG-4 Video Streaming over the Internet K. Ramkishor James. P. Mammen
More informationJitter Measurements in Serial Data Signals
Jitter Measurements in Serial Data Signals Michael Schnecker, Product Manager LeCroy Corporation Introduction The increasing speed of serial data transmission systems places greater importance on measuring
More informationChannel Coding and Link Adaptation
Seminar Ausgewählte Kapitel der Nachrichtentechnik, WS 2009/2010 LTE: Der Mobilfunk der Zukunft Channel Coding and Link Adaptation Shahram Zarei 16. December 2009 Abstract In this work channel coding and
More informationNonlinear Multi-Error Correction Codes for Reliable NAND Flash Memories
1 Nonlinear Multi-Error Correction Codes for Reliable NAND Flash Memories Zhen Wang, Student Member, IEEE, Mark Karpovsky, Fellow, IEEE, and Ajay Joshi, Member, IEEE Abstract Multi-level cell (MLC NAND
More informationExact Maximum-Likelihood Decoding of Large linear Codes
On the Complexity of Exact Maximum-Likelihood Decoding for Asymptotically Good Low Density Parity Check Codes arxiv:cs/0702147v1 [cs.it] 25 Feb 2007 Abstract Since the classical work of Berlekamp, McEliece
More informationA Comparison of General Approaches to Multiprocessor Scheduling
A Comparison of General Approaches to Multiprocessor Scheduling Jing-Chiou Liou AT&T Laboratories Middletown, NJ 0778, USA jing@jolt.mt.att.com Michael A. Palis Department of Computer Science Rutgers University
More informationINTER CARRIER INTERFERENCE CANCELLATION IN HIGH SPEED OFDM SYSTEM Y. Naveena *1, K. Upendra Chowdary 2
ISSN 2277-2685 IJESR/June 2014/ Vol-4/Issue-6/333-337 Y. Naveena et al./ International Journal of Engineering & Science Research INTER CARRIER INTERFERENCE CANCELLATION IN HIGH SPEED OFDM SYSTEM Y. Naveena
More information8. Cellular Systems. 1. Bell System Technical Journal, Vol. 58, no. 1, Jan 1979. 2. R. Steele, Mobile Communications, Pentech House, 1992.
8. Cellular Systems References 1. Bell System Technical Journal, Vol. 58, no. 1, Jan 1979. 2. R. Steele, Mobile Communications, Pentech House, 1992. 3. G. Calhoun, Digital Cellular Radio, Artech House,
More informationCapacity of the Multiple Access Channel in Energy Harvesting Wireless Networks
Capacity of the Multiple Access Channel in Energy Harvesting Wireless Networks R.A. Raghuvir, Dinesh Rajan and M.D. Srinath Department of Electrical Engineering Southern Methodist University Dallas, TX
More informationAn Empirical Study of Two MIS Algorithms
An Empirical Study of Two MIS Algorithms Email: Tushar Bisht and Kishore Kothapalli International Institute of Information Technology, Hyderabad Hyderabad, Andhra Pradesh, India 32. tushar.bisht@research.iiit.ac.in,
More informationRevision of Lecture Eighteen
Revision of Lecture Eighteen Previous lecture has discussed equalisation using Viterbi algorithm: Note similarity with channel decoding using maximum likelihood sequence estimation principle It also discusses
More informationNon-Data Aided Carrier Offset Compensation for SDR Implementation
Non-Data Aided Carrier Offset Compensation for SDR Implementation Anders Riis Jensen 1, Niels Terp Kjeldgaard Jørgensen 1 Kim Laugesen 1, Yannick Le Moullec 1,2 1 Department of Electronic Systems, 2 Center
More informationTCOM 370 NOTES 99-4 BANDWIDTH, FREQUENCY RESPONSE, AND CAPACITY OF COMMUNICATION LINKS
TCOM 370 NOTES 99-4 BANDWIDTH, FREQUENCY RESPONSE, AND CAPACITY OF COMMUNICATION LINKS 1. Bandwidth: The bandwidth of a communication link, or in general any system, was loosely defined as the width of
More informationImage Compression through DCT and Huffman Coding Technique
International Journal of Current Engineering and Technology E-ISSN 2277 4106, P-ISSN 2347 5161 2015 INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Research Article Rahul
More informationData Link Layer Overview
Data Link Layer Overview Date link layer deals with two basic issues: Part I How data frames can be reliably transmitted, and Part II How a shared communication medium can be accessed In many networks,
More informationFirst-order Asymptotics of the BICM Mutual Information: Uniform vs. Nonuniform Distributions
First-order Asymptotics of the BICM Mutual Information: Uniform vs. Nonuniform Distributions Erik Agrell Department of Signals and Systems Chalmers University of Technology SE-41296 Göteborg Sweden Email:
More informationOptimal Index Codes for a Class of Multicast Networks with Receiver Side Information
Optimal Index Codes for a Class of Multicast Networks with Receiver Side Information Lawrence Ong School of Electrical Engineering and Computer Science, The University of Newcastle, Australia Email: lawrence.ong@cantab.net
More informationLogistic Regression. Jia Li. Department of Statistics The Pennsylvania State University. Logistic Regression
Logistic Regression Department of Statistics The Pennsylvania State University Email: jiali@stat.psu.edu Logistic Regression Preserve linear classification boundaries. By the Bayes rule: Ĝ(x) = arg max
More informationPHASE ESTIMATION ALGORITHM FOR FREQUENCY HOPPED BINARY PSK AND DPSK WAVEFORMS WITH SMALL NUMBER OF REFERENCE SYMBOLS
PHASE ESTIMATION ALGORITHM FOR FREQUENCY HOPPED BINARY PSK AND DPSK WAVEFORMS WITH SMALL NUM OF REFERENCE SYMBOLS Benjamin R. Wiederholt The MITRE Corporation Bedford, MA and Mario A. Blanco The MITRE
More informationIntroduction to Support Vector Machines. Colin Campbell, Bristol University
Introduction to Support Vector Machines Colin Campbell, Bristol University 1 Outline of talk. Part 1. An Introduction to SVMs 1.1. SVMs for binary classification. 1.2. Soft margins and multi-class classification.
More informationCurrent Standard: Mathematical Concepts and Applications Shape, Space, and Measurement- Primary
Shape, Space, and Measurement- Primary A student shall apply concepts of shape, space, and measurement to solve problems involving two- and three-dimensional shapes by demonstrating an understanding of:
More informationNetwork Coding for Distributed Storage
Network Coding for Distributed Storage Alex Dimakis USC Overview Motivation Data centers Mobile distributed storage for D2D Specific storage problems Fundamental tradeoff between repair communication and
More informationWITH his 1948 paper, A Mathematical Theory of
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 44, NO. 6, OCTOBER 1998 2531 Applications of Error-Control Coding Daniel J. Costello, Jr., Fellow, IEEE, Joachim Hagenauer, Fellow, IEEE, Hideki Imai, Fellow,
More informationIEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 8, AUGUST 2008 3425. 1 If the capacity can be expressed as C(SNR) =d log(snr)+o(log(snr))
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 54, NO 8, AUGUST 2008 3425 Interference Alignment and Degrees of Freedom of the K-User Interference Channel Viveck R Cadambe, Student Member, IEEE, and Syed
More informationA WEB BASED TRAINING MODULE FOR TEACHING DIGITAL COMMUNICATIONS
A WEB BASED TRAINING MODULE FOR TEACHING DIGITAL COMMUNICATIONS Ali Kara 1, Cihangir Erdem 1, Mehmet Efe Ozbek 1, Nergiz Cagiltay 2, Elif Aydin 1 (1) Department of Electrical and Electronics Engineering,
More informationSphere-Bound-Achieving Coset Codes and Multilevel Coset Codes
820 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 46, NO 3, MAY 2000 Sphere-Bound-Achieving Coset Codes and Multilevel Coset Codes G David Forney, Jr, Fellow, IEEE, Mitchell D Trott, Member, IEEE, and Sae-Young
More informationDigital Modulation. David Tipper. Department of Information Science and Telecommunications University of Pittsburgh. Typical Communication System
Digital Modulation David Tipper Associate Professor Department of Information Science and Telecommunications University of Pittsburgh http://www.tele.pitt.edu/tipper.html Typical Communication System Source
More informationAlgorithms for Interference Sensing in Optical CDMA Networks
Algorithms for Interference Sensing in Optical CDMA Networks Purushotham Kamath, Joseph D. Touch and Joseph A. Bannister {pkamath, touch, joseph}@isi.edu Information Sciences Institute, University of Southern
More informationQuality Optimal Policy for H.264 Scalable Video Scheduling in Broadband Multimedia Wireless Networks
Quality Optimal Policy for H.264 Scalable Video Scheduling in Broadband Multimedia Wireless Networks Vamseedhar R. Reddyvari Electrical Engineering Indian Institute of Technology Kanpur Email: vamsee@iitk.ac.in
More informationOptimal Transmit Spectra for Communication on Digital Subscriber Lines
Optimal Transmit Spectra for Communication on Digital Subscriber Lines Rohit V. Gaikwad and Richard G. Baraniuk Department of Electrical and Computer Engineering Rice University Houston, Texas, 77005 USA
More informationRN-coding of Numbers: New Insights and Some Applications
RN-coding of Numbers: New Insights and Some Applications Peter Kornerup Dept. of Mathematics and Computer Science SDU, Odense, Denmark & Jean-Michel Muller LIP/Arénaire (CRNS-ENS Lyon-INRIA-UCBL) Lyon,
More informationFactor Graphs and the Sum-Product Algorithm
498 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 2, FEBRUARY 2001 Factor Graphs and the Sum-Product Algorithm Frank R. Kschischang, Senior Member, IEEE, Brendan J. Frey, Member, IEEE, and Hans-Andrea
More informationDesigning the NEWCARD Connector Interface to Extend PCI Express Serial Architecture to the PC Card Modular Form Factor
Designing the NEWCARD Connector Interface to Extend PCI Express Serial Architecture to the PC Card Modular Form Factor Abstract This paper provides information about the NEWCARD connector and board design
More information