The use of short spreading sequences in UTRA-TDD may lead to large variability in uplink performance due to the level of cross correlation between spreading codes. The effective spreading code for a particular user is derived from a cell-specific scrambling code and the channelization code allocated to that user. We show that the interference between intercell users is dependent on their cell-specific scrambling code. This leads to a proposed cell-id allocation scheme for UTRA-TDD that reduces intercell interference. We also outline how the uplink air interface for future TD-CDMA systems may be designed to reduce this effect.

Orthogonal frequency-division multiplexing (OFDM) has received considerable interest as a means for delivering broadband data in highly dispersive wireless channels. Here we present the design, implementation, and performance of an OFDM system operating at 5.25 GHz, which provides 20 Mbits/s in an office environment. From propagation measurements, we describe a design methodology for determining the key parameters of the OFDM system, such as the number of subcarriers and the size of the guard period. The performance of the system is evaluated using experimental data obtained from a typical large open-plan office. Using a transmit power of +7 dBm, the OFDM system is capable of operating in a highly cluttered environment, providing usable error rates up to a range of 20 m. The importance of error control coding is shown, and we empirically derive the degree of correctability required to achieve packet failure rates of <1% from the cumulative distribution of errors per packet.

Previously, a class of generalized Reed-Muller (RM) codes has been suggested for use in orthogonal frequency-division multiplexing. These codes offer error correcting capability combined with substantially reduced peak-to mean power ratios. A number of approaches to decoding these codes have already been developed. Here, we present low complexity, suboptimal alternatives which are inspired by the classical Reed decoding algorithm for binary RM codes. We simulate these new algorithms along with the existing decoding algorithms using additive white Gaussian noise and two-path fading models for a particular choice of code. The simulations show that one of our new algorithms outperforms all existing suboptimal algorithms and offers performance that is within 0.5 dB of maximum-likelihood decoding, yet has complexity comparable to or lower than existing decoding approaches.

Noncoherent demodulators are very attractive for high performance radio LAN (HIPERLAN) systems because of their low implementation costs and their inherent robustness against frequency and carrier phase offsets. However, when the channel is time dispersive, the nonlinear intersymbol interference (ISI) introduced by these demodulators precludes the use of conventional linear equalization strategies. We present an alternative noncoherent receiver structure followed by a nonlinear equalizer, which includes a RAM and a Viterbi detector, capable of equalizing nonlinear multipath fading channels. In addition, we also present a new algorithm specifically for noncoherent demodulators, which allows estimation of all useful signal values at the input of the equalizer to be stored in the RAM. By means of computer simulations, we report the performance and computational complexity tradeoffs of the receiver/equalizer structure, including antenna diversity. We show that demodulators which consist of a complex receiver and a Viterbi detector are much more robust against multipath fading channels than traditional real noncoherent demodulators. The results suggest that in a typical HIPERLAN scenario, where the channel delay spread is less than 50 ns and a reliable line of sight component exists, it is feasible to combat multipath effects using noncoherent demodulation.

The performance of Reed-Muller encoding and a maximum-likelihood decoding algorithm for orthogonal frequency-division multiplexing is presented. The example codes have a tightly bounded peak-to-mean envelope power ratio, while simultaneously enabling powerful error correction. We present a maximum-likelihood decoder that makes use of a distance-preserving map and multiple fast Hadamard transforms. Its operation is described in detail and its performance is assessed under realistic channel conditions.

An equaliser algorithm has been developed for use with a differential detector operating in a time dispersive channel. Although differential detection allows the stringent requirements on frequency accuracy generally imposed on coherent receivers to be relaxed, its performance is more severely degraded by intersymbol interference. The algorithm, described in this paper, provides reliable performance even after differential detection. Results for the differential equaliser operating in a typical indoor wireless channel are presented and are shown to be comparable to those of a coherent receiver, using decision feedback equalisation.

In this paper a technique is described that permits increased receiver tolerance to uncoordinated CCI in a wireless LAN environment. The technique uses supervised clustering to determine the signal states due to ISI and a form of unsupervised fuzzy clustering for finding the signal states due to CCI. Using a decision feedback approach, it is shown that the receiver is capable of operating in high levels of CCI, providing usable error rates.

Standardisation bodies in Europe and North America are currently developing standards for high data rate packet radio LANs. Radio LANs will have two main applications: wired LAN replacement and ad-hoc networking. In contrast to wired LAN replacement, ad-hoc networks will operate without control from a central node. As a consequence, no central synchronisation is provided and nodes must have the capability of acquiring all synchronisation from a received packet. This synchronisation can be achieved by matched filtering synchronisation codes inserted into each data packet. This paper discusses these synchronisation requirements and outlines synchronisation sequence selection criteria.>