Abstract:
Methods and OFDM receivers for decoding an OFDM signal include estimating a channel impulse response from a pilot-dense symbol of the OFDM signal for each of a plurality of potential FFT window positions; determining a noise floor of each of the channel impulse responses; selecting the potential window position corresponding to the channel impulse response with the lowest noise floor as an optimum FFT window position; and decoding symbols of the OFDM signal using the optimum FFT window position.
Abstract:
Methods and apparatus for efficient demapping of constellations are described. In an embodiment, these methods may be implemented within a digital communications receiver, such as a Digital Terrestrial Television receiver. The method reduces the number of distance metric calculations which are required to calculate soft information in the demapper by locating the closest constellation point to the received symbol. This closest constellation point is identified based on a comparison of distance metrics which are calculated parallel to either the I- or Q-axis. The number of distance metric calculations may be reduced still further by identifying a local minimum constellation point for each bit in the received symbol and these constellation points are identified using a similar method to the closest constellation point. Where the system uses rotated constellations, the received symbol may be unrotated before any constellation points are identified.
Abstract:
Methods and apparatus for efficient demapping of constellations are described. In an embodiment, these methods may be implemented within a digital communications receiver, such as a Digital Terrestrial Television receiver. The method reduces the number of distance metric calculations which are required to calculate soft information in the demapper by locating the closest constellation point to the received symbol. This closest constellation point is identified based on a comparison of distance metrics which are calculated parallel to either the I- or Q-axis. The number of distance metric calculations may be reduced still further by identifying a local minimum constellation point for each bit in the received symbol and these constellation points are identified using a similar method to the closest constellation point. Where the system uses rotated constellations, the received symbol may be unrotated before any constellation points are identified.
Abstract:
Channel state information (CSI) scaling modules for use in a demodulator configured to demodulate a signal received over a transmission channel, the demodulator comprising a soft decision error corrector (e.g. LDPC decoder) configured to decode data carried on data symbols of the received signal based on CSI values. The CSI scaling module is configured to monitor the performance of the soft decision error corrector and in response to determining the performance of the soft decision error corrector is below a predetermined level, dynamically select a new CSI scaling factor based on the performance of the soft decision error corrector.
Abstract:
A gaussian frequency shift keying (GFSK) detector comprising a multi-symbol detector; at least three Viterbi decoders, and a timing adjustment module. The multi-symbol detector receives a series of samples representing a received GFSK modulated signal which comprises at least three samples per symbol; and generates, for each set of samples representing an N-symbol sequence of the GFSK modulated signal, at least three sets of soft decisions values, each set of soft decision values indicating the probability that the N-symbol sequence of samples is each possible N-symbol pattern based on a different one of the at least three samples of a symbol being a centre sample of the symbol. Each Viterbi decoder generates, for each N-symbol sequence, a path metric for each possible N-symbol pattern from a different set of soft decision values according to a Viterbi decoding algorithm. The timing adjustment module generates a timing adjustment signal based on the path metrics generated by the Viterbi decoders to adjust the sample timing.
Abstract:
Tile based interleaving and de-interleaving of row-column interleaved data is described. In one example, the de-interleaving is divided into two memory transfer stages, the first from an on-chip memory to a DRAM and the second from the DRAM to an on-chip memory. Each stage operates on part of a row-column interleaved block of data and re-orders the data items, such that the output of the second stage comprises de-interleaved data. In the first stage, data items are read from the on-chip memory according to a non-linear sequence of memory read addresses and written to the DRAM. In the second stage, data items are read from the DRAM according to bursts of linear address sequences which make efficient use of the DRAM interface and written back to on-chip memory according to a non-linear sequence of memory write addresses.
Abstract:
A logging unit is used to log entries for events in a computer system. Each entry includes an n-bit timestamp field and a payload. The payload includes information about the event and the timestamp field includes the n least significant bits of an N-bit timestamp for the event, where N>n. If the n least significant bits of the timestamp have wrapped compared to the corresponding n bits of the timestamp of the preceding entry then a timing entry is logged which includes other bits of the timestamp. Therefore, an N-bit timestamp can be determined for an event, but only the n least significant bits of the timestamp are stored in the timestamp field of an entry for the event. Therefore, the time flow of events in the store is better maintained (by having a larger timestamp) without increasing the number of bits (n) in the timestamp field of each entry.
Abstract:
A non-data-aided method of calculating an estimate of the sampling frequency offset (SFO) in a digital receiver involves performing a plurality of correlations between two identical sized groups of samples within a received signal where the spacing of the groups is varied for each correlation. In various examples the number of samples in the groups is also varied. For larger symbols, the group of samples may comprise approximately the same number of samples as the guard interval in a symbol and for smaller symbols, the group of samples may comprise approximately the same number of samples as an entire symbol. An estimate of the SFO is determined by identifying the largest correlation result obtained from all the correlations performed. The largest correlation result indicates the largest correlation.
Abstract:
A logging unit is used to log entries for events in a computer system. Each entry includes an n-bit timestamp field and a payload. The payload includes information about the event and the timestamp field includes the n least significant bits of an N-bit timestamp for the event, where N>n. If the n least significant bits of the timestamp have wrapped compared to the corresponding n bits of the timestamp of the preceding entry then a timing entry is logged which includes other bits of the timestamp. Therefore, an N-bit timestamp can be determined for an event, but only the n least significant bits of the timestamp are stored in the timestamp field of an entry for the event. Therefore, the time flow of events in the store is better maintained (by having a larger timestamp) without increasing the number of bits (n) in the timestamp field of each entry.
Abstract:
Distortion caused by spurious components in a determined channel impulse response (CIR) is reduced. In an OFDM (orthogonal frequency-division multiplexing) system pilot signals are applied to different subcarriers of different symbols in accordance with a pilot transmission scheme. Channel estimates are determined by time-interpolation for some of the data slots of the received signal which do not already include a pilot signal. For each of a sequence of symbols, a respective Inverse Fast Fourier Transform is performed on the pilot signals and interpolated channel estimates in the data slots of that symbol, thereby determining a sequence of estimated CIRs for the sequence of symbols. Spurious channel components will vary across the sequence of estimated CIRs, whereas the true channel peaks will tend not to significantly vary across the sequence of estimated CIRs. Therefore the sequence of estimated CIRs can be filtered (e.g. with a low-pass filter) to attenuate the spurious components, thereby determining a CIR for the signal for which the distortion caused by the spurious components is reduced.