1 |
Transceiver Design for Multiple Antenna Communication Systems with Imperfect Channel State InformationZhang, Xi January 2008 (has links)
Wireless communication links with multiple antennas at both the transmitter and the receiver sides, so-called multiple-input-multiple-output (MIMO)systems, are attracting much interest since they can significantly increase the capacity of band-limited wireless channels to meet the requirements of the future high data rate wireless communications. The treatment of channel state information (CSI) is critical in the design of MIMO systems. Accurate CSI at the transmitter is often not possible or may require high feedback rates, especially in multi-user scenarios. Herein, we consider the robust design of linear transceivers with imperfect CSI either at the transmitter or at both sides of the link. The framework considers the design problem where the imperfect CSI consists of a channel mean and an channel covariance matrix or, equivalently, a channel estimate and an estimation error covariance matrix. For single-user systems, the proposed robust transceiver designs are based on a general cost function of the average mean square errors. Under different CSI conditions, our robust designs exhibit a similar structure to the transceiver designs for perfect CSI, but with a different equivalent channel and/or noise covariance matrix. Utilizing majorization theory, the robust linear transceiver design can be readily solved by convex optimization approaches in practice. For multi-user systems, we consider both the communication link from the users to the access point (up-link) as well as the reverse link from the access point to the users (down-link). For the up-link channel, it is possible to optimally design robust linear transceivers minimizing the average sum mean square errors of all the data streams for the users. Our robust linear transceivers are designed either by reformulating the optimization problem as a semidefinite program or by extending the design of a single-user system in an iterative manner. Under certain channel conditions, we show that the up-link design problem can even be solved partly in a distributed fashion. For the down-link channel, a system with one receive antenna per user is considered. A robust system design is obtained by reducing the feedback load from all users to allow only a few selected users to feed back accurate CSI to the access point. We study the properties of four typical user selection algorithms in conjunction with beamforming that guarantee certain signal-to-interference-plus-noise ratio (SINR) requirements under transmit power minimization. Specifically, we show that norm-based user selection is asymptotically optimal in the number of transmitter antennas and close-to-optimal in the number of users. Rooted in the practical significance of this result, a simpler down-link system design with reduced feedback requirements is proposed. / QC 20100922
|
2 |
Resource management in cooperative MIMO-OFDM cellular systemsTölli, A. (Antti) 01 April 2008 (has links)
Abstract
Radio resource management techniques for broadband wireless systems beyond the existing cellular systems are developed while considering their special characteristics such as multi-carrier techniques, adaptive radio links and multiple-input multiple-output (MIMO) antenna techniques. Special focus is put on the design of linear transmission strategies in a cooperative cellular system where signal processing can be performed in a centralised manner across distributed base station (BS) antenna heads.
A time-division duplex cellular system based on orthogonal frequency division multiplexing (OFDM) with adaptive MIMO transmission is considered in the case where the received signals are corrupted by non-reciprocal inter-cell interference. A bandwidth efficient closed-loop compensation algorithm combined with interference suppression at the receiver is proposed to compensate for the interference and to guarantee the desired Quality of Service (QoS) when the interference structure is known solely at the receiver.
A greedy beam ordering and selection algorithm is proposed to maximise the sum rate of a multiuser MIMO downlink (DL) with a block zero forcing (ZF) transmission. The performance of the block-ZF transmission combined with the greedy scheduling is shown to approach the sum capacity as the number of users increases. The maximum sum rate is often found to be achieved by transmitting to a smaller number of users or beams than the spatial dimensions allow. In addition, a low complexity algorithm for joint user, bit and power allocation with a low signalling overhead is proposed.
Different linear transmission schemes, including the ZF as a special case, are developed for the scenario where the cooperative processing of the transmitted signal is applied to users located within a soft handover (SHO) region. The considered optimisation criteria include minimum power beamformer design; balancing the weighted signal-to-interference-plus-noise ratio (SINR) values per data stream; weighted sum rate maximisation; and balancing the weighted rate per user with additional QoS constraints such as guaranteed bit rate per user. The method can accommodate supplementary constraints, e.g., per antenna or per BS power constraints, and upper/lower bounds for the SINR values of the data streams. The proposed iterative algorithms are shown to provide powerful solutions for difficult non-convex transceiver optimisation problems.
System level evaluation is performed in order to assess the impact of a realistic multi-cell environment on the performance of a cellular MIMO-OFDM system. The users located in the SHO region are shown to benefit from greatly increased transmission rates. Consequently, significant overall system level gains result from cooperative SHO processing. The proposed SHO scheme can be used for providing a more evenly distributed service over the entire cellular network.
|
3 |
Traffic aware resource allocation for multi-antenna OFDM systemsVenkatraman, G. (Ganesh) 14 September 2018 (has links)
Abstract
This thesis focuses on two important challenges in wireless downlink transmission: multi-user (MU) precoder design and scheduling of users over time, frequency, and spatial resources at any given instant. Data streams intended for different users are transmitted by a multiple-input multiple-output (MIMO) multi-antenna orthogonal frequency division multiplexing (OFDM) system. The transmit precoders are designed jointly across space-frequency resources to minimize the number of backlogged packets waiting at the coordinating base stations (BSs), thereby implicitly performing user scheduling.
Then the problem of multicast beamformer design is considered wherein a subset of users belonging to a multicasting group are served by a common group-specific data. The design objective is to either minimize the transmit power for a guaranteed quality-of-service, or to maximize the minimum achievable rate among users for a given transmit power. Unlike existing techniques, the proposed design utilizes both the spatial and frequency resources jointly while designing multi-group beamformers.
As an extension to coordinated precoding, the problem of beamformer design for cloud radio access network is considered wherein beamformers are designed centrally, quantized and sent along with data to the respective BSs via backhaul. Since the users can be served by multiple BSs, beamformer design becomes a nonconvex combinatorial problem. Unlike existing solutions, beamformer overhead is also included in the backhaul utilization along with the associated data. As the number of antennas increases, backhaul utilization is dominated by the beamformers. Thus, to reduce the overhead, two techniques are proposed: varying the quantization precision, and reducing the number of active antennas used for transmission.
Finally, to reduce the complexity involved in the design of joint space- frequency approach, a two-step procedure is proposed, where a MU-MIMO scheduling algorithm is employed to find a subset of users for each scheduling block. The precoders are then designed only for the chosen users, thus reducing the complexity without compromising much on the throughput. In contrast to the null-space-based existing techniques, a low-complexity scheduling algorithm is proposed based on vector projections. The real-time performance of all the schedulers are evaluated by implementing them on both Xilinx ZYNQ-ZC702 system-on-chip (SoC) and TI TCI6636K2H multi-core SoC. / Tiivistelmä
Tässä väitöskirjassa keskitytään kahteen tärkeään langattoman tiedonsiirron haasteeseen alalinkkilähetyksissä: usean käyttäjän (MU) esikooderisuunnitteluun ja käyttäjien skedulointiin aika-, taajuus- ja tilaresurssien yli. Eri käyttäjille tarkoitettuja datavirtoja lähetetään käyttämällä monitulo-monilähtötekniikkaa (MIMO) yhdistettynä monikantoaaltomodulointiin (OFDM). Lähettimien esikooderit suunnitellaan yhteisesti tila- ja taajuusresurssien yli, jotta keskenään yhteistoiminnallisten tukiasemien jonossa olevien pakettien määrää voitaisiin minimoida samalla kun tehdään epäsuorasti käyttäjien skedulointia.
Tämän jälkeen työssä paneudutaan monilähetysten (multicast) keilanmuodostussuunnitteluun, jossa monilähetysryhmään kuuluvien käyttäjien alijoukolle lähetetään yhteistä ryhmäspesifistä dataa. Suunnittelun päämääränä on joko minimoida kokonaislähetysteho tietyllä palvelunlaatuvaatimuksella tai maksimoida pienin saavutettavissa oleva siirtonopeus käyttäjien joukossa tietyllä lähetysteholla. Toisin kuin olemassa olevat menetelmät, ehdotetussa mallissa käytetään yhteisesti sekä aika- että taajuusresursseja usean ryhmän keilanmuodostusta suunniteltaessa.
Laajennuksena yhteistoiminnalliselle esikoodaukselle, väitöskirjassa käsitellään myös keilanmuodostusta pilvipohjaisessa radioliityntäverkkoarkkitehtuurissa. Keilanmuodostajat suunnitellaan keskitetysti, kvantisoidaan ja lähetetään datan mukana tukiasemille käyttäen runkoverkkoyhteyttä. Koska käyttäjiä voidaan palvella usealta tukiasemalta, keilanmuodostussuunnittelu muuttuu ei-konveksiksi kombinatoriseksi ongelmaksi. Toisin kuin olemassa olevissa ratkaisuissa, ehdotettu malli sisällyttää käyttäjien datan lisäksi keilanmuodostajien resursoinnin tarpeen runkoverkkoon. Tukiaseman antennien määrän lisääntyessä, keilanmuodostajien osuus runkoverkon käyttöasteesta kasvaa suureksi. Jotta keilanmuodostajien aiheuttamaa ylimääräistä tiedonsiirtotarvetta voitaisiin minimoida, esitellään kaksi tekniikkaa: kvantisointitarkkuuden muunteleminen sekä lähetykseen käytettävien aktiivisten antennien määrän vähentäminen.
Lopuksi, jotta yhdistetyn tila-taajuussuunnittelun aiheuttamaa kompleksisuutta saataisiin vähennettyä, ehdotetaan kaksivaiheista menetelmää. MU-MIMO skedulointialgoritmin avulla etsitään ensin alijoukko käyttäjiä jokaiselle skedulointilohkolle. Esikooderit suunnitellaan vain valituille käyttäjille, mikä vähentää kompleksisuutta, heikentämättä suorituskykyä kuitenkaan olennaisesti. Poiketen nolla-avaruuteen perustuvista tekniikoista, esitetään yksinkertainen vektoriprojektioihin perustuva skeduleri. Kaikkien skedulerien reaaliaikasuorituskykyä on arvioitu toteuttamalla ne ohjelmoitavilla Xilinx ZYNQ-ZC702 system-on-chip (SoC) ja TI TCI6636K2H moniydinalustoilla.
|
Page generated in 0.0851 seconds