US20040073861A1 - Interleaved reed solomon coding for home networking - Google Patents

Abstract

A method of transmitting and receiving data packets over a channel susceptible to random burst and/or white gaussian noise channel errors. Each data packet is encoded to form error correctable encoded data packets. Each error correctable encoded data packet is interleaved to form interleaved error correctable encoded data packets. Each interleaved error correctable encoded data packet is modulated to form modulated interleaved error correctable encoded data packets. Each modulated interleaved error correctable encoded data packet is transmitted over the channel. The channel can be a telephone line. The encoding includes performing Reed Solomon encoding on each data packet to form Reed Solomon error correctable encoded data packets. Each data packet is cyclic redundancy check encoded prior to performing Reed Solomon encoding. Modulated interleaved error correctable encoded data packets are received from the channel. Each modulated interleaved error correctable encoded data packet is demodulated to form demodulated interleaved error correctable encoded data packets. Each demodulated error correctable encoded data packet is deinterleaved to form deinterleaved demodulated error correctable encoded data packets. Each deinterleaved demodulated error correctable encoded data packet is decoded to extract each transmitted data packet. The decoding includes performing Reed Solomon decoding on each deinterleaved demodulated error correctable encoded data packet to form Reed Solomon decoded data packets. Each Reed Solomon decoded data packet is cyclic redundancy check decoded after performing Reed Solomon decoding.

Description

CROSS-REFERENCE TO RELATED APPLICATIONS
• This patent application is a continuation of U.S. patent application Ser. No. 09/573,243 filed on May 18, 2000.[0001]
BACKGROUND OF THE INVENTION
• The present invention relates to the field of data encoding and decoding, and in particular, data encoding/decoding for use in a home network communications system.[0002]
• As computers become more and more cost effective for the everyday consumer and for small businesses, such computers become more plentiful for use within local area environments such as homes, office buildings and the like. For example, within a home a person with a computer in the bedroom, and another in the living room, may want to share common files, utilize a common digital subscriber line (DSL), or otherwise transfer information between the computers. Accordingly, various technologies are being developed for computer interconnection of multiple computers located within such environments. One example of such technologies are the Home Phoneline Network Alliance (HPNA) specifications for local area network (LAN) computer interconnection which utilize existing telephone lines within the local environment for the transmission of data packets between the computers. Another example is the use of existing power lines within the home as a transmission medium.[0003]
SUMMARY OF THE INVENTION
• A method of transmitting and receiving data packets over a channel susceptible to random burst, and/or even additive white gaussian noise, channel errors is provided. Each data packet is encoded to form error correctable encoded data packets. Each error correctable encoded data packet is interleaved to form interleaved error correctable encoded data packets. Each interleaved error correctable encoded data packet is modulated to form modulated interleaved error correctable encoded data packets. Each modulated interleaved error correctable encoded data packet is transmitted over the channel. The channel can be a telephone line. The encoding includes performing Reed Solomon encoding on each data packet to form Reed Solomon error correctable encoded data packets. Each data packet is cyclic redundancy check encoded prior to performing Reed Solomon encoding. Modulated interleaved error correctable encoded data packets are received from the channel. Each modulated interleaved error correctable encoded data packet is demodulated to form demodulated interleaved error correctable encoded data packets. Each demodulated error correctable encoded data packet is deinterleaved to form deinterleaved demodulated error correctable encoded data packets. Each deinterleaved demodulated error correctable encoded data packet is decoded to extract each transmitted data packet. The decoding includes performing Reed Solomon decoding on each deinterleaved demodulated error correctable encoded data packet to form Reed Solomon decoded data packets. Each Reed Solomon decoded data packet is cyclic redundancy check decoded after performing Reed Solomon decoding.[0004]
• A system for transmitting and receiving data packets over a channel susceptible to random burst and/or white gaussian noise channel errors is also provided. A transmitter and a receiver are coupled to the channel.[0005]
• The transmitter includes:[0006]
• an encoder for encoding each data packet to form error correctable encoded data packets;[0007]
• an interleaver coupled to the encoder for interleaving each error correctable encoded data packet to form interleaved error correctable encoded data packets;[0008]
• a modulator coupled to the interleaver for modulating each interleaved error correctable encoded data packet to form modulated interleaved error correctable encoded data packets.[0009]
• The receiver includes:[0010]
• a demodulator for receiving modulated interleaved error correctable encoded data packets from the channel and demodulating each modulated interleaved error correctable encoded data packet to form demodulated interleaved error correctable encoded data packets;[0011]
• a deinterleaver coupled to the demodulator for deinterleaving each demodulated error correctable encoded data packet to form deinterleaved demodulated error correctable encoded data packets;[0012]
• a decoder coupled to the deinterleaver for decoding each deinterleaved demodulated error correctable encoded data packet to extract each transmitted data packet.[0013]
DESCRIPTION OF THE DRAWINGS
• FIG. 1 shows in block diagram form a home networking environment within which the present invention can be implemented.[0014]
• FIG. 2 shows in block diagram form an embodiment of the present invention.[0015]
• FIG. 3 shows in block diagram form an embodiment of an intrapacket encoder in accordance with the present invention.[0016]
• FIG. 4 shows in block diagram form the operation of an interleaver in accordance with the present invention.[0017]
• FIG. 5 shows in block diagram form an embodiment of an intrapacket decoder in accordance with the present invention.[0018]
• FIG. 6 shows in block diagram form an embodiment of a CRC encoder in accordance with the present invention.[0019]
• FIG. 7 shows in block diagram form an embodiment of a CRC decoder in accordance with the present invention.[0020]
• FIG. 8 shows in block diagram form an embodiment of a Reed Solomon encoder in accordance with the present invention.[0021]
• FIG. 9 shows in block diagram form an embodiment of a Reed Solomon decoder in accordance with the present invention.[0022]
DETAILED DESCRIPTION OF THE INVENTION
• FIG. 1 depicts a typical home environment.[0023]Home network10 includes existing (installed) plain old telephone service (POTS)wiring12,network clients14, the computer port side ofmodem16 andfax18.POTS wiring12 provides wiring infrastructure used to network multiple clients at a customer premises (e.g., home)20.POTS wiring12 can be conventional unshielded twisted pair (UTP) wiring that is generally routed internally in the walls of thecustomer premises20 to various locations (e.g., rooms) within the customer premises. Subscriber loop22(also called a “local loop”) is a physical wiring link that directly connects anindividual customer premises20 to the Central Office throughtelephone network interface24, a demarcation point between the inside and outside ofcustomer premises20.
• Of particular importance for these networks are systems that provide communication between computers as reliably and with as high a data rate as possible. Such reliability necessitates combating the introduction of errors in data packets that are transmitted between computers. Such errors can arise from various electrical signals which can occur from electrical devices within the home, for example, impulse noise from a refrigerator, or from a phone ringing. These types of electrical appliances generate electrical signals which will couple into the UTP or whatever medium that is being used to transmit the data between the computers which are communicating. Such a ringing phone generates an electrical impulse signal which can corrupt a portion of the data packet being transmitted. Such errors are localized in time and corrupt a small segment of the data being transferred back and forth. These types of errors are generally referred to a “error bursts”. Channels over which data is transmitted that have such errors are generally referred to as “bursty error channels”.[0024]
• Further, even in channels where bursts are not received, distortions can occur from additive white gaussian noise.[0025]
• While within the HPNA specifications there is provided a means for the system to adapt itself to changes in the channel when there is suddenly an increase in noise or there is some other disturbance that is causing gross changes in the wiring, however, such adaptation does take some time. Therefore, during the time period from when the channel changes occur until the computers catch up (adapt), there may be quite a few errors occurring.[0026]
• Also, in accordance with the HPNA specifications, within the receiver there is a device called the decision feedback equalizer. It makes tentative decisions as to what bits were being sent and then tries to subtract out the sources of errors based upon the tentative decisions. However, in the case where the tentative decisions are not very good, the attempt to subtract out the errors tends to create further errors. In other words, it actually hurts the system rather than helping it.[0027]
• Reiterating, these types of error events are ones that are generally localized in time, namely, they don't happen at a regular occurrence. Most of the time the transmission will be acceptable, but occasionally there can be a bunch of errors grouped together. At the rate at which these errors typically occur, the transmitted packets will see at most one error burst.[0028]
• At present, the HPNA specifications do not use any error correcting code system. It uses a simple well-known cyclic redundancy check (CRC). In accordance with the CRC process a number is developed based upon the statistical computation on the bytes which are in the packet. At the receive end, if the number matches a preset number, there is a presumption that the number is correct and, therefore, that there are not any errors. If the number does not match, there is a presumption that there are errors. The receiver thereupon indicates that the packet should be discarded and requests that the transmitter resend the packet.[0029]
• Therefore, a need exists for error correcting codes which can form part of the technologies being developed which utilize telephone wiring (or alternatively power line wiring) within the home or office. If error correcting codes in accordance with the present invention are implemented, fewer packets will have errors that require a retransmission of the packet. As such, more of the packets will arrive correctly at the receiver on the first try, and thereby result in a higher data rate, and, in turn, provide a net increase in system data throughput.[0030]
• Referring to FIG. 2, there is depicted in block diagram form an embodiment of the present invention wherein[0031]source computer14ais desirous of communicating via a home networking protocol (e.g., HPNA specification versions 1.0 and 2.0) withdestination computer14bover achannel12a.The environment in which the embodiment operates is similar to that depicted in FIG. 1.Source computer14awishes to send a packet(s) of data todestination computer14b.Source computer14aincludesdata source30 andtransmitter32.Transmitter32 is typically a chip residing on a board withinsource computer14a.Transmitter32 includesintrapacket encoder34 andmodulator36.Intrapacket encoder34 performs Reed Solomon encoding to help protect the packet from errors.Source30 provides the data packet tointrapacket encoder34, which encodes the packet, as described in more detail below. The encoded packet gets modulated bymodulator36 and gets sent overchannel12atodestination computer14b.Destination computer14bincludesreceiver38.Receiver38 has ademodulator40 andintrapacket decoder42.Demodulator40 demodulates the received encoded packet in accordance with the home networking protocol modulation/demodulation implemented as set forth in the HPNA specification, namely, Quadrature Amplitude Modulation (QAM). The modulation uses constellation sizes from 4 QAM up to 256 QAM.Intrapacket decoder42 receives the demodulated encoded packet, decodes the encoded packet and provides a correct packet of bytes topacket destination44.
• The modulation/demodulation/transmission/reception are as provided by the commercially available Broadcom Model No. 4210 HomeNetworking Controller chip.[0032]
• Referring to FIG. 3,[0033]intrapacket encoder34 is depicted in block diagram form.Intrapacket encoder34 includesCRC encoder46,Reed Solomon encoder48 andinterleaver50. A packet45 arriving atintrapacket encoder34 is encoded byCRC encoder46 in the manner briefly described above, adding bytes so that the receiver can later detect whether the packet is error free or not. Since the destination computer does not have any knowledge as to what is being sent by the source computer, the destination computer needs this mechanism to determine if the data received is real data or not. After the bytes get added byCRC encoder46, the packet gets passed on toReed Solomon encoder48.Reed Solomon encoder48 adds redundancy to protect against packet errors. The added redundancy is provided by the well-known Reed Solomon process, allowing the receiver to correct certain types of errors which will occur in the packet being transmitted. The added redundancy packet is then passed on tointerleaver50.Interleaver50 reorders the bytes to protect them against burst errors. As such, when an error burst occurs it won't affect the same group of bytes that the Reed Solomon encoder outputs, but will be dispersed over a number of bytes.
• Still referring to FIG. 3,[0034]CRC encoder46 takes in a packet of the information bytes and runs through a computation which generates a series of check sum bytes for error detection use at the receiver. This process provides a good indication at the receiver as to whether the packet is error-free with little added redundancy. At the receiver, the same computation is performed and the check sum bytes seen at the decoder in the receiver are examined to determine if they match the check sum bytes added byCRC encoder46. If the check sum bytes match, such indicates that the packet is good, that is, it's error-free and useable by the destination computer. Otherwise, if the check sum bytes do not match, such indicates that the packet is not good, and that a retransmission is needed. The operation ofCRC encoder46, which is currently implemented pursuant to the HPNA specifications via software encoding, is described in further detail below.
• Still referring to FIG. 3,[0035]Reed Solomon encoder48 implements a well-known class of error correcting codes wherein a block of bytes from within the packet are taken and from which a set of parity bytes is computed. These parity bytes are added on to the packet, giving added redundancy to protect the packet against errors which may occur over the transmission channel. Encoding is performed within each packet. The encoding is not stretched across multiple packets. In other words, each packet is encoded as its own entity. One of the parameters associated with the Reed Solomon encoding is the Galois field size. Galois field size involves math theory and abstract algebra concepts as to how to manipulate these bytes, that is, the various symbols within a Reed Solomon codeword. The number of bits are specified which correspond to a coordinate of the code word. In accordance with the present invention Galois field256, GF(256), is chosen, wherein each byte is a coordinate of the codeword. This Galois field size provides the convenience of having computations based on byte boundaries. Each byte is a coordinate of a codeword and the modulation scheme utilizes constellation sizes from QPSK, which has four elements, up to 256 QAM, which has eight elements.
• As such, each byte will contain at least one symbol which will go out onto the channel. Therefore, an error burst which affects multiple channel symbols will only affect a small number of bytes. For example, if there is a transmission of two bits per channel symbol, and the burst error affects four channel symbols, the burst error will be confined to one byte.[0036]
• By having a large Galois field size there is provided the advantage of “trapping” the bursts which occur in the channel to a very small fraction of the codeword, i.e., within a few codeword coordinates, allowing it to be easily correctable.[0037]
• This choice of Galois field size allows an efficient implementation in software and an efficient use of memory. As part of the Reed Solomon encoding process, the code rate and codeword size are determined. The code rate is the division of the number of information coordinates by the number of codeword coordinates. Given the rate at which errors are expected to be seen in the channel, the Reed Solomon code rate can be 4/5 to 8/9. The codeword size is the number of bytes which constitute a codeword. Reed Solomon codewords are naturally defined such that the codeword size is one less than the Galois field size. As such, when using GF([0038]256), the corresponding Reed Solomon codeword would normally be 255 bytes long. However, in accordance with the present invention, the Reed Solomon codeword size can be reduced, for example to40 bytes, without sacrificing code rate, resulting in a decreased decoder complexity. Further, systematic encoding is implemented byReed Solomon encoder48, wherein the series of bytes which come in don't get changed, but merely additional bytes are computed which get appended to the end of the packet being encoded, providing the added redundancy. As such, additional computation is not needed on the bytes which come in. The Reed Solomon encoding is implemented in C language as part of driver software for the Broadcom Model No. 4210 HomeNetworking Controller chip.
• Referring to FIGS. 3 and 4,[0039]interleaver50 is described.
• [0040]Interleaver50 reorders bytes within a packet after encoding to protect it against burst errors. In FIG. 4, there is depicted an example of a 3×4 interleaver.Byte stream sequence52 fromReed Solomon encoder48 is shown enteringinterleaver50 in order.Interleaver50 is in essence a memory buffer wherein the bytes are read in by rows, for example, bytes c1, c2, c3, c4 being read into the first row; bytes c5, c6, c7, c8 being read into the second row; and bytes c9, c10, c11, c12 being read into the third row.Interleaver50 then outputs, as read out by columns, reorderedbyte stream sequence54. The size ofinterleaver50 is chosen such that the number of columns is equal to the codeword size and the number of rows is equal to the maximum size of the packet that can be handled. A smaller than maximum packet will accordingly not fill all the rows.
• Referring to FIG. 5,[0041]intrapacket decoder42 is shown in more detail.Intrapacket decoder48 includesdeinterleaver56,Reed Solomon decoder58 andCRC decoder60. Coming in fromdemodulator40, the bytes are deinterleaved bydeinterleaver56 so that the bytes are reordered in the proper order for the Reed Solomon decoding that follows.Reed Solomon decoder58 corrects errors that have occurred within the packet.CRC decoder60 performs computations on the bytes of the packet in order to determine whether or not the packet was error-free.
• Still referring to FIG. 5,[0042]deinterleaver56 is discussed in more detail.Deinterleaver56 is in essence the inverse ofinterleaver50 described above.Deinterleaver56 disperses corrupted bytes over many codewords. That is, when there is a number of bytes clumped together which have errors in them, after being processed by the deinterleaver, the bytes with errors in them are dispersed throughout the entire packet because they are going to be reordered and spread apart. Rather than requiringReed Solomon decoder58 to be able decode one localized burst, the decoder will see much more random errors and fewer errors per codeword block. As such, this aspect reduces required error correction strength of the Reed Solomon decoder and, as a result, its complexity. The same structure that is used in the interleaver is used, but in reverse, namely, with data read in as columns and read out as rows.
• With regard to[0043]Reed Solomon decoder58, it corrects a number of errors up to half the number of parity bytes per block, that is, half the number of bytes of redundancy added per block. As can be seen, with the combination of Reed Solomon encoding and interleaving, a burst error is dispersed over many codewords and a less powerful code is needed to correct all the errors within the packet. Similar to the encoder, the decoder is implemented in C language as part of the software driver for the Broadcom Model No. 4210 HomeNetworking chip set.
• The Reed Solomon decoder implements the basic steps implementing a typical Reed Solomon decoding algorithm. Error coordinates need to be located within a codeword, that is, determining which bytes within a codeword are in error. Syndromes are first computed, which are quantities computed from receive coordinates and prove helpful in the algorithm process. The error locator polynomial is then constructed using the well-known Berlekamp Massey algorithm, which gives a quantity that is passed on to the next step, namely, performing a Chien search. The Chien search determines which bytes within a codeword had an error. Once it is determined which bytes were in error, the magnitude of the error is then determined, so that the error can be corrected (subtracted off), for example, by an algorithm developed by Forney. Once the corrections are made to the codeword, the redundant bytes (parity bytes added in at the encoder) are removed.[0044]
• Still referring to FIG. 5,[0045]CRC decoder60 runs a computation on the packet it receives in order to determine whether or not it has errors. It then compares the result of the computation with the last few bytes of the packet, and if there is a match, the packet is error-free and can be used by the destination computer. If it doesn't match, the packet is indicated as being invalid and that a valid packet needs to be resent.
• With the combination of the Reed Solomon encoding and interleaving, the amount of time that good packets are seen at the CRC decoder increases and the need for packet retransmissions is reduced. Such will thereby improve the overall throughput of the entire system.[0046]
• Referring now to FIGS. 6 and 7[0047]CRC encoder46 and itscounterpart CRC decoder60 are described in more detail. Referring to FIG. 6,CRC encoder46 utilizes the standard CRC-32 encoder typically implemented in Ethernet and compression algorithm systems. It provides a relatively straightforward way to add some minimal redundancy to the transmitted data to determine whether there are any errors at the receiver. As an operational example, considerpacket62 containing L bytes u1, u2, . . . uL to be encoded. The first four bytes u1, u2, u3, u4 have the bits within them complemented by inverter64, namely bits that are 0 become 1 and bits that are 1 become 0. This is undertaken because the CRC encoder is unable to detect a leading run of 0s, that is, it is unable to tell whether there is one 0 or a long string of 0s. Accordingly, the complementing is performed to start the encoder in a situation where it would see a string of 0s at the outset. The complemented bytes, along with the rest of the packet are loaded intobuffer66 while feeding back a generator polynomial, as indicated bynumeral68, a procedure which performs a mathematical computation on the bytes. As one byte at a time is cycled throughbuffer66, the contents of the buffer, a four byte buffer for example, are constantly changing based on the bytes that come into the buffer and the computation performed thereon by the CRC-32 feedback polynomial. Once the end of the packet is reached,inverter70 performs another complementing. The four byte buffer contents as complemented will be taken as parity bytes to be associated with the packet. These fourparity bytes72 will be a unique four byte check sum element for the packet and are concatenated at the end of the packet.
• Referring to FIG. 7, corresponding[0048]CRC decoder60 is described in more detail.CRC decoder60 is implemented in a very similar fashion to that ofCRC encoder46. The last four bytes are not concerned with at first. The other L bytes of the sequence u1, u2 , . . .ul sequence62 are re-encoded in the same way as atencoder46. That is, the first four bytes u1, u2, u3, u4 have the bits within them complemented byinverter74, namely bits that are 0 become 1 and bits that are 1 become 0. The complemented bytes, along with the rest of the packet are loaded intobuffer76 while feeding back a generator polynomial, as indicated bynumeral78, a similar CRC-32 mathematical computation procedure performed on the bytes. As one byte at a time is cycled throughbuffer76, the contents of the similar four byte buffer constantly change based on the bytes that come into the buffer and the computation performed thereon by the CRC-32 feedback polynomial. Once the end of the packet is reached,inverter80 performs another complementing function resulting inbytes82. When a comparison is made atcomparator84 betweenbytes82 andbytes72, if these bytes match the packet is considered valid. If these bytes do not match, a error is indicated and a retransmission of the packet is requested from the transmitter by a standard feedback acknowledgment process.
• Referring now to FIGS. 8 and 9[0049]Reed Solomon encoder48 and its counterpartReed Solomon decoder58 are described in more detail. Referring to FIG. 8, considerpacket86 to be processed.Encoder48 breakspacket86 into K byte blocks, where K is a parameter associated with the Reed Solomon encoder. Redundancy is then added to the K bytes and expands them into N byte segments of the packet. For example, typical values for N and K can be N=40 and K=32, providing, for example, a 4/5 code rate, as was previously described. For one segment of the packet X1 . . .Xk bytes88 are fed intoN-K byte buffer90. Computations are then performed on the bytes through feedback polynomial g(x), as indicated bynumeral92, a known generator polynomial for the Reed Solomon code. The computation provides aseries94 of N-K redundancy bytes y1 . . . yn-k. The N-K bytes are appended at the end of the K bytes X1 . . . Xk. As such, there is provided a codedpacket96, having a series of N byte segments. In the event that the packet does not end on a K byte boundary, the end of the packet has 0s added to complete the full block up to the boundary. The encoding is then done over Galois field256. It should be noted that this encoding is a systematic implementation, wherein the X1 . . . Xk bytes pass through without being modified and, as such, the Y1 . . . Yn-k are only calculated. This allows the data that came into the encoder to be provided directly at the output of the encoder. The systematic coding is helpful in reducing the number of operations performed both a the encoder and at the decoder.
• Referring to FIG. 9, corresponding[0050]Reed Solomon decoder58 is described in more detail.Decoder58 performs the inverse operation ofencoder48.Coded packet98 having groups of N bytes received atdecoder58 have a computation performed on them to obtain decodedpacket100 having groups of K bytes. Given the N bytes that are received, the decoding will attempt to compute the K bytes which most likely led to the N bytes.Received bytes102 r1 . . . rn are taken wherein syndromes are computed, as indicated byblock104. The syndromes are intermediate parameters in the decoding algorithm which will be helpful in the later stages of the processing. After the syndromes are computed, the Berlekamp Massey algorithm is applied, as indicated byblock106, generating an error locator polynomial. This polynomial, a mathematical construct, has as itsroot values 1 through N, which represent the locations of the errors within the N byte block. A Chien search, as indicated byblock108, is then performed. A cycling through all possible values of 1 through N is undertaken in order to determine what the roots are of the error locator polynomial and thereby determine the actual error location. Once the error location is determined, the error magnitude is then determined, so that the errors can be subtracted off and the original K bytes recovered. The standard Forney algorithm, as indicated byblock110, is then performed to compute the error magnitude. Once the error magnitude and locations are determined,error event polynomial112 e1 . . . en is generated. When the error event polynomial is combined with the received bytes, as indicated byblock114, a valid N byte Reed Solomon codeword will be produced. From the N bytes the K bytes are extracted and concatenated and then passed on to the CRC decoder in the next stage of the decoding process.
• In essence, as set forth above, in accordance with the present invention, error correction encoding has been applied to packets involved in home networking transmission to protect the packet transmission from errors that are incurred in home networking channels. Reed Solomon encoding used in conjunction with interleaving helps avoid an impact on the packet transmission resulting from home networking channel transmission errors of a bursty nature which can randomly affect bunches of bytes in a row. The present invention provides a significant improvement in error correction based upon these types of errors.[0051]
• It should be noted, that in accordance with the present invention, rather than implementing the encoding and the decoding algorithms in hardware, the encoding and interleaving can be performed in software as part of the software driver for existing commercially available HPNA specification implemented chip sets, such as the Broadcom Model No. BCM 4210 chip set. This software implementation would not require modification of existing hardware and is distinct from other interleaved Reed Solomon encoding systems (such as those typically found in the compact disc audio system) which perform the operations in hardware. Such a software implementation does not impede the performance of the computers which implement current HPNA specification versions 1.0 and 2.0. The central processing unit (CPU) processing power needed to encode, decode, and interleave can be less than 50 percent of the total processing power.[0052]
• Those skilled in the art can appreciate that, while one embodiment of the present invention has been described, various alternatives can be utilized to practice the invention. For example, different parameters for N and K, different Reed Solomon polynomials, non-systematic rather than systematic encoding, different types of interleavers, all can be chosen rather than the aspects set forth in the embodiments described herein.[0053]

Claims (1)

1. A method of transmitting data packets over a channel susceptible to random burst and/or white gaussian noise channel errors comprising:

encoding each data packet to form error correctable encoded data packets;

interleaving each error correctable encoded data packet to form interleaved error correctable encoded data packets;

modulating each interleaved error correctable encoded data packet to form modulated interleaved error correctable encoded data packets; and

transmitting each modulated interleaved error correctable encoded data packet over the channel.

Images