Abstract:
In a data receiver (18) which periodically samples at predefined sample points a received analog signal and produces therefrom a digital output, an adaptive self-noise cancellation timing recovery circuit (26) includes: a self-noise canceller (44), responsive to the samples and the digital output, for adaptively approximating the self-noise component of the samples and for removing the approximated self-noise component from the samples to produce substantially self-noise free samples; a timing error generator (42), responsive to the self-noise free samples and the digital output, for generating a timing error signal proportional to sampling deviations from the predefined sample points of the data receiver; and a control device (40), responsive to the timing error signal, for controlling the sampling phase of the data receiver to eliminate the sampling deviations.
Abstract:
The present invention provides a device and method in multi-access communications system for reliably receiving burst transmissions from users in the presence of narrow band interference. The adaptive interference suppreser incorporates adaptive elements that are updated using a predetermined adaptation algorithm. These adaptive elements are stored in memory at the end of the burst transmission for reuse in receiving a next burst transmission.
Abstract:
Multipoint control units (902) are networked utilizing a predetermined number of mixing operations such that delay is reduced while maintaining overall quality. The present invention provides an advantageous system (200) by also substantially reducing communication costs by utilizing efficient networking.
Abstract:
The present invention provides a method (900) and device (100) in multimedia communication systems for efficiently segmenting information bitstreams from multiple media sources into variable length packets, and multiplexing and sending the packets to a shared communication link with low delay and low overhead. The packet segmentation and multiplexing are performed dynamically based on fullness of a set of information buffers that contain the information bitstreams to be transmitted, and delay-sensitivity of each information bitstream. The multi-discipline queuing scheme has been developed in this invention to control the dynamic packet segmenting and multiplexing process.
Abstract:
During encoding, a microprocessor (201) calculates Y m by standard Reed-Solomon encoding techniques. The microprocessor (201) then utilizes Y m as an index to a look-up table (203), and is returned G o Y m , G 1 Y m , ..., G K-1 Y m , from the look-up table (203). During syndrome calculation, a second set of parity symbols are generated from the information symbols using the method similar to the encoder, in particular, values for G o Y m , ..., G K-1 Y m are obtained from a first look-up table (503) in a similar manner as encoder to determine the values for G o Y m , G 1 Y m , ..., G K-1 Y m . A second look-up table (505) is set up to determine roots of the error locator polynomial. The second look-up table consists of several tables and each table contains (Q-1) elements, where Q is the size of the GF(Q) field. The mth look-up table stores Galois Field element α -mi at location i if the greatest common denominator between (Q-1) and m (GCD(Q-1,m))=1. If GCD(Q-1,m) ≠1, then the mth look-up table actually consists of (GCD(Q-1,m)) sub-tables storing GF element α -(mi+j) , where j=0, 1, ..., GCD(Q-1,m)-1.
Abstract:
In a transmitter (10) for transmitting data in blocks over a channel to a receiver (19), a device for improving a defined property of transform-domain symbols, the device, including: a signal mapper (12) which maps the input data into blocks of symbols in a first domain; wherein each of the symbols is chosen from a base constellation contained in an expanded constellation having expansion symbols, and wherein at least some of the symbols in the base constellation have one or more corresponding expansion symbols; and a perturbation transform device (14 and 16), responsive to the blocks of symbols, which produces for each block of symbols in the first domain a block of perturbed transform-domain symbols in order to improve a defined property of the transform-domain symbols.
Abstract:
During encoding, a microprocessor (201) calculates Ym by standard Reed-Solomon encoding techniques. The microprocessor (201) then utilizes Ym as an index to a look-up table (203), and is returned GoYm, G1Ym, ..., GK-1Ym, from the look-up table (203). During syndrome calculation, a second set of parity symbols are generated from the information symbols using the method similar to the encoder, in particular, values for GoYm, ..., GK-1Ym are obtained from a first look-up table (503) in a similar manner as encoder to determine the values for GoYm, G1Ym, ..., GK-1Ym. A second look-up table (505) is set up to determine roots of the error locator polynomial. The second look-up table consists of several tables and each table contains (Q-1) elements, where Q is the size of the GF(Q) field. The mth look-up table stores Galois Field element α-mi at location i if the greatest common denominator between (Q-1) and m (GCD(Q-1,m))=1. If GCD(Q-1,m) ≠1, then the mth look-up table actually consists of (GCD(Q-1,m)) sub-tables storing GF element α-(mi+j), where j=0, 1, ..., GCD(Q-1,m)-1.
Abstract:
The present invention provides a method (900) and device (100) in multimedia communication systems for efficiently segmenting information bitstreams from multiple media sources into variable length packets, and multiplexing and sending the packets to a shared communication link with low delay and low overhead. The packet segmentation and multiplexing are performed dynamically based on fullness of a set of information buffers that contain the information bitstreams to be transmitted, and delay-sensitivity of each information bitstream. The multi-discipline queuing scheme has been developed in this invention to control the dynamic packet segmenting and multiplexing process.
Abstract:
During operation a transmitter and receiver of a central site termination unit (TU-C) (101) are driven by a sample clock derived from a network clock source (103). A remote termination unit (TU-R) (102) operates with a free running sampling clock and acquires and tracks the network clock (103) from a downstream signal (104). The regenerated network clock is then used to drive both the receiver (107) and the transmitter (108) of the TU-R (102). In particular, the transmit samples are generated on a block by block basis using fast algorithms. To avoid glitches during data transmission caused by block processing, the data sample at the boundary of blocks of data is replaced by an interpolated value. In particular, a first order approximation to the correct value of the boundary sample is made, and the first order approximation is substituted in place of the boundary data sample of the block.