Abstract: This invention provides a dynamic frequency hopping system that utilizes information from multiple base stations. The system assigns frequency hopping patterns based on current interference and traffic environments to avoid interference thus gaining the benefits of interference averaging and interference avoidance. The system imposes less stringent measurement requirements on terminals (wireless mobile devices) because many measurement requirements are replaced by generating estimates based on measurement data received from other base stations within a base station neighborhood. The system may continuously verify that the frequency hopping patterns assigned to the links of the system optimizes system performance. The system compares system performance of possible frequency hopping patterns against currently assigned frequency hopping pattern to optimize system performance.

Abstract: An efficient method for providing both dedicated and simulcast services over a common wireless infrastructure is described. The services can be available to a single terminal as well as to a multiplicity of terminals simultaneously. The method uses time division multiplexing and orthogonal frequency division multiple access for simulcasting information and transmitting dedicated message information from a plurality of base stations forming a cellular pattern over the same wireless frequency channel. The method comprises the steps of constructing frames for transmission by the plurality of base stations comprising control information, simulcast information and dedicated message information within predetermined time slots of the frames and allocating the simulcast information and the dedicated message information to time slots of the same frame predetermined by the control information of the frame. The underlying modulation technology used is OFDM and thereby the channel delay-dispersion is minimized.

Abstract: A technique for packet-switching suitable for interference-limited wireless communication systems is provided. Long bursty packets of data are broken into shorter units or packet-slots. This advantageously provides for averaging and minimizing interference in time--one of the requirements for achieving high system capacity in interference-limited systems. Transmit-start times and durations of packet slots are controlled by packet-slot distribution patterns. The patterns are representable by unipolar binary codes/sequences whose properties are based on number-theoretic principles. The technique minimizes the time variance of composite interference due to simultaneous transmissions of numerous signals over the same frequency channel. By minimizing the variance of overall interference, this technique satisfies the demand of multi-media traffic and also increases system capacity in a fading multipath environment.

Abstract: A rake receiver for use in direct-sequence code-division multiple-access communication systems employs a novel channel estimator capable of resolving multipath components spaced closer than a chip interval of the direct-sequence signature sequence. The estimator utilizes a constrained iterative deconvolution technique which employs projection onto convex sets (POCS). In a matched filter rake receiver embodiment, the delay T.sub.SC between two taps of a delay line is smaller than the duration T.sub.C of a chip of pseudo-random sequence. A rake receiver constructed in this manner is capable of detecting signals that have propagated through multipath channels and that have path components spaced closer than one chip of the signal sequence (i.e. closer than the inverse of the signal bandwidth).

Abstract: An equalization technique for the compensation of degradation caused by multipath Rayleigh fading channels to the transmission of digitally modulated signals such as .pi./4 Differential Quadrature Phase Shift Keying (DQPSK) modulated signals. The technique is applicable to both linear and nonlinear transversal equalizers. Based on the Method of Projection onto Convex Sets (POCS), the technique is realized in an iterative form. The convergence speed of equalization depends on the magnitude of a look-back parameter, and is comparable to the speed of recursive least square based equalizers. The computational complexity of the technique also is variable and is adaptable to the convergence speed requirements. For achieving convergence speeds as recursive least square techniques, the computational load required of the presented equalization is of the order of the load required of the recursive least square techniques, but its program implementation is exceedingly simpler.