Scribd Logo
Upload

Welcome to Scribd!

  • Interleaved Code

    Uploaded by

    rajbabu
    12 views2 pages
    interleaved convolution

    Original Title

    interleaved code

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    interleaved convolution

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    12 views2 pages

    Interleaved Code

    Uploaded by

    rajbabu
    interleaved convolution

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    of 2
    TABLE 9.3 CONTINUED Code Burst-correcting Generator n-k-2 (6) capability polynomial g(X) (164, 153) 4 6255 (195, 182) 5 22475 (217, 202) 6 120247 (290, 277) 5 24711 4 (43, 29) s $2225 (91, 79) 4 10571 (93, 83) 3 2065 (117, 105) 4 13413 (133, 115) 7 1254355 (255, 245) 3 3523 255, 243) 4 17667 (255, 241) 5 76305 (255, 239) 6 301565 273, 261) 4 10743 (511, 499) 4 10451 (595, 581) 5 64655 3 (465, 454) 3 Ta15 (1023, 1010) 4 22365 9.4 INTERLEAVED CODES Given an (n, k) cyclic code, it is possible to construct a (An, 4k) cyclic code (ie., a code A times as long with 4 times as many information digits) by incerleaving. This is done simply by arranging 4 code vectors in the original code into 4 rows of a rectan- gular array and then transmitting themcolumn by column as shown in Figure 9.5. The resulting code is called an interleaved code, The parameter 2 is referred to as the interleaving degree. 4 Transmission Cy yy py Oy TT. trees [Et Ic aEeEeal tl Lee oe t tt 41 4 4 Lhe tT] ZF Wt nt —o —— “igure 9.5 Transmission of an interleaved code. Sec. 9.4 Interleaved Codes an Obviously, a pattern of errors can be corrected for the whole array if and only if the pattern of errors in each row is a correctable pattern for the original code, No matter where it starts, a burst of length 2 will affect no more than one digit in each row. Thus, if the original code corrects single errors, the interleaved code corrects single bursts of length 4 or less. If the original code corrects any single burst of length / or less, the interleaved code will correct any single burst of length 4/ or less. If an (n, b) code has maximum possible burst-error-correcting capability (i.e.,m — k — 2/ = 0), the interleaved (An, Ak) code also has maximum possible burst-error-correcting capability. By interleaving short codes with maximum possible burst-error-correcting capability, it is possible to construct codes of practically any length with maximum. burst-error-correcting ability. Therefore, the interleaving technique reduces the prob- Jem of searching long efficient burst-error-correcting codes to search good short codes. The obvious way to implement an interleaved code is to set up the array and operate on rows in encoding and decoding. This is generally not the simplest imple- mentation. The simplest implementation results from the observation that if the original code is cyclic, the interleaved code is also cyclic. If the generator polynomial of the original code is g(X), the generator polynomial for the interleaved code is a(X) (see Problem 9.6). Thus, encoding and syndrome computation can be accom- plished by using shift registers. It turns out that the decoder for the interleaved code can be derived from the decoder of the original code simply by replacing each register stage of the original decoder by A stages without changing the other connections. This essentially allows the decoder circuitry to look at successive rows of the code array on successive decoder eycles. Therefore, if the decoder of the original code is simple (this is usually true for short codes), so is the decoder for the interleaved code. The interleaving technique described above is effective not only for deriving long powerful single-burst-error-correcting codes from short optimal single-burst- error-correcting codes, but also for deriving long powerful burst-and-random-error- correcting codes from short codes. 9.5 PHASED-BURST-ERROR-CORRECTING CODES Consider an (n, k) code whose length » is a multiple of m, say n = om. The om digits of each code vector may be grouped into @ subblocks; each subblock consists of m consecutive code digits. For example, let V = (oy 15 Pay + +5 Pom—1) be a code vector. Then the ith subblock consists of the following consecutive code digits Yims Binet 69 Pte mats with 0

    You might also like