Abstract:
Frames comprise odd fields and even fields. The frame sync segments of the odd fields contains a current map specifying the location of data in frames, a next map specifying the location of data in a future frame, and a frame count designating the future frame. The frame sync segments of the even field may contain the same information. Alternatively, the frame sync segments of the odd fields contain the current map and part of the frame count, and the frame sync segments of the corresponding even fields contain the next map and the rest of the frame count. A receiver uses the map and frame count information to find data in the fields of received frames.
Abstract:
A data frame structure for variable size data constellations includes repetitive data segments each containing a fixed number of symbols arranged as a data segment sync character and data bytes. The frame includes a header segment including a frame sync code and a data constellation size code for the data frame. The data frame incorporates error correction groups and the frame size is selected to produce an integral number of error correction groups and data bytes in each frame for all of the variable size data constellations.
Abstract:
A television signal transmission system comprises a multiplexer (34) for combining a compressed video data signal and one or more auxiliary data signals to form a multiplexed signal for transmission over a channel of fixed bandwidth. The multiplexer (34) is controlled to vary the ratio of the components comprising the multiplexed signal to insure satisfactory reproducible image quality in response to the received compressed video data signal. The compressed video data signal may be buffered (26) prior to combination with the auxiliary data, in which case the multiplexer (34) is also further controlled to vary the ratio of the components comprising the multiplexed signal to maintain the fullness of the buffer (26) at an acceptable level.
Abstract:
An apparatus (28) for de-rotating and de-interleaving data includes (i) a first memory (32) for storing D elements of rotated and interleaved data in D storage locations, (ii) a first addresser (36) for addressing the first memory (32) in order to read de-rotated and interleaved data out of the D storage locations and to write rotated and interleaved data into the D storage locations, (iii) a second memory (38) for storing mD elements of the de-rotated and interleaved data read out of the first memory (32), wherein the de-rotated and interleaved data read out of the first memory (32) are stored in mD storage locations of the second memory (38), and (iv) a second addresser (40) for addressing the second memory (38) in order to read de-rotated and de-interleaved data out of the mD storage locations and to write de-rotated and interleaved data from the first memory (32) into the mD storage locations.
Abstract:
An ATV system (16, 18, 20) encodes variable length elementary streams of data into a multilevel symbol signal comprising a plurality of multiplexed fixed length data packets without sync information. The fixed length data packets are arranged in fields of repetitive data segments, each of which includes a data segment sync and each field of which includes a field sync. The fields of data segments are transmitted as suppressed carrier VSB modulation (28). In an ATV receiver, the data segment sync is used to generate a timing signal that identifies the beginning of each fixed length data packet. In one embodiment, a packet sync signal is inserted into each recovered fixed length data packet for recovering the elementary streams of data. In another embodiment, recovery of the elementary streams of data is accomplished without inserting a packet sync signal.
Abstract:
A convolutional interleaver or deinterleaver comprises an address signal generator for repeatedly generating [(B-1)N/2] + 1 sequences of address signals, where B is a desired interleave depth and N is a value equal to or greater than the number of data bytes in an R-S block of the data stream. Each of the sequences corresponds to a respective row of a B column matrix, the first column of which comprises [(B-1)N/2] + 1 consecutively numbered values. Each remaining column comprises the preceding column rotated by an integer multiple of N/B. The address signals are applied to a memory having [(B-1)N/2] + 1 storage locations for reading the data stored at the address memory location and then writing the current data byte to the same memory location.
Abstract:
The tap weights of an equalizer are initialized in response to a received relatively short training sequence, and new tap weights for the equalizer are thereafter successively calculated in response to relatively long sequences of received symbols and corresponding sequences of decoded symbols. These new tap weights are successively applied to the equalizer.
Abstract:
An impulse response is estimated for a channel by estimating an intermediate impulse response of the channel. The intermediate impulse response comprises at least one multipath spike and one or more non-deterministic noise components at locations throughout the channel. Then, a threshold function is applied to the estimated intermediate impulse response across at least a portion of the channel in order to provide an estimated final impulse response of the channel. The threshold function has the effect of nulling the noise components of the channel having values less than the threshold function at the location within the channel of the respective noise component, and the threshold function is characterized by a level that varies across the portion of the channel from a minimum value to a maximum value in a manner determined by the location of the at least one multipath spike within the channel.
Abstract:
A response of a channel may be estimated by correlating a received signal and a training sequence, by forming a matrix Γ based on a desired shape for the peaks of the correlation, by extracting a vector y from the received signal, and by estimating the channel response from a least-squares solution based on the matrix Γ, the vector y, and a matrix formed from the elements of the known training sequence.
Abstract:
Initial values of the tap weights for the taps of a linear equalizer are determined based on a channel impulse response of a channel so that the values corresponding to the weights of the equalizer taps achieve optimum initialization of the equalizer. These values are determined through use of a nested summation where the number of summations is dependent upon the number of multi-paths characterizing the channel.