648 research outputs found
Virtual-MIMO systems with compress-and-forward cooperation
Multiple-input multiple-output (MIMO) systems have recently emerged as one of the most
significant wireless techniques, as they can greatly improve the channel capacity and link reliability
of wireless communications. These benefits have encouraged extensive research on a
virtual MIMO system where the transmitter has multiple antennas and each of the receivers has
a single antenna. Single-antenna receivers can work together to form a virtual antenna array and
reap some performance benefits of MIMO systems. The idea of receiver-side local cooperation
is attractive for wireless networks since a wireless receiver may not have multiple antennas due
to size and cost limitations.
In this thesis we investigate a virtual-MIMO wireless system using the receiver-side cooperation
with the compress-and-forward (CF) protocol. Firstly, to perform CF at the relay, we propose
to use standard source coding techniques, based on the analysis of its expected rate bound and
the tightness of the bound. We state upper bounds on the system error probabilities over block
fading channels. With sufficient source coding rates, the cooperation of the receivers enables
the virtual-MIMO system to achieve almost ideal MIMO performance. A comparison of ideal
and non-ideal conference links within the receiver group is also investigated. Considering the
short-range communication and using a channel-aware adaptive CF scheme, the impact of the
non-ideal cooperation link is too slight to impair the system performance significantly.
It is also evident that the practicality of CF cooperation will be greatly enhanced if a efficient
source coding technique can be used at the relay. It is even more desirable that CF cooperation
should not be unduly sensitive to carrier frequency offsets (CFOs). Thus this thesis then
presents a practical study of these two issues. Codebook designs of the Voronoi VQ and the
tree-structure vector quantization (TSVQ) to enable CF cooperation at the relay are firstly described.
A comparison in terms of the codebook design complexity and encoding complexity
is presented. It is shown that the TSVQ is much simpler to design and operate, and can achieve
a favourable performance-complexity tradeoff. We then demonstrate that CFO can lead to significant
performance degradation for the virtual MIMO system. To overcome it, it is proposed
to maintain clock synchronization and jointly estimate the CFO between the relay and the destination.
This approach is shown to provide a significant performance improvement.
Finally, we extend the study to the minimum mean square error (MMSE) detection, as it has
a lower complexity compared to maximum likelihood (ML) detection. A closed-form upper
bound for the system error probability is derived, based on which we prove that the smallest
singular value of the cooperative channel matrix determines the system error performance. Accordingly,
an adaptive modulation and cooperation scheme is proposed, which uses the smallest
singular value as the threshold strategy. Depending on the instantaneous channel conditions,
the system could therefore adapt to choose a suitable modulation type for transmission and an
appropriate quantization rate to perform CF cooperation. The adaptive modulation and cooperation
scheme not only enables the system to achieve comparable performance to the case with
fixed quantization rates, but also eliminates unnecessary complexity for quantization operations
and conference link communication
Distributed Space Time Coding for Wireless Two-way Relaying
We consider the wireless two-way relay channel, in which two-way data
transfer takes place between the end nodes with the help of a relay. For the
Denoise-And-Forward (DNF) protocol, it was shown by Koike-Akino et. al. that
adaptively changing the network coding map used at the relay greatly reduces
the impact of Multiple Access interference at the relay. The harmful effect of
the deep channel fade conditions can be effectively mitigated by proper choice
of these network coding maps at the relay. Alternatively, in this paper we
propose a Distributed Space Time Coding (DSTC) scheme, which effectively
removes most of the deep fade channel conditions at the transmitting nodes
itself without any CSIT and without any need to adaptively change the network
coding map used at the relay. It is shown that the deep fades occur when the
channel fade coefficient vector falls in a finite number of vector subspaces of
, which are referred to as the singular fade subspaces. DSTC
design criterion referred to as the \textit{singularity minimization criterion}
under which the number of such vector subspaces are minimized is obtained.
Also, a criterion to maximize the coding gain of the DSTC is obtained. Explicit
low decoding complexity DSTC designs which satisfy the singularity minimization
criterion and maximize the coding gain for QAM and PSK signal sets are
provided. Simulation results show that at high Signal to Noise Ratio, the DSTC
scheme provides large gains when compared to the conventional Exclusive OR
network code and performs slightly better than the adaptive network coding
scheme proposed by Koike-Akino et. al.Comment: 27 pages, 4 figures, A mistake in the proof of Proposition 3 given in
Appendix B correcte
Noncooperative and Cooperative Transmission Schemes with Precoding and Beamforming
The next generation mobile networks are expected to provide multimedia applications with a high quality of service. On the other hand, interference among multiple base stations (BS) that co-exist in the same location limits the capacity of wireless networks. In conventional wireless networks, the base stations do not cooperate with each other. The BSs transmit individually to their respective mobile stations (MS) and treat the transmission from other BSs as interference. An alternative to this structure is a network cooperation structure. Here, BSs cooperate with other BSs to simultaneously transmit to their respective MSs using the same frequency band at a given time slot. By doing this, we significantly increase the capacity of the networks. This thesis presents novel research results on a noncooperative transmission scheme and a cooperative transmission scheme for multi-user multiple-input-multiple-output orthogonal frequency division multiplexing (MIMO-OFDM). We first consider the performance limit of a noncooperative transmission scheme. Here, we propose a method to reduce the interference and increase the throughput of orthogonal frequency division multiplexing (OFDM) systems in co-working wireless local area networks (WLANs) by using joint adaptive multiple antennas(AMA) and adaptive modulation (AM) with acknowledgement (ACK) Eigen-steering. The calculation of AMA and AM are performed at the receiver. The AMA is used to suppress interference and to maximize the signal-to-interference-plus-noise ratio (SINR). The AM scheme is used to allocate OFDM sub-carriers, power, and modulation mode subject to the constraints of power, discrete modulation, and the bit error rate (BER). The transmit weights, the allocation of power, and the allocation of sub-carriers are obtained at the transmitter using ACK Eigen-steering. The derivations of AMA, AM, and ACK Eigen-steering are shown. The performance of joint AMA and AM for various AMA configurations is evaluated through the simulations of BER and spectral efficiency (SE) against SIR. To improve the performance of the system further, we propose a practical cooperative transmission scheme to mitigate against the interference in co-working WLANs. Here, we consider a network coordination among BSs. We employ Tomlinson Harashima precoding (THP), joint transmit-receive beamforming based on SINR (signal-to-interference-plus-noise-ratio) maximization, and an adaptive precoding order to eliminate co-working interference and achieve bit error rate (BER) fairness among different users. We also consider the design of the system when partial channel state information (CSI) (where each user only knows its own CSI) and full CSI (where each user knows CSI of all users) are available at the receiver respectively. We prove analytically and by simulation that the performance of our proposed scheme will not be degraded under partial CSI. The simulation results show that the proposed scheme considerably outperforms both the existing noncooperative and cooperative transmission schemes. A method to design a spectrally efficient cooperative downlink transmission scheme employing precoding and beamforming is also proposed. The algorithm eliminates the interference and achieves symbol error rate (SER) fairness among different users. To eliminate the interference, Tomlinson Harashima precoding (THP) is used to cancel part of the interference while the transmit-receive antenna weights cancel the remaining one. A new novel iterative method is applied to generate the transmit-receive antenna weights. To achieve SER fairness among different users and further improve the performance of MIMO systems, we develop algorithms that provide equal SINR across all users and order the users so that the minimum SINR for each user is maximized. The simulation results show that the proposed scheme considerably outperforms existing cooperative transmission schemes in terms of the SER performance and complexity and approaches an interference free performance under the same configuration. We could improve the performance of the proposed interference cancellation further. This is because the proposed interference cancellation does not consider receiver noise when calculating the transmit-receive weight antennas. In addition, the proposed scheme mentioned above is designed specifically for a single-stream multi-user transmission. Here, we employ THP precoding and an iterative method based on the uplink-downlink duality principle to generate the transmit-receive antenna weights. The algorithm provides an equal SINR across all users. A simpler method is then proposed by trading off the complexity with a slight performance degradation. The proposed methods are extended to also work when the receiver does not have complete Channel State Informations (CSIs). A new method of setting the user precoding order, which has a much lower complexity than the VBLAST type ordering scheme but with almost the same performance, is also proposed. The simulation results show that the proposed schemes considerably outperform existing cooperative transmission schemes in terms of SER performance and approach an interference free performance. In all the cooperative transmission schemes proposed above, we use THP to cancel part of the interference. In this thesis, we also consider an alternative approach that bypasses the use of THP. The task of cancelling the interference from other users now lies solely within the transmit-receive antenna weights. We consider multiuser Gaussian broadcast channels with multiple antennas at both transmitter and receivers. An iterative multiple beamforming (IMB) algorithm is proposed, which is flexible in the antenna configuration and performs well in low to moderate data rates. Its capacity and bit error rate performance are compared with the ones achieved by the traditional zero-forcing method
Noncooperative and Cooperative Transmission Schemes with Precoding and Beamforming
The next generation mobile networks are expected to provide multimedia applications with a high quality of service. On the other hand, interference among multiple base stations (BS) that co-exist in the same location limits the capacity of wireless networks. In conventional wireless networks, the base stations do not cooperate with each other. The BSs transmit individually to their respective mobile stations (MS) and treat the transmission from other BSs as interference. An alternative to this structure is a network cooperation structure. Here, BSs cooperate with other BSs to simultaneously transmit to their respective MSs using the same frequency band at a given time slot. By doing this, we significantly increase the capacity of the networks. This thesis presents novel research results on a noncooperative transmission scheme and a cooperative transmission scheme for multi-user multiple-input-multiple-output orthogonal frequency division multiplexing (MIMO-OFDM). We first consider the performance limit of a noncooperative transmission scheme. Here, we propose a method to reduce the interference and increase the throughput of orthogonal frequency division multiplexing (OFDM) systems in co-working wireless local area networks (WLANs) by using joint adaptive multiple antennas(AMA) and adaptive modulation (AM) with acknowledgement (ACK) Eigen-steering. The calculation of AMA and AM are performed at the receiver. The AMA is used to suppress interference and to maximize the signal-to-interference-plus-noise ratio (SINR). The AM scheme is used to allocate OFDM sub-carriers, power, and modulation mode subject to the constraints of power, discrete modulation, and the bit error rate (BER). The transmit weights, the allocation of power, and the allocation of sub-carriers are obtained at the transmitter using ACK Eigen-steering. The derivations of AMA, AM, and ACK Eigen-steering are shown. The performance of joint AMA and AM for various AMA configurations is evaluated through the simulations of BER and spectral efficiency (SE) against SIR. To improve the performance of the system further, we propose a practical cooperative transmission scheme to mitigate against the interference in co-working WLANs. Here, we consider a network coordination among BSs. We employ Tomlinson Harashima precoding (THP), joint transmit-receive beamforming based on SINR (signal-to-interference-plus-noise-ratio) maximization, and an adaptive precoding order to eliminate co-working interference and achieve bit error rate (BER) fairness among different users. We also consider the design of the system when partial channel state information (CSI) (where each user only knows its own CSI) and full CSI (where each user knows CSI of all users) are available at the receiver respectively. We prove analytically and by simulation that the performance of our proposed scheme will not be degraded under partial CSI. The simulation results show that the proposed scheme considerably outperforms both the existing noncooperative and cooperative transmission schemes. A method to design a spectrally efficient cooperative downlink transmission scheme employing precoding and beamforming is also proposed. The algorithm eliminates the interference and achieves symbol error rate (SER) fairness among different users. To eliminate the interference, Tomlinson Harashima precoding (THP) is used to cancel part of the interference while the transmit-receive antenna weights cancel the remaining one. A new novel iterative method is applied to generate the transmit-receive antenna weights. To achieve SER fairness among different users and further improve the performance of MIMO systems, we develop algorithms that provide equal SINR across all users and order the users so that the minimum SINR for each user is maximized. The simulation results show that the proposed scheme considerably outperforms existing cooperative transmission schemes in terms of the SER performance and complexity and approaches an interference free performance under the same configuration. We could improve the performance of the proposed interference cancellation further. This is because the proposed interference cancellation does not consider receiver noise when calculating the transmit-receive weight antennas. In addition, the proposed scheme mentioned above is designed specifically for a single-stream multi-user transmission. Here, we employ THP precoding and an iterative method based on the uplink-downlink duality principle to generate the transmit-receive antenna weights. The algorithm provides an equal SINR across all users. A simpler method is then proposed by trading off the complexity with a slight performance degradation. The proposed methods are extended to also work when the receiver does not have complete Channel State Informations (CSIs). A new method of setting the user precoding order, which has a much lower complexity than the VBLAST type ordering scheme but with almost the same performance, is also proposed. The simulation results show that the proposed schemes considerably outperform existing cooperative transmission schemes in terms of SER performance and approach an interference free performance. In all the cooperative transmission schemes proposed above, we use THP to cancel part of the interference. In this thesis, we also consider an alternative approach that bypasses the use of THP. The task of cancelling the interference from other users now lies solely within the transmit-receive antenna weights. We consider multiuser Gaussian broadcast channels with multiple antennas at both transmitter and receivers. An iterative multiple beamforming (IMB) algorithm is proposed, which is flexible in the antenna configuration and performs well in low to moderate data rates. Its capacity and bit error rate performance are compared with the ones achieved by the traditional zero-forcing method
Técnicas de pré-codificação para sistemas multicelulares coordenados
Doutoramento em TelecomunicaçõesCoordenação Multicélula é um tópico de investigação em rápido
crescimento e uma solução promissora para controlar a interferência entre
células em sistemas celulares, melhorando a equidade do sistema e
aumentando a sua capacidade. Esta tecnologia já está em estudo no LTEAdvanced
sob o conceito de coordenação multiponto (COMP). Existem
várias abordagens sobre coordenação multicélula, dependendo da
quantidade e do tipo de informação partilhada pelas estações base, através
da rede de suporte (backhaul network), e do local onde essa informação é
processada, i.e., numa unidade de processamento central ou de uma forma
distribuída em cada estação base.
Nesta tese, são propostas técnicas de pré-codificação e alocação de
potência considerando várias estratégias: centralizada, todo o
processamento é feito na unidade de processamento central; semidistribuída,
neste caso apenas parte do processamento é executado na
unidade de processamento central, nomeadamente a potência alocada a
cada utilizador servido por cada estação base; e distribuída em que o
processamento é feito localmente em cada estação base. Os esquemas
propostos são projectados em duas fases: primeiro são propostas soluções
de pré-codificação para mitigar ou eliminar a interferência entre células,
de seguida o sistema é melhorado através do desenvolvimento de vários
esquemas de alocação de potência. São propostas três esquemas de
alocação de potência centralizada condicionada a cada estação base e com
diferentes relações entre desempenho e complexidade. São também
derivados esquemas de alocação distribuídos, assumindo que um sistema
multicelular pode ser visto como a sobreposição de vários sistemas com
uma única célula. Com base neste conceito foi definido uma taxa de erro
média virtual para cada um desses sistemas de célula única que compõem
o sistema multicelular, permitindo assim projectar esquemas de alocação
de potência completamente distribuídos.
Todos os esquemas propostos foram avaliados em cenários realistas,
bastante próximos dos considerados no LTE. Os resultados mostram que
os esquemas propostos são eficientes a remover a interferência entre
células e que o desempenho das técnicas de alocação de potência
propostas é claramente superior ao caso de não alocação de potência. O
desempenho dos sistemas completamente distribuídos é inferior aos
baseados num processamento centralizado, mas em contrapartida podem
ser usados em sistemas em que a rede de suporte não permita a troca de
grandes quantidades de informação.Multicell coordination is a promising solution for cellular wireless systems
to mitigate inter-cell interference, improving system fairness and
increasing capacity and thus is already under study in LTE-A under the
coordinated multipoint (CoMP) concept. There are several coordinated
transmission approaches depending on the amount of information shared
by the transmitters through the backhaul network and where the
processing takes place i.e. in a central processing unit or in a distributed
way on each base station.
In this thesis, we propose joint precoding and power allocation techniques
considering different strategies: Full-centralized, where all the processing
takes place at the central unit; Semi-distributed, in this case only some
process related with power allocation is done at the central unit; and Fulldistributed,
where all the processing is done locally at each base station.
The methods are designed in two phases: first the inter-cell interference is
removed by applying a set of centralized or distributed precoding vectors;
then the system is further optimized by centralized or distributed power
allocation schemes. Three centralized power allocation algorithms with
per-BS power constraint and different complexity tradeoffs are proposed.
Also distributed power allocation schemes are proposed by considering
the multicell system as superposition of single cell systems, where we
define the average virtual bit error rate (BER) of interference-free single
cell system, allowing us to compute the power allocation coefficients in a
distributed manner at each BS.
All proposed schemes are evaluated in realistic scenarios considering LTE
specifications. The numerical evaluations show that the proposed schemes
are efficient in removing inter-cell interference and improve system
performance comparing to equal power allocation. Furthermore, fulldistributed
schemes can be used when the amounts of information to be
exchanged over the backhaul is restricted, although system performance is
slightly degraded from semi-distributed and full-centralized schemes, but
the complexity is considerably lower. Besides that for high degrees of
freedom distributed schemes show similar behaviour to centralized ones
Mathematical optimization techniques for resource allocation and spatial multiplexing in spectrum sharing networks
Due to introduction of smart phones with data intensive multimedia and interactive applications and exponential growth of wireless devices, there is a shortage for useful radio spectrum. Even though the spectrum has become crowded, many spectrum occupancy measurements indicate that most of the allocated spectrum is underutilised. Hence radically new approaches in terms of allocation of wireless resources are required for better utilization of radio spectrum.
This has motivated the concept of opportunistic spectrum sharing or
the so-called cognitive radio technology that has great potential to improve spectrum utilization. The cognitive radio technology allows an opportunistic
user namely the secondary user to access the spectrum of the licensed user (known as primary user) provided that the secondary transmission does not harmfully affect the primary user. This is possible with the introduction
of advanced resource allocation techniques together with the use of wireless relays and spatial diversity techniques.
In this thesis, various mathematical optimization techniques have been developed for the efficient use of radio spectrum within the context of spectrum sharing networks. In particular, optimal power allocation techniques and centralised and distributed beamforming techniques have been developed. Initially, an optimization technique for subcarrier and power allocation
has been proposed for an Orthogonal Frequency Division Multiple Access (OFDMA) based secondary wireless network in the presence of multiple primary users. The solution is based on integer linear programming with
multiple interference leakage and transmission power constraints. In order to enhance the spectrum efficiency further, the work has been extended to allow multiple secondary users to occupy the same frequency band under a multiple-input and multiple-output (MIMO) framework. A sum rate maximization technique based on uplink-downlink duality and dirty paper coding has been developed for the MIMO based OFDMA network. The work has
also been extended to handle fading scenarios based on maximization of ergodic capacity. The optimization techniques for MIMO network has been extended to a spectrum sharing network with relays. This has the advantage
of extending the coverage of the secondary network and assisting the primary network in return for the use of the primary spectrum. Finally, instead of considering interference mitigation, the recently emerged concept of
interference alignment has been used for the resource allocation in spectrum sharing networks. The performances of all these new algorithms have been demonstrated using MATLAB based simulation studies
Resource allocation and optimization techniques in wireless relay networks
Relay techniques have the potential to enhance capacity and coverage of a wireless network. Due to rapidly increasing number of smart phone subscribers and high demand for data intensive multimedia applications, the
useful radio spectrum is becoming a scarce resource. For this reason, two way relay network and cognitive radio technologies are required for better utilization of radio spectrum. Compared to the conventional one way relay
network, both the uplink and the downlink can be served simultaneously using a two way relay network. Hence the effective bandwidth efficiency is considered to be one time slot per transmission. Cognitive networks are wireless networks that consist of different types of users, a primary user (PU, the primary license holder of a spectrum band) and secondary users (SU, cognitive radios that opportunistically access the PU spectrum). The
secondary users can access the spectrum of the licensed user provided they do not harmfully affect to the primary user. In this thesis, various resource
allocation and optimization techniques have been investigated for wireless relay and cognitive radio networks
Signal design for Multiple-Antenna Systems and Wireless Networks
This dissertation is concerned with the signal design problems for Multiple Input and Multiple Output (MIMO) antenna systems and wireless networks. Three related but distinct problems are considered.The first problem considered is the design of space time codes for MIMO systems in the case when neither the transmitter nor the receiver knows the channel. We present the theoretical concept of communicating over block fading channel using Layered Unitary Space Time Codes (LUSTC), where the input signal is formed as a product of a series of unitary matrices with corresponding dimensionality. We show the channel capacity using isotropically distributed (i.d.) input signaling and optimal decoding can be achieved by layered i.d. signaling scheme along with a low complexity successive decoding. The closed form layered channel capacity is obtained, which serves as a design guideline for practical LUSTC. In the design of LUSTC, a successive design method is applied to leverage the problem of optimizing over lots of parameters.The feedback of channel state information (CSI) to the transmitter in MIMO systems is known to increase the forward channel capacity. A suboptimal power allocation scheme for MIMO systems is then proposed for limited rate feedback of CSI. We find that the capacity loss of this simple scheme is rather small compared to the optimal water-filling solution. This knowledge is applied for the design of the feedback codebook. In the codebook design, a generalized Lloyd algorithm is employed, in which the computation of the centroid is formulated as an optimization problem and solved optimally. Numerical results show that the proposed codebook design outperforms the existing algorithms in the literature.While it is not feasible to deploy multiple antennas in a wireless node due to the space limitation, user cooperation is an alternative to increase performance of the wireless networks. To this end, a coded user cooperation scheme is considered in the dissertation, which is shown to be equivalent to a coding scheme with the encoding done in a distributive manner. Utilizing the coding theoretic bound and simulation results, we show that the coded user cooperation scheme has great advantage over the non-cooperative scheme
Security versus Reliability Analysis of Opportunistic Relaying
Physical-layer security is emerging as a promising paradigm of securing
wireless communications against eavesdropping between legitimate users, when
the main link spanning from source to destination has better propagation
conditions than the wiretap link from source to eavesdropper. In this paper, we
identify and analyze the tradeoffs between the security and reliability of
wireless communications in the presence of eavesdropping attacks. Typically,
the reliability of the main link can be improved by increasing the source's
transmit power (or decreasing its date rate) to reduce the outage probability,
which unfortunately increases the risk that an eavesdropper succeeds in
intercepting the source message through the wiretap link, since the outage
probability of the wiretap link also decreases when a higher transmit power (or
lower date rate) is used. We characterize the security-reliability tradeoffs
(SRT) of conventional direct transmission from source to destination in the
presence of an eavesdropper, where the security and reliability are quantified
in terms of the intercept probability by an eavesdropper and the outage
probability experienced at the destination, respectively. In order to improve
the SRT, we then propose opportunistic relay selection (ORS) and quantify the
attainable SRT improvement upon increasing the number of relays. It is shown
that given the maximum tolerable intercept probability, the outage probability
of our ORS scheme approaches zero for , where is the number
of relays. Conversely, given the maximum tolerable outage probability, the
intercept probability of our ORS scheme tends to zero for .Comment: 9 pages. IEEE Transactions on Vehicular Technology, 201
Optimality Properties, Distributed Strategies, and Measurement-Based Evaluation of Coordinated Multicell OFDMA Transmission
The throughput of multicell systems is inherently limited by interference and
the available communication resources. Coordinated resource allocation is the
key to efficient performance, but the demand on backhaul signaling and
computational resources grows rapidly with number of cells, terminals, and
subcarriers. To handle this, we propose a novel multicell framework with
dynamic cooperation clusters where each terminal is jointly served by a small
set of base stations. Each base station coordinates interference to neighboring
terminals only, thus limiting backhaul signalling and making the framework
scalable. This framework can describe anything from interference channels to
ideal joint multicell transmission.
The resource allocation (i.e., precoding and scheduling) is formulated as an
optimization problem (P1) with performance described by arbitrary monotonic
functions of the signal-to-interference-and-noise ratios (SINRs) and arbitrary
linear power constraints. Although (P1) is non-convex and difficult to solve
optimally, we are able to prove: 1) Optimality of single-stream beamforming; 2)
Conditions for full power usage; and 3) A precoding parametrization based on a
few parameters between zero and one. These optimality properties are used to
propose low-complexity strategies: both a centralized scheme and a distributed
version that only requires local channel knowledge and processing. We evaluate
the performance on measured multicell channels and observe that the proposed
strategies achieve close-to-optimal performance among centralized and
distributed solutions, respectively. In addition, we show that multicell
interference coordination can give substantial improvements in sum performance,
but that joint transmission is very sensitive to synchronization errors and
that some terminals can experience performance degradations.Comment: Published in IEEE Transactions on Signal Processing, 15 pages, 7
figures. This version corrects typos related to Eq. (4) and Eq. (28
- …