US 6,693,566 B2Grant
Interspersed training for turbo coded modulation
Issue Date:2004-02-17
•48 Claims
•15 Drawing Sheets
Abstract
A communications system, having a combination Reed-Solomon encoder and a Turbo-Code encoder Data frame configuration which may be changed to accommodate embedded submarkers of known value are embedded in with the data order to aid synchronization in the receiver system, by providing strings of known symbols. The string of known symbols may be the same as the symbols within a training header that appears at the beginning of a data frame. Frame parameters may be tailored to individual users and may be controlled by information pertaining to receivers, such as bit error rate, of the receiver. Additional headers may be interspersed within the data in order to assist in receiver synchronization. Frames of data may be acquired quickly by a receiver by having a string of symbols representing the phase offset between successive header symbols in the header training sequence in order to determine the carrier offset. Phase lock to a signal may achieved after determining carrier offset in receivers by correlating successive symbols in successive headers. It is emphasized that this abstract is provided to comply with the rules requiring an abstract which will allow a searcher or other reader to quickly ascertain the subject matter of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or the meaning of the claims.
Metadata
Assignee
- Broadcom Corporation
Inventors
- Steven T. Jaffe
- Kelly B. Cameron
Application Information
Application Number:US 09/729,442
Filing Date:2000-12-04
Priority Date:1999-12-03
Art Unit:7
Classifications
IPC:
H03M 700H03M 1300H03M 1329H04Q 738
Field of Search:
341 50341 94341 81714755714786714774714751714701714792714758714702375222375259375265375341375295375262375146375298
Patent Drawings (15 sheets)
Description
CROSS REFERENCE TO RELATED APPLICATIONS
[0002] This application claims priority from provisional application No. 60/168,808 entitled INTERSPERSED TRAINING FOR TURBO CODED MODULATION filed on Dec. 3, 1999, the contents of which is expressly incorporated by reference as though set forth in full.
FIELD OF THE INVENTION
[0003] The present disclosure relates to digital signal reception and, in particular, signal coding which assists in the synchronization of receivers with turbo decode capability.
BACKGROUND OF THE INVENTION
[0004] In recent years, transmission of data via satellite has increased considerably. Recently, the number of personal satellite receivers have also been increasing. As large satellite receiving antennas and expensive receivers are replaced by smaller and less expensive equipment, the demand for such systems continues to rise. As the demand for satellite communication systems rises, systems which have increased performance have a distinct market advantage. Improving designs and increasing the level of system integration within satellite receivers can offer the dual benefits of decreasing system costs and increasing performance. Accordingly, there is a need for improved satellite communication systems within the art.
SUMMARY OF THE INVENTION
[0005] In one aspect of the present invention, a method of creating a data sequence includes placing a training sequence at a beginning of a data frame, placing a plurality of the blocks of turbo encoded data within the data frame following the training sequence, and interspersing a plurality of submarkers within the turbo encoded data blocks.
[0006] In another aspect of the present invention, a training sequence and submarker insertion apparatus includes an input adapted to receive a plurality of turbo encoded data blocks, and an inserter adapted to insert a training sequence before the turbo encoded data blocks and insert a plurality of submarkers within the turbo encoded data blocks thereby creating a data frame.
[0007] In yet another aspect of the present invention, a training sequence and submarker insertion apparatus includes receiving means for receiving a plurality of turbo encoded data blocks, insertion means for inserting a training sequence before the turbo encoded data blocks, and inserting a plurality of submarkers within the turbo encoded data blocks thereby creating a data frame.
[0008] In a further aspect of the present invention, a transmitter includes a forward error correction device having a turbo encoder and a training sequence and submarker insertion device coupled to the turbo decoder, the training sequence and submarker insertion device comprising an input adapted to receive a plurality of turbo encoded data blocks from the turbo encoder, and an inserter adapted to insert a training sequence before the turbo encoded data blocks and insert a plurality of submarkers within the turbo encoded data blocks thereby creating a data frame, and a modulator coupled to the forward error correction device to modulate the data frame.
[0009] In yet a further aspect of the present invention, a method of creating a data sequence includes turbo encoding data into a plurality of turbo encoded data blocks, creating a data frame comprising a first portion and a second portion, the first portion preceding the second portion in time, placing a training sequence in the first portion of the data frame, placing the turbo encoded data blocks in the second portion of the data frame, and interspersing a plurality of submarkers within the turbo encoded data blocks.
[0010] It is understood that other embodiments of the present invention will become readily apparent to those skilled in the art from the following detailed description, wherein it is shown and described only embodiments of the invention by way of illustration of the best modes contemplated for carrying out the invention. As will be realized, the invention is capable of other and different embodiments and its several details are capable of modification in various other respects, all without departing from the spirit and scope of the present invention. Accordingly, the drawings and detailed description are to be regarded as illustrative in nature and not as restrictive.
BRIEF DESCRIPTION OF THE DRAWINGS
[0011] These and other features, aspects, and advantages of the present invention will become better understood with regard to the following description, appended claims, and accompanying drawings where:
[0012] FIG. 1 is a graphical representation of an example environment in which embodiments of the present invention may operate.
[0013] FIG. 2 is a graphical illustration of a data format as may be used with embodiments of the present invention.
[0014] FIG. 3 is a graphical illustration of frequency versus amplitude graphs representing a band of signals with different center frequencies (carrier offsets).
[0015] FIG. 4 is a graphical representation of header symbols being transmitted through a communications channel.
[0016] FIG. 5 is graphical illustration of a mechanism that may be used to search for given sequence of symbols, such as those found in a header.
[0017] FIG. 6 is a graph illustrating correlation values versus frequency utilizing a system for a short sequence illustrated in FIG. 5.
[0018] FIG. 7 is a graph of correlation value versus frequency when a long sequence is being correlated.
[0019] FIG. 8 is a graphical illustration of a step in the process, which can find the proper demodulation frequency of a signal, without the necessity of a series of cut and try steps.
[0020] FIG. 9 is a graphical representation of a differential correlator.
[0021] FIG. 10 is a graphical illustration relating header data to differential correlator output and further relating header position to a counter, which counts cycles of a receiver clock.
[0022] FIG. 11 is a graphical illustration of the process by which the frequency of the receiver clock may be synchronized to an incoming data stream, using a clock counter.
[0023] FIG. 12 is a block diagram illustrating the parts of a common correlator as may be used to establish phase lock to a received signal.
[0024] FIG. 13 is a graphical illustration of a serial correlator as may be used in embodiments of the present invention.
[0025] FIG. 14 is a block diagram representation of subsystem circuitry, which comprises the modulator and forward error correcting sections of a transmitter system according to an embodiment of the invention.
[0026] FIG. 15 is a block diagram illustrating the component and signal flow which comprise an exemplary embodiment of forward error correction according to an embodiment of the invention.
[0027] FIG. 16 is a graphical illustration of a generalized data frame, according to an embodiment of the invention.
[0028] FIG. 17 is a graphical illustration of a frame of data having three submarkers disposed therein.
[0029] FIG. 18 is a graphical illustration of an exemplary arrangement of data blocks and submarkers within a frame.
[0030] FIG. 19 is a block diagram of a set top box according to an embodiment of the current invention.
[0031] FIG. 20 is a block diagram of a receiver according to an embodiment of the invention.
DETAILED DESCRIPTION
Exemplary Communication System
[0032] In the following description, reference is made to the accompanying drawings, which form a part hereof, and in which is shown, by way of illustration, specific embodiments illustrating ways in which the invention may be practiced. It is to be understood that other embodiments may be realized, as the inventive concepts disclosed herein may be used in the design and fabrication of other embodiments, without departing from the scope and spirit of the inventive concepts disclosed herein.
[0033] Accordingly, embodiments of the present invention relate, generally, to satellite communication systems. However, for the purposes of simplifying this disclosure, the embodiments are described herein with relation to direct broadcast satellite systems. Although the described exemplary embodiments disclosed herein are directed to direct broadcast satellite systems, there is no intent to limit the invention to the example embodiments. The exemplary embodiments are intended to illustrate inventive aspects of the present invention, which are applicable to a wide variety of electronic systems.
[0034] Satellite communication systems in general comprise three parts. The first part is a transmit system also known as a ground station. The transmit system may receive data from a variety of sources such as cable companies, Internet providers, etc. The received data is then coded, modulated and provided to a transmitter for broadcast. Coding generally includes a forward error correcting code. A forward error correction and modulation section of a transmitter accepts digital data and then constructs a signal that will be relayed, via a satellite, to the user. The second element in the satellite communication system is a satellite, which is illustratively a geo-synchronous satellite. The third part of the satellite communication system is a receiver system. The receiver system generally comprises an outdoor unit and a receiver which receives the signal from the outdoor unit, demodulates it and decodes it to recover the original signal. The original signal is then available for use in a device such as a television or computer.
[0035] FIG. 1 is a graphical representation of an example environment, in which the described exemplary satellite communication system may operate. Within the environment of FIG. 1, a data source 101 provides data to a ground station 100, which then broadcasts the data to a satellite 109. The satellite in turn re-broadcasts the data to a receiver system 110 thereby providing it to a user device 117.
[0036] In FIG. 1 the data source 101, such as a television cable signal, represents an example of one of a number of various types of data signals, which may be conveyed by the system. For example, the data signals may include, but are not limited to, television channels, music channels, or data from Internet websites. The data signals are provided, by the data source 101, to a modulator and forward error correction (FEC) 103. Within the modulator and FEC 103, the data is modulated on one or more carrier waveforms. The modulator and FEC 103 translates the data from data source 101 into a form suitable for transmission. The modulated data is further coupled to a transmitter 105. In the transmitter 105, the data stream from the modulator and FEC may be further amplified and coupled, for example, to a dish antenna 107 for transmission to the satellite 109.
[0037] The satellite 109 accepts data transmitted from dish antenna 107. Satellite 109 is commonly a geo-synchronous satellite, in which the satellite's position is a constant location above the earth, but is not limited to such. In a geo-synchronous satellite, orbital rotation of the satellite is one day exactly matching the rotational speed of the earth, thereby maintaining the satellite at a constant position above the earth. The data transmission is accepted by the satellite 109, amplified and rebroadcast to the receiver system 110 on earth.
[0038] A user antenna 111, accepts the data transmission from the satellite 109. The received signal is then further coupled into a LNB (low noise block) 113 where it is amplified. The LNB 113 then provides the signal to a set top box 115. Within the set top box 115, the signal is demodulated and converted into a form which may be used by the user device 117, such as a television or computer. The LNB 113 and the antenna 111 are collectively referred to as the ODU (outdoor unit) 119 because they are typically located outdoors.
[0039] Transmission of Data Between the Transmit and Receiver System
[0040] FIG. 2 is a graphical illustration of a data format as may be used with embodiments of the present invention. The data stream is divided into a series of successive concatenated frames. Three successive concatenated frames are illustrated in FIG. 2 at 301, 303 and 309. A typical frame 301 may comprise a header 305 followed by data 307. Coupling a header 305 along with data 307 in a discrete frame 301 may provide particular advantages. For example, the frame 301 may have a different modulation scheme than a successive frame 303. Frame 301 may contain QPSK symbols and frame 303 may contain 8 PSK symbols, and each frame may be intended for different receivers. Additionally a different format can be used for the header and the data, for example a QPSK header may be used with 8 PSK data. The header may be encoded so as to indicate the format of the data within the block, or of future blocks. Additionally the header may contain a “training sequence” to assist the receiver in synchronizing to the transmitted signal. A great variety of combinations of data partitioning are possible. Each frame may be intended for different users and hence may have different types of modulation and data formats in successive data frames. By using such a flexible scheme for data delivery, a variety of user needs can be accommodated.
[0041] Compensating for Frequency Offsets
[0042] FIG. 3 is a graphical illustration of frequency versus amplitude graphs representing a band of signals with different carrier (center) frequencies having differing carrier offsets. The band-pass curve 705 represents a nominal case in which Fc(the desired center frequency) is situated in the center of the bandwidth of the signal 705. In actual practice, the frequency band may be offset from the desired center as illustrated in bandwidth curves 707 and 709. This offset may be due to a variety of factors, such as drift in the transmitter or receiver front end, drift in the relay satellite, and in non Geo-stationary systems due to Doppler effects. In curve 707, the center frequency has been displaced and is actually no longer equal to Fcbut is equal to Fc+ΔF. In curve 709, the carrier frequency is actually lower than Fc, the actual center frequency for band-pass curve 709 is located at Fc−ΔF. In practice, offsets can cause considerable displacement of a signal's center frequency. Offsets in carrier frequency typically must be accounted for to assure proper reception. Therefore, finding the actual carrier frequency is commonly an early step in locking a receiver system to a transmitted signal.
[0043] In an exemplary embodiment of the present invention, header data is identified and, in the process of identifying the header data, the frequency offset of the communications channel carrier frequency is found. One method for determining the carrier frequency offset at the receiver system is to mix the incoming signal with series of frequencies one at a time until the correct frequency is found. By mixing the incoming signal across a series of frequencies and correlating the resultant signal (for example a resulting baseband signal), the actual center frequency of the incoming signal can be determined. Mixing the incoming signal with a series of frequencies, however, can take considerable amount of time. The number of frequency offsets that may have to be applied to the incoming signal, before the correct frequency offset is found, can be considerable. It is desirable to be able to determine the offset of the center frequency without going through a process of trial and error, incrementing the mixing frequency and using the incremented frequency to mix with the incoming signal.
[0044] FIG. 4 is a graphical representation of header symbols being transmitted through a communications channel. A sequence of symbols 801 is represented by AN. The sequence ANcontains a number of symbols HLwhich is equal to the header length. ANrepresents a sequence of header symbols for N=0 to N=(HL−1).
[0045] The header symbols Anare coupled into communications channel 803. The symbols are then accepted from the communication channel by a receiver system. The received symbols RNform a set of symbols 805 that have had noise and/or distortion added to them as a consequence of transmission through the communications channel. The sequence of symbols RNcan be represented by a modeling mathematical expression ANe−jwt+N. Term N (809) represents the noise added by the communications channel and term e−jwt(807) is a frequency component, representing the frequency offset of RN's carrier. The communications channel 803 generally comprises everything between the transmitter and the user's receiver system.
[0046] For a given frequency offset represented by term 807, HL(the length of the sequence AN) determines how large of a frequency offset can be tolerated and still form a proper correlation. The longer the sequence of symbols that are being detected in a correlator, the less frequency offset that can be tolerated in the center frequency. Therefore, in order to tolerate a large frequency offset, a short sequence is desirable. On the other hand, a long sequence will result in more gain when correlated with the sequence to be detected. So from the standpoint of correlator gain, a long sequence is desirable. Generally, correlator gain is more important than being able to tolerate a large frequency offset, because the correlator gain may be used to offset the noise within the channel.
[0047] FIG. 5 is a graphical illustration of a mechanism in the receiver system that may be used to search for a given sequence of symbols, such as “training symbol” found in a header. Training symbols found in the header are known symbols, which a receiver system may look for in order to synchronize or “lock to” a received transmission. The output of the communications channel 803 is provided to a demodulator 903 in the receiver system. The demodulation frequency FD901 is also coupled into the demodulator 903. It is FD901 that will be mixed with the incoming signal and that must be properly adjusted to translate the incoming data symbol stream, from the communications channel 803, into a baseband sequence of received symbols RN, 805. The baseband symbol stream RN, (805), is coupled into a correlator 905. The correlator 905 will search for a match between the header sequence ANand the received symbols RN. The correlator is clocked by a clock 905 which controls the comparison between the known header ANand the received symbol stream RN. The comparison of ANand RNwithin the correlator 905 is can be a bit by bit comparison. The bits that match each other are typically added to produce a correlation value 919. The correlation process can be used to ascertain the center frequency of the carrier of the received symbol RNdata stream. For example, FD911 may be changed in steps (swept) and the correlation value, which results, saved. Once the demodulation frequency has been swept across the range of possible values, the correct demodulation frequency can be ascertained by observing which frequency step gives the highest correlation value.
[0048] FIG. 6 is a graph illustrating the correlation value for a short correlation sequence versus frequency for the correlation system illustrated in FIG. 5. The maximum correlation value is given by point 1009. The correlator output 1005 tends to have a wider curve as the sequence correlated becomes shorter. However, the maximum output 1009 tends to become smaller as the sequence becomes shorter, thus yielding a lower gain.
[0049] FIG. 7 is a graph of correlation versus frequency offset for a long sequence being correlated by a system such as illustrated in FIG. 5. When a long sequence is correlated, the curve produced 1103 is much narrower and its peak value is higher than a short sequence. This means that the correlator has more gain, but that finding FD901 is generally of greater concern. In other words, a shorter sequence will allow larger steps in FD901 to be used in finding the correct FD, than will a longer sequence. Therefore, to search for a longer sequence, the frequency steps that are used as the demodulator frequency 901 should be closer in value and, hence, may comprise more steps than a corresponding shorter sequence. Even if a shorter correlation sequence can be tolerated, the process of trial and error in order to determine the correct frequency of demodulation 901 can be cumbersome and time-consuming. It is advantageous to eliminate the trial and error method of determining the necessary demodulation frequency.
[0050] FIG. 8 is a graphical illustration of a step in the process, which can find the proper demodulation frequency of a signal without the necessity of a series of trial and error steps. Equation 1201 represents a series of N header symbols. The series of header symbols are part of a data frame, for example 301, as illustrated in FIG. 2. The satellite transmission may contain a header 305 and data 307 in a frame 301 as a convenient way of packaging satellite transmissions. The header may be known to a receiver system beforehand and hence is a convenient data synchronization pattern. A known header, called a training sequence, is used to adjust the receiver system to receive the data frame.
[0051] From the header symbols, as given in equation 1201, a secondary sequence 1203 can be created. The secondary sequence, represented by BNis a sequence of symbols which represents the phase difference between successive symbols within the header. So, for example, the symbols in the sequence BNare found by taking the phase difference between ANand AN-1. Symbol BN-1is formed by taking the difference between symbol AN-1and AN-2. The remaining symbols in the BNsequence are formed similarly, as illustrated in equation 1203. The general formula for the BNsequence is given in equation 1205. Because the header ANis known beforehand by the receiver system, the sequence BNalso may be known beforehand (or computed) by the receiver system.
[0052] A sequence SNis formed by taking the phase difference between successive received symbols RN. This sequence is as illustrated in equation 1207.
[0053] FIG. 9 is a graphical representation of a differential correlator in the receiver system that can be used to correlate the SNand BNsequences of symbols. The differential correlator 1305 correlates the phase differential between successive symbols. BNis the sequence to which the received symbol differential sequence SN, 1303, is compared. [The sequence BNmay be time reversed and a conjugated version of BN(BN*)]. When the received symbol differential string SNis compared to the known differential sequence BNa series of header peaks 1307 are produced at the output of the differential correlator 1305.
[0054] FIG. 10 is a graphical illustration relating the header data to the differential correlator output and further relating header timing to a counter, which counts cycles of a receiver system clock. The differential correlator 1305 receives the differential symbol stream SN. The differential correlator 1305 also has preloaded the B*Nsequence, 1301. The correlation between output 1415 of the differential correlator 1305 compared to the received symbol sequence RNis shown in graph 1419. Once a complete header has been received and the differential sequence SNcreated from the header, a differential correlator peak 1401 will be seen from the correlation between SNand BN.
[0055] Concurrently with the operation of the differential correlator 1305, a clock counter 1407 counts cycles of the receiver system clock 1413. The clock counter 1407 is configured so that it rolls over, that is, once the clock counter 1407 achieves a maximum value, the counter is automatically reset to zero upon the receipt of the next clock pulse. The clock counter 1407 is configured so that its maximum count will correspond to a period that is longer than the combined period of the header and data. When the clock counter 1407 is free-running, i.e., counting receiver system clock cycles and resetting upon a maximum clock counter count, its output period is guaranteed to be longer than the received header plus data packet. Because the roll over period of the clock counter is longer than the longest combined period of a header plus data, it is guaranteed that, between rollovers of the clock counter, a maximum differential correlator value, for example 1401, will occur. Because a maximum value is being determined, the system is not dependent on a particular threshold value. Because there is always a maximum value within the clock counter period, any design difficulties encountered by attempting to adjust a correlator output threshold for changing signal conditions is eliminated. The output counter value 1417 is portrayed as a saw-toothed waveform. This portrayal is for purposes of illustration and comparison only. The output 1417 of clock counter 1407 is generally a sequence of increasing integers, and therefore, the output counter value 1417, instead of being a sawtooth as portrayed, is generally a series of discrete steps.
[0056] Once the maximum differential correlator value has been ascertained for the free-running clock counting period, the clock counter output value corresponding to the differential correlator peak value within the clock counter period can be determined. The output counter values 1403 and 1409 correspond to maximum differential correlator values. By knowing the values of the clock counter that correspond to successive differential correlator peaks, i.e. 1401 and 1409, the actual period of the header plus data can be determined.
[0057] FIG. 11 is a further graphical illustration of the process by which the receiver system clock may be synchronized to the incoming data stream using the clock counter 1413. Curve 1501 represents the output of the differential correlator 1305. Initially, the receiver system clock counter 1413 is in a condition of free-run, as illustrated in curve 1503. When the clock counter 1413 is free-running, it will count the receiver system clock pulses up to a maximum number and then roll over. The time between roll over of the clock counter is referred to as the clock counter period, for example 1525. By observing the output of the differential correlator 1305 during a full clock counter period, for example 1525, a time between peak correlator output values can be determined.
[0058] Once the peak correlator values 1509 and 1517 have been determined, corresponding values 1511 and 1519 of the clock counter 1413 can be determined. Once the values 1511 and 1519 have been determined, the difference between them can be determined. The free-run frequency of the receiver system clock, and hence the free-run frequency of the clock counter 1413, which counts the cycles of the receiver system clock, can be adjusted so that the difference between 1511 and 1519 is zero. When the receiver system clock 1413 has been adjusted to a point where values 1511 and 1519 are equal, the receiver system clock has been synchronized in frequency with the transmitter clock. The frequency adjustment is accomplished by decreasing the clock counter period, as illustrated by 1527 of the waveform 1505.
[0059] Those skilled in the art will recognize that the preceding description is exemplary only and many variations of this scheme are possible. For example, instead of merely measuring the time difference between points 1511 and 1519, a series of points may be measured and an average time difference may be computed. Similarly, two maximum correlator values can be selected from a number of correlator peaks in order to select, for example, the maximum value of correlation peaks over a series of multiple correlation peaks. Once the frequency has been adjusted correctly; (as illustrated in wave form 1505) the timing difference between 1511 and 1521, which represents the clock counter value, at which correlation peaks 1509 and 1517 occur, should be zero.
[0060] Once the frequency of the receiver system clock counter 1413 has been adjusted to match the transmit clock, the receiver system clock can then be adjusted to match the phase of the transmit system. Because the differential correlator 1305 correlates the phase difference between adjacent symbols, it is essentially phase blind. That is, once a sequence has been created, such as SNor BN, which comprises a phase differential between symbols, the actual phase information relative to each symbol is lost. To establish phase lock with respect to incoming symbols, the received sequence is correlated in real time.
[0061] FIG. 12 is a block diagram illustrating the parts of an exemplary correlator, as may be used to establish phase lock. An input sequence 1601 is coupled into a correlator 1603. The input sequence 1601 is then coupled into a tapped delay line 1605. The stages of the tapped delay line are compared in a series of comparators 1607, to a known sequence 1609. The output of all the comparisons are then summed in a summation unit 1611, which produces the correlator output 1613. One drawback of a correlator, such as illustrated at 1603, is that it is very area intensive to fabricate such a correlator on an integrated circuit. That is, if the input sequence 1601 happens to be 128 symbols long, then 128 multipliers, for the multiplier chain 1607, and 128 addition stages within the summation unit 1611 will need to be employed. It is desirable to find a method that is less area intensive when implemented on a integrated circuit chip.
[0062] FIG. 13 is a graphical illustration of a serial correlator as may be used in certain embodiments of the present invention. A series of comparison patterns, such as packet headers BN, are illustrated. The sequential packet headers are numbered 1701, 1703, 1705, 1707, and 1709. The pattern that will be compared to the header pattern is contained in a memory 1713. Instead of comparing all of the bits at the same time, as with the exemplary correlator illustrated in FIG. 12, the serial correlator compares one bit at a time. For example, BOfrom the first header 1709 is compared with a first bit CO, 1715, in the pattern to be matched. The single bits are compared in a single bit multiplier 1711. The result of the comparison, of the individual bits in the multiplier 1711, is provided to a summation unit 1719. So, for example, if a pattern represented by CO, 1715 through CN1717 is being sought, the Nth bit of the header BNrepresented by 1701 may be compared to the CNbit 1717 of the pattern to be correlated. When the next header arrives, the CN-1bit from the comparison stream 1713 can be compared to the BN-1bit in the second header to arrive 1703. In this manner, not all the bits are compared at once. Instead of requiring, for example, 128 multipliers and an adder chain capable of adding 128 results, the serial correlator correlates one bit at a time and then sums the result. Once 128 header bits have been compared with the correlation value 1713 the correlator output 1721 becomes valid. Although the serial correlator can compare only one header bit at a time, the actual delay in achieving phase lock may not be perceptible to a user. By serializing the computation, a great savings in chip area may be realized.
[0063] The Transmit System
[0064] FIG. 14 is a block diagram representation of a modulator and FEC of a transmit system according to an embodiment of the invention. The FEC accepts data 1807 from an outside source. The data may be of any suitable type, for example, MPEG 2 (Motion Picture Experts Group) Video, DVB (Digital Video Broadcast), or PN (Pseudo-Noise) codes. In the exemplary embodiment, the FEC also provides a test data signal 1805, which can be used as a data source input 1807 to the FEC. The data signal 1805 can be used for testing, for example, in a standalone mode. Because the test signal is a known data pattern, the receiver system can use the same pattern to measure bit error rate. Various parameters of the circuitry may influence the bit error rate. The built in test signal 1805 may reduce the necessity of having a dedicated piece of test equipment in order to provide a known test signal to measure the bit error rate.
[0065] The FEC 1801 also includes a data clock 1809. The data clock 1809 clocks the input data 1807 and thereby controls the rate that the data is provided to the FEC 1801. The FEC also accepts clocking signals from several numerically controlled oscillator clocks. The exemplary embodiment accepts clocking inputs from a byte clock 1811 (which may also function as a data clock 1809), a forward error correcting clock 1813, and a bit clock 1815. The FEC also accepts a control input 1825. The control input 1825 may be used to control various parameters of the FEC, for example, but not limited to, modulation format, frame length of the data exiting the module, and coding rates. Once the FEC 1801 has processed the data 1807, the processed data 1819 is further provided to the modulator 1803. The modulator also communicates with the FEC via a communications bus 1817. The communications bus 1817 generally provides handshaking and protocol to control the data transfer over the bus 1817. The modulator 1803 also accepts an input from the control line 1825. The control line 1825 may be used to control various parameters within the modulator, such as filters, equalizers, and symbol mappers. The modulator 1803 also accepts a clocking signal, such as a 100 megahertz oscillator 1823. The oscillator 1823 also is coupled through the modulator and operates a digital to analog converter 1827 which accepts the data 1827 output by the modulator 1803.
[0066] Overall, the data 1807 enters the FEC 1801. The FEC codes the data and passes the coded data 1819 to the modulator 1803. The modulator 1803 accepts the data from the FEC 1801, modulates it, and places the modulated data on an output 1827. The data output 1827 is then coupled into a digital to analog converter. The digital to analog converter converts the digital signal 1827 into an analog signal suitable to be accepted by the transmitter 105 and broadcast by the antenna 107 to the satellite 109 (see FIG. 1).
[0067] Forward Error Correction
[0068] FIG. 15 is a block diagram illustrating the components and signal flow which comprise an exemplary embodiment of the FEC 1801. The FEC is divided into three asynchronous modules. The first asynchronous module is the input processing module, which receives the data input 1807. The input processing module queues the received data, then provides it to forward error correcting module 1903. It is from the functions provided in the forward error correcting module 1903 that the FEC 1801 takes its name.
[0069] The forward error correcting module 1903 processes the data provided by the input processing module 1935 and then further provides it to a training sequence and marker insertion module 1937. The training sequence and marker insertion module 1937 adds a training sequence header and may add submarkers to the data. The data is then provided to an output 1819, for acceptance by the modulator 1803.
[0070] The input processing module 1935, the forward error corrector 1903, and the training sequence and marker insertion (TSMI) module 1935 are connected serially to each other via asynchronous interfaces such as FIFO (First In First Out) queues. In other words, the coupling between the input processing module 1935 and the forward error corrector 1903 is asynchronous, as is the connection between forward error corrector 1903 and training sequence and marker insertion module (TSMI) 1937. In other embodiments, the TSMI module may be eliminated entirely.
[0071] Data 1807 is generally coupled into the FEC 1801 via the input processing module 1935. Data 1807 is provided to a multiplexer 1907 which allows a microcontroller 1939 to choose between the data input 1807 and a PN sequence generator 1905. The PN sequence generator 1905 may be used as a data source for the FEC 1801, for example, for testing. It may also be used to provide a known signal, for example, for testing the receiver system performance. The PN sequence module 1905 is also coupled to an output 1805 for use outside of the module. The data chosen by the multiplexer 1907 is queued within a first-in first-out (FIFO) queue 1909 within the input processing module 1935. Data is then further coupled from the FIFO 1909 to an input FIFO 1911 in the forward error correcting module 1903. The forward error correcting module 1903 further receives data from its input FIFO 1911 and provides it to a Reed-Solomon encoder 1913. The Reed-Solomon encoder, once it has encoded the data, then provides the Reed-Solomon encoded data to a turbo encoder 1917 and interleaver 1915 combination.
[0072] Once the Reed-Solomon encoder 1913, the interleaver 1915, and the turbo encoder 1917 completes the processing of a data symbol, it is then coupled into an output queue 1921. The output queue 1921 is provided with a fullness indicator. So, for example, if the FIFO 1921 is greater than half full, it provides an indicator signal 1931 to loop filter 1929.
[0073] The FIFO 1921 further provides symbol data to the training sequence and marker insertion TSMI module 1937. An inserter 1927 may then insert a training sequence header and/or submarkers into the data stream, for example, to accommodate the needs of a particular data receiver. It is the training sequence and marker insertion module which creates the frame structure for the data. Once the training sequence and submarkers have been inserted into the data stream, the data is coupled into an output queue 1937. The data resides in the output queue 1937 until called for by the modulator 1803. The output FIFO 1937 also has a status indicator 1933 that indicates, for example, that it is half full. The indicator is coupled into loop filter 1929. The FIFO level indicators 1931 and 1933 may both be coupled into loop filter 1929 to determine the rate at which a byte clock NCO 1811 runs.
[0074] In the described exemplary embodiment, three different clocks are used for control of the FEC 1801. The first clock is the byte clock NCO (Numerically Controlled Oscillator) 1811. The byte clock is used to control the flow of data into the FEC 1801. The byte clock can be adjusted by the microcontroller 1939 and can also be adjusted by the output from the loop filter 1929, for example, based on how full FIFOs 1921 and 1937 are. The forward error correcting module 1903 is clocked by an FEC clock 1813. Although the FEC clock 1813 is independent of the other two clocks, it too may also be controlled by the microcontroller 1939. The third clock 1815 is a bit clock. The bit clock is provided to the TSMI module 1937 and also provided to the digital to analog converter 2027 (as illustrated in FIG. 20). The bit clock 1815 also may be controlled by the microcontroller 1939. The control of the clocks by the microcontroller 1939 facilitates the ability to switch modulation on a symbol by symbol basis.
[0075] FEC Multimodulation Architecture
[0076] Because of the asynchronous nature of the modules within the FEC 1801, the flexible control of the data stream, to be modulated, can be enhanced. For example, in the described embodiment, 8 PSK or QPSK modulation can both be accommodated. Other modulation types can also be accommodated. The modulation can be controlled from outside the FEC, for example, utilizing the control bus 1825. Additionally, the frame length and header training sequence composition and placement of submarkers can be varied on command. In addition, the turbo encoder 1917 can have a variety of coding rates, such as ⅔, ⅚, and {fraction (8/9)}. All the aforementioned parameters can be controlled from outside the FEC 1801. In addition, the number of submarkers placed within a frame can be varied in length and number. Submarkers may be used by the receiving system to track the incoming signal or re-establish lock. The variables can be changed on a frame-to-frame basis. For example, one frame can be modulated with 8 PSK and a successive frame can be modulated with QPSK. Additionally, the turbo coding rates can be switched within successive frames. The number, size and spacing of submarkers also can be changed in successive frames.
[0077] As the above mentioned variables are changed within the FECs, various latencies can be encountered. The FIFOs 1909, 1911, 1921, 1923 and 1925 enable the buffering of the symbol stream as parameters are changed, for example, on a frame-to-frame or intraframe basis. The FIFOs enable the symbol stream to be queued when parameters are changed. For example, FIFO 1911, which provides data to the turbo encoder 1917, can queue input data as the turbo encoder is switched between rates of ⅔, ⅚ and {fraction (8/9)}. In such a way, the input stream does not have to be started and stopped as might be the case in a synchronous type design. The incoming data rate, however, should be controlled or it is likely that the FIFOs will either overflow or be starved for data at some point. In order to prevent the modules from being starved for data or overflowing, the overall rate is controlled by the byte clock 1811. The byte clock is controlled by the loop filter which receives, as its input, FIFO status signals 1931 and 1933. The loop filter receives signals 1931 and 1933, filters them and uses the filtered signal to control the frequency of the byte clock 1811. It is, of course, possible to use other FIFO status signals from other FIFOs to control the data rate input to the modules. Which FIFOs are selected as control FIFOs depend on a variety of design variables, for example, individual FIFO size, and peak data rates.
[0078] The feedback from FIFOs 1921 and 1925 are used to control the byte clock 1811 and hence the data input rate of the data 1807. Additionally control bus 1825 can communicate which variables within the FEC 1801 should change. The microcontroller 1939 may not only control the parameters within the different modules of the FEC 1801, in addition it also can load the clocks, i.e., the byte clock 1811, the FEC clock 1813, and the bit clock 1815 with starting values. Tables relating the clock frequencies to different FEC parameters can be provided in ROM (not shown) to the microcontroller 1939. When the microcontroller changes parameters within the FEC, it can also change the clock frequencies of the module clocks. These tables can be computed beforehand and placed in the ROM available to the microcontroller 1939 to control the parameters used to modulate the data 1807 as it arrives.
[0079] In a second operating mode, instead of having all the clock frequencies specified in tabular form, the microcontroller 1939 may be provided with, for example, a byte clock frequency. The microcontroller may then vary the parameters within the FEC 1801 and alter the byte clock rate 1811 to accommodate an estimated desired input data rate. The microcontroller can be provided with algorithms which examine the output rate from the input processing module 1935 and, based on the data rate estimate, set the FEC clock 1813 to an estimated frequency. The microcontroller can then further examine the output rate of the forward error correcting module 1903, make an estimate of the bit clock frequency that is needed, and set the bit clock to that frequency. In other words, the microcontroller controls the parameters of the FEC 1801 while the FIFOs within the modules 1935, 1903 and 1937 provide the needed buffering to maintain a steady data flow through the FEC. The microcontroller can also control the clocks which process the data in the modules 1935, 1903 and 1937 by using a table in memory, which relates the different parameters to the clock rate. Microcontroller 1939 can also be provided with an algorithm that will predict the clock rate based on module parameters, or the microcontroller can be provided with an algorithm or table relating the initial byte clock rate to the parameters and then examine the data flow through the module and adjust the other clocks in line as needed. Examples of values, as may be inserted into a ROM table, are given below.
[0080] The first three examples are for a input symbol rate of 21.2 megasymbols per second: (1) at a coding rate of ⅔, the byte clock is running at 5.13 megahertz, the FEC clock is running at 42.38 megahertz, and the bit clock is running at 63.57 megahertz; (2) at a ⅚ coding rate, the byte clock is running at 6.39 megahertz, the FEC clock is running at 52.98 megahertz, and the bit clock is running at 63.57 megahertz; (3) at a coding rate of {fraction (8/9)}, the byte clock is running at 6.81 megahertz, the FEC clock is running at 56.51 megahertz, and the bit clock is running at 63.57 megahertz.
[0081] The fourth through sixth examples describe clock rates versus coding rate for an input stream of 25 megasymbols per second: (4) at a code rate of ⅔, the byte clock is running at 6.05 megahertz, the FEC clock is running at 50 megahertz, and the bit clock is running at 75 megahertz; (5) at a coding rate of ⅚, the byte clock is running at a frequency of 7.54 megahertz, the FEC clock is running at a frequency of 62.50 megahertz, and the bit clock is running at a frequency of 75 megahertz; (6) at a coding rate of {fraction (8/9)}, the byte clock is running at 8.03 megahertz, the FEC clock is running at 66.67 megahertz, and the bit block is running at 75 megahertz.
[0082] The previous exemplary values illustrate that by knowing the input symbol rate and the coding rate, tables can be developed for nominal byte clock, forward error correcting clock, and bit clock rates. Such computations, as illustrated in the six examples just described, can be used to rapidly switch coding rates and clock frequencies on a frame-by-frame basis. In addition, because of the asynchronous nature of the modules within the FEC 1801, any temporary change in coding rate can be buffered by the FIFOs which connect the internal processing functions. The overall scheme employed to keep the modules functioning without queue overflow or underflow is that the upstream clocks are responsive to downstream queue sizes. Which upstream clocks are responsive to which downstream queues are design parameters that can vary from implementation to implementation. In the described exemplary embodiment, FIFO queues 1921 and 1925 are chosen to control the byte clock NCO 1811. Other combinations are possible such that the upstream clock rate is controlled by a downstream FIFO size. For example, if the training sequence and marker insertion module 1937 were eliminated from the FEC 1801, as might be the case in particular embodiments, the size of FIFO 1921 could then alone be used to control the byte clock NCO 1811.
[0083] FIG. 16 is a graphical illustration of a generalized data frame produced by the TSMI 1937, according to the present exemplary embodiment of the invention. The data frame 2101 is, in general, composed of two different sections. The first section in the header section as exemplified by 2103. The second section is the data section as exemplified by 2105, 2109 and 2113. The header is, in general, data which identifies the beginning of a frame of data. The header may comprise various data sequences. For example, one of the data sequences within the header, according to an embodiment of the present invention, is a training sequence 2117. The training sequence 2117 is a known pattern of data which the receiver system may use to lock to the frame. The training sequence can be varied in length or modulation according to parameters of the satellite system. In the present exemplary embodiment, a training sequence size of 64 symbols is used. The remainder of the header 2103 may be used for a variety of purposes, for example, but not limited to, identifying the data within the frame, identifying the modulation scheme of the data in the frame, identifying the modulation of future frames, or identifying positions of items within the data stream, such as submarkers 2107 and 2111.
[0084] Submarkers 2107 may be inserted into the data within the frame 2101 in order to provide a method for the receiver system to synchronize or track an incoming signal. In one exemplary embodiment, the submarker size is 16 symbols, and the spacing between submarkers is 10,240 symbols.
[0085] In one exemplary embodiment, the data 2105 comprises sequential blocks of turbo coded data. Submarkers may be interspersed between blocks of data (See FIG. 17). Such submarkers may be particularly useful when used with codes, such as turbo codes, which are designed to be received at low signal levels. At low signal levels receiver systems many need mechanisms to assist in signal acquisition and training.
[0086] The submarkers may be known sequences such as, for example, copies of the training sequence. Such submarkers can be used to track the incoming signal, by performing correlations on the submarker or may even be used to acquire the signal in a case, for example, when the incoming signal is disrupted by a noise burst.
[0087] The spacing and arrangement of submarkers is further illustrated by examples illustrated in FIGS. 17 and 18.
[0088] FIG. 17 is a graphical illustration of a frame of data having three submarkers. FIG. 17 comprises a training sequence 2201 followed by turbo encoded blocks 1 and 2 (2203). A submarker 2205 follows turbo encoded blocks 1 and 2. Following the submarker 2205 turbo encoded blocks 3 and 4 are followed by submarker 2209. Submarker 2209 is followed by turbo encoded blocks 5 and 6, which are then followed by submarker 2203 which is followed by the final turbo encoded blocks 7 and 8. Turbo encoded blocks 7 and 8 (2215) comprise the final elements within the frame. A new frame begins immediately thereafter with training sequence 2217. In the example in FIG. 17, the frame comprises 41,072 symbols. The training sequence is 64 symbols and the submarker size is 16 symbols. The spacing between submarkers is 10,240 symbols.
[0089] FIG. 18 is a graphical illustration of an exemplary arrangement of data blocks and submarkers within a frame. In FIG. 18 submarkers are interspersed within the data blocks. The frame begins with a training sequence (2301). One-half of turbo encoded block 1 is then positioned after the training sequence. The half of turbo encoded block 1 2303 is followed by submarker 2305. Submarker 2305 is then followed by the second half of turbo encoded block 1 and the first half of turbo encoded block 2 (2307). Submarker 2309 follows next, followed by the second half of turbo encoded block 2 and the first half of turbo encoded block 3 (2311). This sequence continues until the final half of turbo encoded block 8 2335 is in place. The final half of turbo encoded block 2335 marks the end of the frame. The end of the frame is followed by a training sequence 2337 signaling the start of the next frame. The example illustrated in FIG. 18 includes a frame of 41,152 symbols. The training sequence size is 64 symbols and the submarker size is 16 symbols. The spacing between submarkers is 5,000 symbols versus 10,400 in the example illustrated in FIG. 17. The spacing and submarker size may vary according to the characteristics of the receiver that is receiving the signal. For example the submarkers may comprise copies of the training sequence.
[0090] Because of the flexibility of the system, a frame as illustrated in FIG. 17 may be followed immediately by a frame as illustrated in FIG. 18. The frame in FIG. 18 may be used, for example, when delivering data to a receiver system which is receiving a signal of low signal strength.
[0091] The following examples are not exhaustive. For example submarkers may be placed between every block of turbo coded data, or they may be placed between every block of turbo coded data and additionally within the block of turbo coded data.
[0092] The Set Top Box
[0093] A generalized block diagram of a set top box 115, according to an exemplary embodiment of the present invention, is illustrated in FIG. 19. The set top box 115 receives the signal from the ODU 19. The signal received from the ODU 119 may include a frequency band of signals, for example 950 to 2150 megahertz. The signal from the ODU 119 is coupled into the exemplary set top box 115.
[0094] Within the set top box, the tuner 2901 selects the desired band of frequencies from the signal provided by the ODU 119. The desired band of signals is then down converted in the tuner from a high frequency signal into a frequency which may be accepted by a signal demodulator 2903.
[0095] The demodulator 2903 accepts the down converted signal from the tuner 2901, and converts the signal into a data stream. The data stream from the demodulator may then be provided to a turbo decoder 2905.
[0096] Within the turbo decoder 2905, the process of recreating the data sent by the transmit system is begun. As described earlier, the data stream from the FEC of the transmit system has been turbo code encoded to help correct errors which occur in the signal. Errors in the signal occur due to factors such as noise within the channel, atmospheric conditions, electrical interference, and a variety of other interference sources. Turbo codes are used, in part, because they provide a robust way of encoding a signal. Turbo codes may enable a signal to be reconstructed at lower signal levels, i.e., lower signal to noise ratios, than may be possible with other codes alone.
[0097] The turbo decoder 2905 is coupled to and cooperates with an interleaver 2907. An interleaver is a device that, in the transmit system, changes the order of the data from the order received into another order. A receive interleaver may change the data so that it is no longer in sequential order, but in a random but known sequence. A receive interleaver, e.g. 2907, is alternatively known as a de-interleaver. The receive interleaver converts the random data sequence back into normal sequential order. Interleavers may also cooperate with encoders in the transmit system in order to encode the data signal, and decoders in the receiver system to decode the data signal. A burst error, which affects an adjacent sequence of bits, can be minimized if the signal has been interleaved. In an interleaved signal, the bits containing errors may be decoded with other bits, which were transmitted at a time when the interfering signal was not present. The interleaver 2907 further produces a data stream which is then provided to a Reed-Solomon decoder 2909.
[0098] The Reed-Solomon decoder 2909 further decodes the data stream. By successfully coding a signal with a turbo coder in conjunction with a Reed-Solomon coder the signal can be made more robust, i.e., can be decoded at lower signal to noise levels, than if either type of coding had been used separately. The block including the demodulator 2903, the turbo decoder 2905, the interleaver 2907 and the Reed-Solomon decoder 2909 are generally referred to as the receiver 2919. The output of the Reed-Solomon decoder is provided to a video unit 2911. The video module accepts the data from the Reed-Soloman Decoder 2909 and converts it into a form which may be used by a user device such as the television.
The Demodulator
[0099] FIG. 20 is a block diagram of an exemplary demodulator in accordance with an embodiment of the present invention. In-phase and quadrature signals are received by analog to digital (A/D) converters 3103 and 3105. The A/D converters 3103 and 3105 are controlled by a free-running sample clock (not shown). The frequency of the sample clock driving A/D converters 3105 and 3103 is a non-integer multiple of the symbol rate.
[0100] An automatic gain control (AGC) 3107 examines the signal size at the output of the A/D converters 3103 and 3105. Maximum resolution can be obtained with a input signal whose maximum size corresponds to the range of the A/D converters. The AGC controls the gain of amplifiers that amplify input signals prior to providing them to the A/D converters. From the A/D converters the data is provided to the multiplier block 3113. In the multiplier block a digital frequency shift is introduced to cancel any frequency offset which exists between the clocks of the transmitter system and receiver system.
[0101] The frequency loop 3115 serves to change the multiplication factor and thereby cancel the frequency offset. The data is then coupled into decimation filters 3119 and 3121. The decimation filters reduce the data rate, thereby filtering the data. From the decimation filters the signal values are coupled into symbol sample (SS) blocks 3127 and 3129. The SS blocks 3127 and 3129 extract symbol values from the signal values presented to it by the decimation filter. The symbol extraction is synchronized using a symbol timing loop 3131. The symbols retrieved by the SS blocks are next provided to Nyquist filters 3133 and 3135, which provide the symbols with Nyquist filtering. From the Nyquist filter the symbols are coupled to the demodulator output 3109 and 3111.
Receiver Synchronization with Frequency Offset
[0102] As explained earlier, in a receiver system, such as illustrated in FIG. 20, two basic problems need to be dealt with. The first problem is that the center frequency of the signal, which the receiver system is attempting to synchronize with, may be offset by a considerable amount (referred to as the delta frequency). The delta frequency arises because the receiver clock is not the same frequency as the transmitter clock. The receiver system must adjust its clock to match the transmission clock. The frequency of the transmission clock, also called the carrier frequency, may also vary over time. A second problem is that transients, such as intermittent noise, changing atmospheric conditions, and interference from other signal sources, may cause relatively short duration deviations or interruptions of the signals input to the system. These deviations may cause transient phase deviations, which need to be accounted for by the system. The process of matching the carrier frequency to the receiver frequency is often referred to as acquisition, and the process of maintaining phase lock to a signal, despite transient noise and interference conditions, is often called tracking.
[0103] The frequency offset of the incoming signal is adjusted within the multiplier 3113, illustratively a digital complex multiplier. The basic operation of the multiplier 3113 is to multiply the incoming signal and thereby create a frequency translation of the incoming frequency. The multiplier 3113 will create frequency images equal to the input frequency plus the multiplying frequency and also equal to input frequency minus the multiplying frequency. The multiplying frequency is provided from within a frequency loop block 3115.
[0104] The frequency loop 3115 includes a phase detector 3149, which detects the phase difference of the outputs of the Nyquist filters 3133 and 3135 and the input signal as provided by multiplier 3113.
[0105] The symbol timing loop 3131 adjusts the timing of symbol sampling, that is it selects the value which will be decoded as a symbol.
[0106] When the system is initially turned on, both the frequency loop 3115 and the symbol timing loop 3131 are disabled by the correlator 3101. The correlator then examines the incoming symbols and estimates, the frequency offset between the receiver clock and the transmitter clock, as previously described in the section on the differential correlator. Once the correlator 3101 has estimated the difference between the carrier frequency and the receiver clock frequency, the value of the offset between the transmitter frequency and the receiver frequency, that value can be inserted, as a starting value, into the frequency loop 3115. Once the offset frequency has been loaded into the frequency loop by the correlator, the correlator may then enable the loop. The frequency loop can then quickly lock in and track the carrier frequency. The header processor also estimates the phase offset within the symbol timing loop 3131. Once the correlator-processor 3101 has an estimate of the phase offset in the symbol timing loop, it can be inserted into the symbol timing loop. When the header processor couples the initial value into the symbol timing loop 3131, the header processor may enable the symbol timing loop 3131. By providing starting value for the frequency loop 3115, the acquisition time of the frequency loop 3115 is decreased over a conventional type methodology, in which the phase detector alone causes the synchronization of the loop starting at an arbitrary value. Similarly, by providing an initial value for the symbol timing loop 3131 and then enabling the loop, the tracking function within the symbol timing loop can lock to the symbol stream much faster than if it had started from an arbitrary value. Additionally, because the frequency of the loop 3115 does not traverse a range of values, the false lock problem, in which the system may lock to an incorrect frequency, is minimized.
Receiver Synchronization using Interspersed Data
[0107] Additionally, in order to aid acquisition and tracking, the correlator-processor can enable the symbol timing loop 3131 in such a manner that only the training sequence and submarkers are used for synchronizing the symbol timing loop 3131. The same training sequence and submarkers may also be gated into the frequency timing loop 3115 for the purpose of synchronizing the frequency timing loop 3115.
[0108] Although a preferred embodiment of the present invention has been described, it should not be construed to limit the scope of the appended claims. Those skilled in the art will understand that various modifications may be made to the described embodiment. Moreover, to those skilled in the various arts, the invention itself herein will suggest solutions to other tasks and adaptations for other applications. It is therefore desired that the present embodiments be considered in all respects as illustrative and not restrictive, reference being made to the appended claims rather than the foregoing description to indicate the scope of the invention.
Claims
What is claimed is:
1. A method of creating a data sequence, comprising:
placing a training sequence at a beginning of a data frame;
placing a plurality of the blocks of turbo encoded data within the data frame following the training sequence; and
interspersing a plurality of submarkers within the turbo encoded data blocks.
2. The method of claim 1 wherein the interspersing of the submarkers comprises interspersing one of the submarkers between two turbo encoded data blocks.
3. The method of claim 1 wherein the interspersing of the submarkers comprises interspersing each of the submarkers between different pairs of the turbo encoded data blocks.
4. The method of claim 1 wherein the interspersing of the submarkers comprises interspersing one of the submarkers within one of the turbo encoded data blocks.
5. The method of claim 1 wherein the interspersing of the submarkers comprises interspersing each of the submarkers within a different one of the turbo encoded data blocks.
6. The method of claim 1 wherein the interspersing of the submarkers comprises copying at least a portion of the training sequence at the beginning of the data frame, and interspersing the copied training sequence between one of the turbo encoded data blocks.
7. The method of claim 1 wherein the interspersing of the submarkers comprises copying the training sequence at the beginning of the data frame, and interspersing the copied training sequence between one of the turbo encoded data blocks.
8. The method of claim 1 wherein the interspersing of the submarkers comprises copying at least a portion of the training sequence at the beginning of the data frame, and interspersing the copied training sequence between each of the turbo encoded data blocks.
9. The method of claim 1 wherein the interspersing of the submarkers comprises copying the training sequence at the beginning of the data frame, and interspersing the copied training sequence between each of the turbo encoded data blocks.
10. A training sequence and submarker insertion apparatus, comprising:
an input adapted to receive a plurality of turbo encoded data blocks; and
an inserter adapted to insert a training sequence before the turbo encoded data blocks and insert a plurality of submarkers within the turbo encoded data blocks thereby creating a data frame.
11. The training sequence and submarker insertion apparatus of claim 10 wherein the input comprises an input queue.
12. The training sequence and submarker insertion apparatus of claim 11 wherein the input queue comprises a first-in-first-out storage device.
13. The training sequence and submarker insertion apparatus of claim 10 further comprising an output adapted to buffer the data frame.
14. The training sequence and submarker insertion apparatus of claim 13 wherein the output comprises an output queue.
15. The training sequence and submarker insertion apparatus of claim 10 wherein the inserter is adapted to insert one of the submarkers between two turbo encoded data blocks.
16. The training sequence and submarker insertion apparatus of claim 10 wherein the inserter is adapted to insert each of the submarkers between different pairs of the turbo encoded data blocks.
17. The training sequence and submarker insertion apparatus of claim 10 wherein the inserter is adapted to insert one of the submarkers within one of the turbo encoded data blocks.
18. The training sequence and submarker insertion apparatus of claim 10 wherein the inserter is adapted to insert each of the submarkers within a different one of the turbo encoded data blocks.
19. The training sequence and submarker insertion apparatus of claim 10 wherein the inserter is adapted to insert at least a portion of the training sequence between one of the turbo encoded data blocks in addition to inserting the training sequence at the beginning of the data frame.
20. The training sequence and submarker insertion apparatus of claim 10 wherein the inserter is adapted to insert the training sequence between one of the turbo encoded data blocks in addition to inserting the training sequence at the beginning of the data frame.
21. The training sequence and submarker insertion apparatus of claim 10 wherein the inserter is adapted to insert at least a portion of the training sequence between each of the turbo encoded data blocks in addition to inserting the training sequence at the beginning of the data frame.
22. The training sequence and submarker insertion apparatus of claim 10 wherein the inserter is adapted to insert the training sequence between each of the turbo encoded data blocks in addition to inserting the training sequence at the beginning of the data frame.
23. The training sequence and submarker insertion apparatus of claim 10 wherein the inserter is programmable as to the insertion of the submarkers within the turbo encoded data blocks.
24. The training sequence and submarker insertion apparatus of claim 23 wherein the inserter is programmable to insert the submarkers between the turbo encoded data blocks or insert the submarkers within the turbo encoded data blocks.
25. A training sequence and submarker insertion apparatus, comprising:
receiving means for receiving a plurality of turbo encoded data blocks;
insertion means for inserting a training sequence before the turbo encoded data blocks and inserting a plurality of submarkers within the turbo encoded data blocks thereby creating a data frame.
26. The training sequence and submarker insertion apparatus of claim 25 wherein the insertion means comprises an input queue.
27. The training sequence and submarker insertion apparatus of claim 26 wherein the input queue comprises a first-in-first-out storage device.
28. The training sequence and submarker insertion apparatus of claim 25 further comprising an output means for buffering the data frame.
29. The training sequence and submarker insertion apparatus of claim 28 wherein the output means comprises an output queue.
30. The training sequence and submarker insertion apparatus of claim 25 wherein the insertion means comprises means for inserting one of the submarkers between two turbo encoded data blocks.
31. The training sequence and submarker insertion apparatus of claim 25 wherein the insertion means comprises means for inserting each of the submarkers between different pairs of the turbo encoded data blocks.
32. The training sequence and submarker insertion apparatus of claim 25 wherein the insertion means comprising means for inserting one of the submarkers within one of the turbo encoded data blocks.
33. The training sequence and submarker insertion apparatus of claim 25 wherein the insertion means comprises means for inserting each of the submarkers within a different one of the turbo encoded data blocks.
34. The training sequence and submarker insertion apparatus of claim 25 wherein the insertion means comprises means for inserting at least a portion of the training sequence between one of the turbo encoded data blocks in addition to inserting the training sequence at the beginning of the data frame.
35. The training sequence and submarker insertion apparatus of claim 25 wherein the insertion means comprises means for inserting the training sequence between one of the turbo encoded data blocks in addition to inserting the training sequence at the beginning of the data frame.
36. The training sequence and submarker insertion apparatus of claim 25 wherein the insertion means comprises means for inserting at least a portion of the training sequence between each of the turbo encoded data blocks in addition to inserting the training sequence at the beginning of the data frame.
37. The training sequence and submarker insertion apparatus of claim 25 wherein the insertion means comprises means for inserting the training sequence between each of the turbo encoded data blocks in addition to inserting the training sequence at the beginning of the data frame.
38. The training sequence and submarker insertion apparatus of claim 25 wherein the insertion means comprises means for programming a position of the submarkers within the turbo encoded data blocks.
39. The training sequence and submarker insertion apparatus of claim 25 wherein the insertion means comprises means for programming a position of the submarkers to either insert the submarkers between the turbo encoded data blocks or insert the submarkers within the turbo encoded data blocks.
40. A method of creating a data sequence, comprising:
turbo encoding data into a plurality of turbo encoded data blocks;
creating a data frame comprising a first portion and a second portion, the first portion preceding the second portion in time;
placing a training sequence in the first portion of the data frame;
placing the turbo encoded data blocks in the second portion of the data frame; and
interspersing a plurality of submarkers within the turbo encoded data blocks.
41. The method of claim 40 wherein the interspersing of the submarkers comprises interspersing one of the submarkers between two turbo encoded data blocks.
42. The method of claim 40 wherein the interspersing of the submarkers comprises interspersing each of the submarkers between different pairs of the turbo encoded data blocks.
43. The method of claim 40 wherein the interspersing of the submarkers comprises interspersing one of the submarkers within one of the turbo encoded data blocks.
44. The method of claim 40 wherein the interspersing of the submarkers comprises interspersing each of the submarkers within a different one of the turbo encoded data blocks.
45. The method of claim 40 wherein the interspersing of the submarkers comprises copying at least a portion of the training sequence in the first portion of the data frame, and interspersing the copied training sequence between one of the turbo encoded data blocks.
46. The method of claim 40 wherein the interspersing of the submarkers comprises copying the training sequence in the first portion of the data frame, and interspersing the copied training sequence between one of the turbo encoded data blocks.
47. The method of claim 40 wherein the interspersing of the submarkers comprises copying at least a portion of the training sequence in the first portion of the data frame, and interspersing the copied training sequence between each of the turbo encoded data blocks.
48. The method of claim 40 wherein the interspersing of the submarkers comprises copying the training sequence in the first portion of the data frame, and interspersing the copied training sequence between each of the turbo encoded data blocks.
Patent Citations (57)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4677625(A) | 1987-06-01 | Betts et al. | Applicant |
| US4677626(A) | 1987-06-01 | Betts et al. | Applicant |
| US4979175(A) | 1990-12-01 | Porter | Applicant |
| US5181209(A) | 1993-01-01 | Hagenauer et al. | Applicant |
| US5349608(A) | 1994-09-01 | Graham et al. | Applicant |
| US5406570(A) | 1995-04-01 | Berrou et al. | Applicant |
| US5446747(A) | 1995-08-01 | Berrou | Applicant |
| US5563897(A) | 1996-10-01 | Pyndiah et al. | Applicant |
| US5666378(A) | 1997-09-01 | Marchetto et al. | Applicant |
| US5675585(A) | 1997-10-01 | Bonnot et al. | Applicant |
| US5703911(A) | 1997-12-01 | Lin et al. | Applicant |
| US5721745(A) | 1998-02-01 | Hladik et al. | Applicant |
| US5734962(A) | 1998-03-01 | Hladik et al. | Applicant |
| US5742612(A) | 1998-04-01 | Gourgue et al. | Applicant |
| US5761248(A) | 1998-06-01 | Hagenauer et al. | Applicant |
| US5784300(A) | 1998-07-01 | Neumeier et al. | Applicant |
| US5841818(A) | 1998-11-01 | Lin et al. | Applicant |
| US5907582(A) | 1999-05-01 | Yi | Applicant |
| US5933462(A) | 1999-08-01 | Viterbi et al. | Applicant |
| US5970085(A) | 1999-10-01 | Yi | Applicant |
| US5978365(A) | 1999-11-01 | Yi | Applicant |
| US5983384(A) | 1999-11-01 | Ross | Applicant |
| US5983385(A) | 1999-11-01 | Khayrallah et al. | Applicant |
| US5996104(A) | 1999-11-01 | Herzberg | Applicant |
| US6014411(A) | 2000-01-01 | Wang | Examiner |
| US6016568(A) | 2000-01-01 | Wolf et al. | Applicant |
| US6065147(A) | 2000-05-01 | Pyndiah et al. | Applicant |
| US6119264(A) | 2000-09-01 | Berrou et al. | Applicant |
| US6122763(A) | 2000-09-01 | Pyndiah et al. | Applicant |
| US6182261(B1) | 2001-01-01 | Haller et al. | Applicant |
| US6304996(B1) | 2001-10-01 | Van Stralen et al. | Applicant |
| US6330277(B1) | 2001-12-01 | Gelblum et al. | Examiner |
| US6334197(B1) | 2001-12-01 | Eroz et al. | Examiner |
| US6339834(B1) | 2002-01-01 | Crozier et al. | Examiner |
| US6351832(B1) | 2002-02-01 | Wei | Examiner |
| US6427214(B1) | 2002-07-01 | Li et al. | Examiner |
| US6484283(B2) | 2002-11-01 | Stephen et al. | Examiner |
| US6530059(B1) | 2003-03-01 | Crozier et al. | Examiner |
| US6574766(B2) | 2003-06-01 | Obuchi et al. | Examiner |
| US2001/0028690(A1) | 2001-10-01 | Ebel, Sr. | Applicant |
| EP843437 | 1998-05-01 | Applicant | |
| EP891656 | 1999-09-01 | Applicant | |
| EP940957 | 1999-09-01 | Applicant | |
| EP973292 | 2000-01-01 | Applicant | |
| EP986181 | 2000-03-01 | Applicant | |
| EP1009098 | 2000-06-01 | Applicant | |
| EP1030457 | 2000-08-01 | Applicant | |
| FR2724522 | 1996-03-01 | Applicant | |
| GB2346782 | 2000-08-01 | Applicant | |
| WO99/19994 | 1999-04-01 | Applicant | |
| WO-01/43384 | 2001-06-01 | Applicant | |
| WO2/19552 | 2002-03-01 | Applicant | |
| WO-02/21702 | 2002-03-01 | Applicant | |
| WO-02/23738 | 2002-03-01 | Applicant | |
| WO-02/23739 | 2002-03-01 | Applicant | |
| WO2/37691 | 2002-05-01 | Applicant | |
| WO2/41563a2 | 2002-05-01 | Applicant |
Non-Patent Literature (38)
- Benedetto, S., et al., “Parallel Concatenated Trellis Coded Modulation,” Jet Propulsion Laboratory, California Institute of Technology, 5 pages.Applicant
- Ramsey, John L., “Realization of Optimum Interleavers,” IEEE Transactions on Information Theory, May 1970, pp. 338-345, vol. IT-16, No. 3.Applicant
- Ungerboeck, Gottfried, “Channel Coding with Multilevel/Phase Signals,” IEEE Transactions on Information Theory, Jan. 1982, pp. 55-66, vol. IT-28, No. 1.Applicant
- Battail, Gérard, et al., “Suboptimum Decoding Using Kullback Principle,” in Lecture Notes in Computer Science, 1988, pp. 93-101, No. 313, B. Bouchon et al. Eds.Applicant
- Berrou, Claude, et al., “Near Shannon Limit Error-Correcting Coding and Decoding: Turbo-Codes,”IEEE International Conference on Communications '93, Geneva Switzerland, May 23, 1993, pp. 1064-1070, Technical Program, Conference Record, vol. 2/3.Applicant
- Moher, Michael, “Decoding Via Cross-Entropy Minimization,” Proceedings IEEE GLOBECOM Conference, Houston, TX, Dec. 1993, pp. 809-813.Applicant
- Dolinar, S., et al., “Weight Distribution for Turbo Codes Using Random and Nonrandom Permutations,” TDA Progress Report 42-122, Jet Propulsion Laboratory, Aug. 1995, pp. 56-65.Applicant
- Fazel, K., et al., “Combined Multilevel Turbo-Code with 8PSK Modulation,” Global Telecommunications Conference, 1995. Conference Record. Communication Theory Mini-Conference, GLOBECOM '95. IEEE Singapore, Nov. 13, 1995, pp. 649-653.Applicant
- Divsalar, D., et al., “Effective Free Distance of Turbo Codes,” Electronics Letters, Feb. 29, 1996, pp. 445-446, vol. 32, No. 5.Applicant
- Hagenauer, Joachim, et al., “Iterative Decoding of Binary Block and Convolutional Codes,” IEEE Transactions on Information Theory, Mar. 1996, pp. 429-445, vol. 42, No. 2.Applicant
- Berrou, Claude, “Near Optimum Error Correcting Coding and Decoding: Turbo-Codes,” IEEE Transactions on Communications, Oct. 1996, pp. 1261-1271, vol. 44, No. 10.Applicant
- Pietrobon, Steven S., “Implementation and Performance of a Turbo/MAP Decoder,” a paper submitted to the International Journal of Satellite Communications, Feb. 21, 1997, rev. Dec. 4, 1997 and Apr. 2, 1998, 45 pages.Applicant
- Robertson, Patrick, et al., “Bandwidth-Efficient Turbo Trellis-Coded Modulation Using Punctured Component Codes,” IEEE Journal on Selected Areas in Communications, Feb. 1998, pp. 206-218, vol. 16, No. 2.Applicant
- Viterbi, Andrew J., “An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolutional Codes,” IEEE Journal on Selected Areas in Communications, Feb. 1998, pp. 260-264, vol. 16, No. 2.Applicant
- Hsu, Jah-Ming, et al., “A Parallel Decoding Scheme for Turbo Codes,” ISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems, Monterey, CA, May 31, 1998, pp. 445-448.Applicant
- Gross, W.J., et al., “Simplified MAP Algorithm Suitable for Implementation of Turbo Decoders,” Electronics Letters, Aug. 6, 1998, pp. 1577-1578, vol. 34, No. 16.Applicant
- Yue, Chung-Wai, et al., “On the FER Performance and Decoding Complexity of Turbo Codes,” 1999 IEEE 49th Vehicular Technology Conference, Houston, TX, May 16, 1999, pp. 2214-2218.Applicant
- Langlais, Charlotte, et al., “Synchronisation in the Carrier Recovery of a Satellite Link Using Turbo-Codes with the Help of Tentative Decisions,” IEE Colloquium. Turbo Codes in Digital Broadcasting—Could It Double Capacity?, Nov. 22, 1999, pp. 5/1-7.Applicant
- Kim, Bonghoe, et al., “Reduction of the Number of Iterations in Turbo Decoding Using Extrinsic Information,” IEEE TENCON, 1999, pp. 494-497.Applicant
- Richardson. Tom, “The Geometry of Turbo-Decoding Dynamics,” IEEE Transactions on Information Theory, Jan. 2000, pp. 9-23, vol. 46, No. 1.Applicant
- Schlegel, Christian, Trellis Coding, 1997, IEEE Press, Piscataway, New Jersey (entire book).Applicant
- Heegard, Chris, et al., Turbo Coding, 1999, Kluwer Academic Publishers, Norwell, Massachusetts (entire book).Applicant
- Vucetic, Branka, et al., Turbo Codes Principles and Applications, 2000, Kluwer Academic Publishers, Norwell, Massachusetts (entire book).Applicant
- Sklar, Bernard, Digital Communications Fundamentals and Applications, Second Edition 2001, Prentice Hall PTR, Upper Saddle River, New Jersey (entire book).Applicant
- Schurgers C. et al.: “Energy Efficient Data Transfer and Storage Organization for a MAP Turbo Decoder Module”; XP010355952; Aug. 16, 1999, pp. 76-81, ISBN: 1-58113-133-X.Applicant
- Collins O.M. et al.: “Iterative Decoding of Non-Systematic Turbo-Codes”; 2000 IEEE International Symposium on Information Theory, Sorrento, Italy, Jun. 25-30, 2000, p. 172, ISBN: 0-7803-5857-0.Applicant
- Morlet C. et al.: “A Carrier Phase Estimator For Multi-media Satellite Payloads Suited to RSC Coding Schemes”; IEEE 2000, Jun. 18, 2000, pp. 455-459 vol. 1; ISBN: 0-7803-6283-7.Applicant
- Proakis J.G.: “Digital Communications” 1991, Modulation and Demodulation for the Additive Gaussian Noise Channel, McGraw-Hill, New York; XP002193198 181370, pp. 234-271.Applicant
- Agrawal, Dakshi, et al.; “On the Phase Trajectories of the Turbo-Decoding Algorithm”; 1999 IMA Summer Program Codes, Systems and Graphical Models; http://www.comm.csl.uiuc.edu/˜dakshi; Aug. 3, 1999; pp. 1-22; XP-002207488.Applicant
- Buckley, Michael E., et al.; “The Design and Performance of a Neural Network for Predicting Turbo Decoding Error with Application to Hybrid ARQ Protocols”; IEEE Transactions on Communications; Apr. 2000; pp. 566-576; vol. 48., No. 4; XP-000932188; IEEE.Applicant
- Ebel, William J.; “Turbo Code Implementation of the C6x”; Texas Instruments DSPS Fest '99; Aug. 1999; pp. 1-13 XPoo2207490; Houston, TX.Applicant
- Rajashekhara, T.M.; “Signature Analyzers in Built-In-Self-Test Circuits: A Perspective”; Proceedings of the 1990 IEEE Southern Tier Technical Conference; 25 Apr. 1990; pp. 275-281; XP-010010765.Applicant
- Shao, Rose Y., et al., “Two Simple Stopping Criteria for Turbo Decoding” IEEE Transactions on Communications; Aug. 8, 1999; pp. 1117-1120; vol. 47, No. 8; XP-000848102; IEEE.Applicant
- Wu, Yufei, et al.; “A Simple Stopping Criterion for Turbo Decoding”; IEEE Communications Letters; Aug. 2000; pp. 258-260; vol. 4, No. 8; XP-000959692; IEEE.Applicant
- Internet Papers: “Codes, Systems and Graphical Models”; 1999 IMA Summer Program; http://www.ima.umm.edu/csg/; Aug. 2-13, 1999; pp. 1-6; XP-002207489.Applicant
- Clark, G.C., et al.; “Error-Correction Coding for Digital Communications”; Error Correction Coding for Digital Communication: 1981; pp. 349-352; XP002131001.Applicant
- Shoemake, Mathew B., et al.; “Turbo Codes for High Order Constellations”; Information Theory Workshop; Jun. 22, 1998; pp. 6-7; XP010297309; IEEE; USA.Applicant
- Wang, Zhongfeng, et al.; “VLSI Implementation Issues of Turbo Decoder Design for Wireless Applications”; Signal Processing Systems; Oct. 20, 1999; pp. 503-512; XP010370879.Applicant