Discrete multitone modulation with principal component filter banks

Discrete multitone (DMT) modulation is an attractive method for communication over a nonflat channel with possibly colored noise. The uniform discrete Fourier transform (DFT) filter bank and cosine modulated filter bank have in the past been used in this system because of low complexity. We show in this paper that principal component filter banks (PCFB) which are known to be optimal for data compression and denoising applications, are also optimal for a number of criteria in DMT modulation communication. For example, the PCFB of the effective channel noise power spectrum (noise psd weighted by the inverse of the channel gain) is optimal for DMT modulation in the sense of maximizing bit rate for fixed power and error probabilities. We also establish an optimality property of the PCFB when scalar prefilters and postfilters are used around the channel. The difference between the PCFB and a traditional filter bank such as the brickwall filter bank or DFT filter bank is significant for effective power spectra which depart considerably from monotonicity. The twisted pair channel with its bridged taps, next and fext noises, and AM interference, therefore appears to be a good candidate for the application of a PCFB. This is demonstrated with the help of numerical results for the case of the ADSL channel

Joint optimization of transceivers with fractionally spaced equalizers

In this paper we propose a method for joint optimization of transceivers with fractionally spaced equalization (FSE). We use the effective single-input multiple-output (SIMO) model for the fractionally spaced receiver. Since the FSE is used at the receiver, the optimized precoding scheme should be changed correspondingly. Simulation shows that the proposed method demonstrates remarkable improvement for jointly optimal linear transceivers as well as transceivers with decision feedback

A Near-Optimal Linear Crosstalk Precoder for VDSL

Crosstalk is the major source of performance degradation in VDSL. In downstream transmission crosstalk precoding can be applied. The transmitted signal is predistorted, such that the predistortion annihilates with the crosstalk introduced in the binder. Several crosstalk precoders have been proposed. Unfortunately they either give poor performance or require non-linear operations, which results in a high complexity. In this paper we present a simple, linear diagonalizing crosstalk precoder with low run-time complexity. A lower bound on the performance of the DP is derived. This allows performance to be predicted without explicit knowledge of the crosstalk channels, which simplies service provisioning considerably. This bound shows that the DP operates close to the single-user bound. So the DP is a low complexity design with predictable, near-optimal performance. The combination of spectra optimization and crosstalk precoding is also considered. Spectra optimization in a broadcast channel generally involves a highly complex optimization problem. Since the DP decouples transmission on each line, the spectrum on each modem can be optimized through a dual decomposition, leading to a significant reduction in complexity

A near-optimal linear crosstalk precoder for downstream VDSL

This paper presents a linear crosstalk precoder for VDSL that has a low run-time complexity. A lower bound on the data-rate of the precoder is developed and guarantees that the precoder achieves near-optimal performance in 99% of VDSL channels

Scheduling heuristic for reduced complexity of coordinated beamforming in large multi-carrier heterogeneous wireless networks

The research and development of wireless communication systems is often based on relatively simple models of the network topology, the radio channel and the radio propagation. This is considered to be mostly appropriate, as only under these conditions the complex technical problems in this field can be fully solved to their theoretical boundaries. However, it can also be the case that algorithms or concepts created under simplified assumptions perform in a significantly different way, when they are applied in more realistic scenarios. This Thesis presents research work which can be seen as a step towards extending the existing research on Coordinated Beamforming to a complex network scenario, i.e. to a large-scale heterogeneous multi-carrier network. For this purpose, a complex simulation framework has been developed. This is used to analyse the significant implications the conditions in a complex network can have on the achievable performance gains. In more detail, the out of cluster interference and the number of mobile stations are identified as factors which heavily influence the performance. This knowledge is then used to design a novel scheduling heuristic, designed to be able to adapt to the particular network scenarios and to estimate the extent of the achievable performance gains. Our simulation results show that the new heuristic achieves significant performance gains for a low number of mobile stations (by applying zero forcing precoding) as well as for a high number of mobile stations (by a coordinated resource assignment that intelligently pairs mobile stations when applying maximum ratio transmission). The Thesis also demonstrates that the effect of the out of cluster interference can cause the reduction of the achievable gains. Due to the knowledge of performance limiting factors, the scheduling heuristic is in addition able to realize a trade-off between complexity and performance by excluding transmission parameters from the scheduling process which are not expected to be beneficial