Future transmitter/receiver diversity schemes in broadcast wireless networks

An open diversity architecture for a cooperating broadcast wireless network is presented that exploits the strengths of the existing digital broadcast standards. Different diversity techniques for broadcast networks that will minimize the complexity of broadcast systems and improve received SNR of broadcast signals are described. Resulting digital broadcast networks could require fewer transmitter sites and thus be more cost-effective with less environmental impact. Transmit diversity is particularly investigated since it obviates the major disadvantage of receive diversity being the difficulty of locating two receive antennas far enough apart in a small mobile device. The schemes examined here are compatible with existing broadcast and cellular telecom standards and can be incorporated into existing systems without change

Measurements, processing functions and laboratory test-bed experiments for evaluating diversity in broadcast network

This paper presents a test-bed development and measurement plan for evaluating transmit diversity and on-channel repeaters in the Digital Video Broadcasting Network. Transmit diversity reduces the complexity and improves the power consumption of the personal receiving devices by enhancing the transmission of signals in NLOS cluttered environments. It is more practical than receive diversity due to the difficulty of locating two receive antennas far enough apart in a small mobile device. The on-channel repeater is to extend the coverage of the DVB-T/H network in areas where services are inaccessible by receiving the DVB-T/H signals off air, amplifying and then retransmitting it on the same frequency as received. Test service scenarios were developed to illustrate the benefits of such technologies so that effectiveness can be researched in a variety of service and terrain scenarios using purpose built test systems.The work presented in this paper was supported by the European Commission IST project PLUTO

Distributed space time block coding in asynchronous cooperative relay networks

The design and analysis of various distributed space time block coding schemes for asynchronous cooperative relay networks is considered in this thesis. Rayleigh frequency flat fading channels are assumed to model the links in the networks, and interference suppression techniques together with an orthogonal frequency division multiplexing type transmission approach are employed to mitigate the synchronization errors at the destination node induced by the different delays through the relay nodes. Closed-loop space time block coding is first considered in the context of decode-and-forward (regenerative) networks. In particular, quasi orthogonal and extended orthogonal coding techniques are employed for transmission from four relay nodes and parallel interference cancellation detection is exploited to mitigate synchronization errors. Availability of a direct link between the source and destination nodes is studied, and a new Alamouti space time block coding technique with parallel interference cancellation detection which does not require such a direct link connection and employs two relay nodes is proposed. Outer coding is then added to gain further improvement in end-to-end performance and amplify-and-forward (non regenerative) type networks together with distributed space time coding are considered to reduce relay node complexity. Novel detection schemes are then proposed for decode-and-forward networks with closed-loop extended orthogonal coding which reduce the computational complexity of the parallel interference cancellation. Both sub-optimum and near-optimum detectors are presented for relay nodes with single or dual antennas. End-to-end bit error rate simulations confirm the potential of the approaches and their ability to mitigate synchronization errors. A relay selection approach is also formulated which maximizes spatial diversity gain and attains robustness to timing errors. Finally, a new closed-loop distributed extended orthogonal space time block coding solution for amplify-and-forward type networks which minimizes the number of feedback bits by using a cyclic rotation phase is presented. This approach utilizes an orthogonal frequency division multiplexing type transmission structure with a cyclic prefix to mitigate synchronization errors. End-to-end bit error performance evaluations verify the efficacy of the scheme and its success in overcoming synchronization errors

Adaptive antennas at the mobile and base stations in an OFDM/TDMA system

In recent years, several smart antenna systems have been proposed and demonstrated at the base station (BS) of wire-less communications systems, and these have shown that significant system performance improvement is possible. In this paper, we consider the use of adaptive antennas at the BS and mobile stations (MS), operating jointly, in combination with orthogonal frequency-division multiplexing. The advantages of the proposed system includes reductions in average error probability and increases in capacity compared to conventional systems. Multiuser access, in space, time, and through subcarriers, is also possible and expressions for the exact joint optimal antenna weights at the BS and MS under cochannel interference conditions for fading channels are derived. To demonstrate the potential of our proposed system, analytical along with Monte Carlo simulation results are provided

Distributed space time block coding and application in cooperative cognitive relay networks

The design and analysis of various distributed space time block coding schemes for cooperative relay networks is considered in this thesis. Rayleigh frequency flat and selective fading channels are assumed to model the links in the networks, and interference suppression techniques together with an orthogonal frequency division multiplexing (OFDM) type transmission approach are employed to mitigate synchronization errors at the destination node induced by the different delays through the relay nodes. Closed-loop space time block coding is first considered in the context of decode-and-forward (regenerative) networks. In particular, quasi orthogonal and extended orthogonal coding techniques are employed for transmission from four relay nodes and parallel interference cancellation detection is exploited to mitigate synchronization errors. Availability of a direct link between the source and destination nodes is studied. Outer coding is then added to gain further improvement in end-to-end performance and amplify-and-forward (non regenerative) type networks together with distributed space time coding are considered to reduce relay node complexity. A novel detection scheme is then proposed for decode-and-forward and amplify-and-forward networks with closed-loop extended orthogonal coding and closed-loop quasi-orthogonal coding which reduce the computational complexity of the parallel interference cancellation. The near-optimum detector is presented for relay nodes with single or dual antennas. End-to-end bit error rate simulations confirm the potential of the approach and its ability to mitigate synchronization errors

Efficient Detectors for MIMO-OFDM Systems under Spatial Correlation Antenna Arrays

This work analyzes the performance of the implementable detectors for multiple-input-multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) technique under specific and realistic operation system condi- tions, including antenna correlation and array configuration. Time-domain channel model has been used to evaluate the system performance under realistic communication channel and system scenarios, including different channel correlation, modulation order and antenna arrays configurations. A bunch of MIMO-OFDM detectors were analyzed for the purpose of achieve high performance combined with high capacity systems and manageable computational complexity. Numerical Monte-Carlo simulations (MCS) demonstrate the channel selectivity effect, while the impact of the number of antennas, adoption of linear against heuristic-based detection schemes, and the spatial correlation effect under linear and planar antenna arrays are analyzed in the MIMO-OFDM context.Comment: 26 pgs, 16 figures and 5 table

Multiuser MIMO-OFDM for Next-Generation Wireless Systems

This overview portrays the 40-year evolution of orthogonal frequency division multiplexing (OFDM) research. The amelioration of powerful multicarrier OFDM arrangements with multiple-input multiple-output (MIMO) systems has numerous benefits, which are detailed in this treatise. We continue by highlighting the limitations of conventional detection and channel estimation techniques designed for multiuser MIMO OFDM systems in the so-called rank-deficient scenarios, where the number of users supported or the number of transmit antennas employed exceeds the number of receiver antennas. This is often encountered in practice, unless we limit the number of users granted access in the base station’s or radio port’s coverage area. Following a historical perspective on the associated design problems and their state-of-the-art solutions, the second half of this treatise details a range of classic multiuser detectors (MUDs) designed for MIMO-OFDM systems and characterizes their achievable performance. A further section aims for identifying novel cutting-edge genetic algorithm (GA)-aided detector solutions, which have found numerous applications in wireless communications in recent years. In an effort to stimulate the cross pollination of ideas across the machine learning, optimization, signal processing, and wireless communications research communities, we will review the broadly applicable principles of various GA-assisted optimization techniques, which were recently proposed also for employment inmultiuser MIMO OFDM. In order to stimulate new research, we demonstrate that the family of GA-aided MUDs is capable of achieving a near-optimum performance at the cost of a significantly lower computational complexity than that imposed by their optimum maximum-likelihood (ML) MUD aided counterparts. The paper is concluded by outlining a range of future research options that may find their way into next-generation wireless systems

Symbol-timing estimation in space-time coding systems based on orthogonal training sequences

Space-time coding has received considerable interest recently as a simple transmit diversity technique for improving the capacity and data rate of a channel without bandwidth expansion. Most research in space-time coding, however, assumes that the symbol timing at the receiver is perfectly known. In practice, this has to be estimated with high accuracy. In this paper, a new symbol-timing estimator for space-time coding systems is proposed. It improves the conventional algorithm of Naguib et al. such that accurate timing estimates can be obtained even if the over-sampling ratio is small. Analytical mean-square error (MSE) expressions are derived for the proposed estimator. Simulation and analytical results show that for a modest oversampling ratio (such as Q equal to four), the MSE of the proposed estimator is significantly smaller than that of the conventional algorithm. The effects of the number of transmit and receive antennas, the oversampling ratio, and the length of training sequence on the MSE are also examined. © 2005 IEEE.published_or_final_versio