Arnold M. Michelson and Allen H. Levesque, Error-control techniques for digital communication, Wiley, New York, NY, 1985.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....(2) at the receiver, the received packet is decoded by an error correction decoder (if class I) or an error detection decoder (if class II) as shown in Figure 4. The dual mode receiver is expected to work well since using a channel code, the decoder can detect more errors than those correctable [18]. We will not consider error combating techniques any more since they are not within the primary scope of this paper, but we assume that a packet is received correctly unless that packet collides with one or more concurrent packets. 3 Protocol Description When a mobile client wants to send a ....

Arnold M. Michelson and Allen H. Levesque, Error-control techniques for digital communication, Wiley, New York, NY, 1985.

....the receiver, the received packet is decoded by an error correction decoder (if class I and II) or an error detection decoder (if class III) as show, in Figure 4. The dual mode receiver is expected to work well since using a channel code, the decoder can detect more errors than those correctable [19]. To ensure virtually error free packet delivery, we assume that certain channel coding and diversity schemes with a dual mode receiver (with an ARQ scheme) are used to combat noises, interferences, and multipath fadings. We will not Although combined FEC and diversity seems to be the only way for ....

A.M. Michelson and A. H. Levesque, Error-control techniques for digital communication, Wiley, New York, NY, 1985.

....(2) at the receiver, the received packet is decoded by an error correction decoder (if class I) or an error detection decoder (if class II) as shown in figure 4. The dual mode receiver is expected to work well since using a channel code, the decoder can detect more errors than those correctable [13]. We will not consider error combating techniques any more since they are not within the primary scope of this paper, but we assume that Although combined FEC and diversity seems to be the only way for error protection of class I, it is extremely difficult to guarantee the virtually error free ....

A.M. Michelson and A.H. Levesque, Error-Control Techniques for Digital Communication (Wiley, New York, 1985).

....the result suggests that the adaptive error control such as the one proposed in this paper can be effective in the real world. X. RELATED WORK Error control coding is well established and widely used for many applications ranging from wireless communications to storage systems [2] 12] [14]. In this paper, we considered how to use error control coding adaptively by adopting well known RS codes rather than developing new error control codes. The authors of [10] argued for energy efficiency as the most important factor in error control schemes, and suggested adaptive use of an ARQ or ....

A. M. Michelson and A. H. Levesque, Error-Control Techniques For Digital Communication. New York: Wiley, 1985.

....performance bound, symbol by symbol decoding, trellis code. I. INTRODUCTION T RELLIS CODES for DMC s are classically employed in combination with optimal or nearly optimal (in a maximum likelihood (ML) sense) sequence type decoders with additive decoding metrics and unbounded decision delays [1], 5] 16, ch. 5] In these cases, the ML sequence estimator (MLSE) generally implemented via the Viterbi algorithm (VA) 4] constitutes the theoretically optimum decoder, and its properties have been largely investigated in the past years. In particular, several tight analytical performance ....

....In these cases, the ML sequence estimator (MLSE) generally implemented via the Viterbi algorithm (VA) 4] constitutes the theoretically optimum decoder, and its properties have been largely investigated in the past years. In particular, several tight analytical performance bounds are available [1], 4] 15] 16, Sec. 5.3.4] and it is well stated that the maximization of the Hamming distance between codewords virtually represents the optimum criterion for the construction of good convolutional codes when sequencetype decoders with additive metrics are employed [1, Sec. 8.4 9.7] 16, ....

[Article contains additional citation context not shown here]

A. M. Michelson and A. H. Levesque, Error Control Techniques for Digital Communication. New York: Wiley, 1985, ch. 8--9.

.... channel with arbitrarily small error probabilities provided the data rate (including that due to parity bits) over the channel is less than the channel capacity (as defined by the classical Shannon s theorem) Over the last four decades a number of powerful and efficient codes have been designed [8,16,19,23]. 2.1. Block coding Block coding schemes divide a bit stream into nonoverlapping blocks and code each block independently. Block codes used in practical applications today belong to the class of linear cyclic codes, since these codes lend themselves to easier implementations. A coding scheme is ....

....optimal algorithm [16] Its decoding complexity grows exponentially with code memory length. Therefore it is effective for short memory length codes. Many other decoding algorithms such sequential decoding, majority logic decoding, etc. have also been developed; interested readers are referred to [8,19] for a more detailed discussion. 2.4. Code puncturing The characteristics of a wireless channel typically vary with time, and therefore to obtain optimal performance it is necessary to adapt the error coding scheme to the changing channel characteristics. Code puncturing allows an encoder ....

[Article contains additional citation context not shown here]

A. Michelson and A. Levesque, Error-Control Techniques for Digital Communication (Wiley, New York, 1985).

....are also referred to as Galois fields. The two names will be used interchangeably. Galois fields with q elements are denoted as GF (q) Over the last thirty years, Galois fields have gained wide spread technical applications. Areas where they have applications are: ffl Algebraic codes [Bla83] ML85] ffl Cryptographic schemes [vT88] Sch93] ffl Digital signal processing [Bla85] McC79] ffl Random number generators [WP90] ffl VLSI testing [GSB91] The first two topics play an important role in modern digital communication. Since there is an increasing number of applications of ....

....in decoding algorithms. Shortened RS codes are, just like standard RS codes, Maximum Distance Separable (MDS) Codes, because they meet the Singleton bound with equality: d min = n Gamma k 1 [Bla83] With a symbol error probability equal to p s and using the weight distribution of MDS codes [ML85] the undetected error probability for a (n,k) shortened) RS codes over GF (q) is upperbounded by : P U (E) n X i=0 n i (q Gamma 1) 1 Gammai i Gammad X j=0 ( Gamma1) j i Gamma 1 j q i Gammad Gammaj p i s (1 Gamma p s ) n Gammai ; In order to keep the ....

A.M. Michelson and A.H. Levesque. Error-Control Techniques for Digital Communication. Wiley & Sons Inc., 1985.

....coding plays an increasingly important role in today s communication systems. Described concisely, error control coding involves the addition of redundancy to transmitted data so as to provide the means for detecting and correcting errors that inevitably occur in any real communications process [1]. Such coding techniques are particularly useful for transmission over limited power channels like general switched telephone network (GSTN) Adding redundancy to the transmitted data and making use of soft decision decoding, the bit error rate can be reduced considerably without increasing ....

....3 that only two input bits are differentially encoded. Because of differential encoding, errors caused by phase reversal in the channel are not allowed to propagate, and the information sequence is reconstructed by the receiver except for the errors at points where phase reversal has occurred [1]. Figure 3. Viterbi Encoder Convolutional Encoding Scheme Definitions: Convolutional Encoder Bit Redundant Encoder From Differential Y0 Y2 Y1 3 Bits of Memory S2 S1 S0 S0, S1, and S2 are called delay states Y0, Y1, and Y2 are called path states Constraint condition: ....

[Article contains additional citation context not shown here]

Michelson, A. M., and Levesque, A. H., Error-Control Techniques for Digital Communications, John Wiley & Sons, 1985.

....stages that are implemented in hardware: data generator, encoder, noise simulator and decoder. The data generator and encoder are best suited for a microprocessor and hence, the RISC is employed to simulate these tasks. The multipliers are used to model the noise simulator which simulates AWGN [16] and adds it to the encoded information bit sequence. Finally, the decoder can be modeled on an FPGA. The decoder portion is based on single bit operations, which is well suited to exploit the flexible nature of FPGAs. Application partitioning and data flow is shown in the Figure 8. 4.1.3 IIR ....

S. Michelson and D. Levesque. Error-control Techniques for Digital Communications. John Wiley and Sons, Boston, Ma, 1992.

....(2) at the receiver, the received packet is decoded by an error correction decoder (if class I) or an error detection decoder (if class II) as shown in Figure 4. The dual mode receiver is expected to work well since using a channel code, the decoder can detect more errors than those correctable [18]. We will not consider error combating techniques any more since they are not within the primary scope of this paper, but we assume that a packet is received correctly unless that packet collides with one or more concurrent packets. 3 Protocol Description When a mobile client wants to send a ....

Arnold M. Michelson and Allen H. Levesque, Error-control techniques for digital communication, Wiley, New York, NY, 1985.

....of error detecting (and error correcting) codes. A very brief introduction to code generation is given in the appendix to this paper. However, readers should realize that there is a vast literature on this subject; to find out more, they should look at a thorough treatment such as that given in [Michelson and Levesque, 1985], or [MacWilliams and Sloane, 1977] 0 10 20 30 40 50 60 70 80 0 20 40 60 80 100 120 140 160 180 200 Min size String length q=8 q=7 q=6 q=5 q=4 q=3 q=2 Figure 1: Minimal population sizes for 95 confidence of all alleles present 10 20 30 40 50 60 70 80 90 0 20 40 60 80 100 120 140 160 180 200 ....

A.M.Michelson and A.H.Levesque (1985) Error Control Techniques for Digital Communication. Wiley, New York.

.... Q( q 2kE b nNo ) P coded (C) t X i=0 n i (1 Gamma P 0 b ) n Gammai P 0 b i : 2) The average probability of packet or cell loss, PCL , is given by PCL = 1 Gamma P (C) 3) In Figure 2, we compare the current ATM cyclic code with the Bose Chaudhuri Hocquenghen (BCH) code [6], which is a widely used technique for providing highperformance FEC with reasonable complexity. It can provide a significant advantage for wireless ATM. BCH cyclic codes are among the most important block codes, since they exist for a wide range of rates, achieve significant coding gains, and can ....

....CRC (40,32,1) BCH (63,45,3) BCH (63,39,4) BCH (63,36,5) 0.5 1 1.5 2 2.5 3 3.5 4 4.5 x 10 3 10 8 10 7 10 6 10 5 10 4 10 3 10 2 10 1 10 0 Average Bit Error Average CLR vs. Average Bit Error using BPSK Figure 3: Probability of Cell Loss versus bit error rate, BER speeds [6]. For example, at a SNR of 8 dB, the probability of cell loss of the (n = 63; k = 45) BCH is PCL = 1:88 Theta10 Gamma6 , but for normal ATM, it is PCL = 4:20 Theta10 Gamma4 . The improvement is almost 2 decades for an increase in header size of only 57 . The same improvement is also ....

A. M. Michelson, A. H. Levesque, Error-Control Techniques For Digital Communication, John Wiley & Sons Inc., 1985

....the receiver, the received packet is decoded by an error correction decoder (if class I and II) or an error detection decoder (if class III) as shown in Figure 4. The dual mode receiver is expected to work well since using a channel code, the decoder can detect more errors than those correctable [19]. To ensure virtually error free packet delivery, we assume that certain channel coding and diversity schemes with a dual mode receiver (with an ARQ scheme) are used to combat noises, interferences, and multipath fadings. We will not 1 Although combined FEC and diversity seems to be the only way ....

A. M. Michelson and A. H. Levesque, Error-control techniques for digital communication, Wiley, New York, NY, 1985.

No context found.

A. M. Michelson and A. H. Levesque, Error--control Techniques for Digital Communication, Wiley, 1985.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC