File Download
Supplementary
-
Citations:
- Appears in Collections:
postgraduate thesis: Probabilistic quality-of-service constrained robust transceiver designin multiple antenna systems
Title | Probabilistic quality-of-service constrained robust transceiver designin multiple antenna systems |
---|---|
Authors | |
Advisors | Advisor(s):Wu, YC |
Issue Date | 2012 |
Publisher | The University of Hong Kong (Pokfulam, Hong Kong) |
Citation | He, X. [何鑫]. (2012). Probabilistic quality-of-service constrained robust transceiver design in multiple antenna systems. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4819952 |
Abstract | In downlink multi-user multiple-input multiple-output (MU-MIMO)
systems, different users, even multiple data streams serving one user,
might require different quality-of-services (QoS). The transceiver should
allocate resources to different users aiming at satisfying their QoS
requirements. In order to design the optimal transceiver, channel
state information is necessary. In practice, channel state information
has to to be estimated, and estimation error is unavoidable. Therefore,
robust transceiver design, which takes the channel estimation
uncertainty into consideration, is important. For the previous robust
transceiver designs, bounded estimation errors or Gaussian estimation
errors were assumed. However, if there exists unknown distributed interference,
the distribution of the channel estimation error cannot be
modeled accurately a priori. Therefore, in this thesis, we investigate
the robust transceiver design problem in downlink MU-MIMO system
under probabilistic QoS constraints with arbitrary distributed channel
estimation error.
To tackle the probabilistic QoS constraints under arbitrary distributed
channel estimation error, the transceiver design problem is expressed
in terms of worst-case probabilistic constraints. Two methods are
then proposed to solve the worst-case problem. Firstly, the Chebyshev
inequality based method is proposed. After the worst-case probabilistic
constraint is approximated by the Chebyshev inequality, an
iteration between two convex subproblems is proposed to solve the
approximated problem. The convergence of the iterative method is
proved, the implementation issues and the computational complexity
are discussed.
Secondly, in order to solve the worst-case probabilistic constraint more
accurately, a novel duality method is proposed. After a series of reformulations
based on duality and S-Lemma, the worst-case statistically
constrained problem is transformed into a deterministic finite
constrained problem, with strong duality guaranteed. The resulting
problem is then solved by a convergence-guaranteed iteration between
two subproblems. Although one of the subproblems is still nonconvex,
it can be solved by a tight semidefinite relaxation (SDR).
Simulation results show that, compared to the non-robust method, the
QoS requirement is satisfied by both proposed algorithms. Furthermore,
among the two proposed methods, the duality method shows a
superior performance in transmit power, while the Chebyshev method
demonstrates a lower computational complexity. |
Degree | Master of Philosophy |
Subject | MIMO systems - Mathematical models. Radio - Transmitter-receivers - Design and construction. Probabilities. |
Dept/Program | Electrical and Electronic Engineering |
Persistent Identifier | http://hdl.handle.net/10722/167228 |
HKU Library Item ID | b4819952 |
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Wu, YC | - |
dc.contributor.author | He, Xin | - |
dc.contributor.author | 何鑫 | - |
dc.date.issued | 2012 | - |
dc.identifier.citation | He, X. [何鑫]. (2012). Probabilistic quality-of-service constrained robust transceiver design in multiple antenna systems. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4819952 | - |
dc.identifier.uri | http://hdl.handle.net/10722/167228 | - |
dc.description.abstract | In downlink multi-user multiple-input multiple-output (MU-MIMO) systems, different users, even multiple data streams serving one user, might require different quality-of-services (QoS). The transceiver should allocate resources to different users aiming at satisfying their QoS requirements. In order to design the optimal transceiver, channel state information is necessary. In practice, channel state information has to to be estimated, and estimation error is unavoidable. Therefore, robust transceiver design, which takes the channel estimation uncertainty into consideration, is important. For the previous robust transceiver designs, bounded estimation errors or Gaussian estimation errors were assumed. However, if there exists unknown distributed interference, the distribution of the channel estimation error cannot be modeled accurately a priori. Therefore, in this thesis, we investigate the robust transceiver design problem in downlink MU-MIMO system under probabilistic QoS constraints with arbitrary distributed channel estimation error. To tackle the probabilistic QoS constraints under arbitrary distributed channel estimation error, the transceiver design problem is expressed in terms of worst-case probabilistic constraints. Two methods are then proposed to solve the worst-case problem. Firstly, the Chebyshev inequality based method is proposed. After the worst-case probabilistic constraint is approximated by the Chebyshev inequality, an iteration between two convex subproblems is proposed to solve the approximated problem. The convergence of the iterative method is proved, the implementation issues and the computational complexity are discussed. Secondly, in order to solve the worst-case probabilistic constraint more accurately, a novel duality method is proposed. After a series of reformulations based on duality and S-Lemma, the worst-case statistically constrained problem is transformed into a deterministic finite constrained problem, with strong duality guaranteed. The resulting problem is then solved by a convergence-guaranteed iteration between two subproblems. Although one of the subproblems is still nonconvex, it can be solved by a tight semidefinite relaxation (SDR). Simulation results show that, compared to the non-robust method, the QoS requirement is satisfied by both proposed algorithms. Furthermore, among the two proposed methods, the duality method shows a superior performance in transmit power, while the Chebyshev method demonstrates a lower computational complexity. | - |
dc.language | eng | - |
dc.publisher | The University of Hong Kong (Pokfulam, Hong Kong) | - |
dc.relation.ispartof | HKU Theses Online (HKUTO) | - |
dc.rights | The author retains all proprietary rights, (such as patent rights) and the right to use in future works. | - |
dc.rights | This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. | - |
dc.source.uri | http://hub.hku.hk/bib/B48199527 | - |
dc.subject.lcsh | MIMO systems - Mathematical models. | - |
dc.subject.lcsh | Radio - Transmitter-receivers - Design and construction. | - |
dc.subject.lcsh | Probabilities. | - |
dc.title | Probabilistic quality-of-service constrained robust transceiver designin multiple antenna systems | - |
dc.type | PG_Thesis | - |
dc.identifier.hkul | b4819952 | - |
dc.description.thesisname | Master of Philosophy | - |
dc.description.thesislevel | Master | - |
dc.description.thesisdiscipline | Electrical and Electronic Engineering | - |
dc.description.nature | published_or_final_version | - |
dc.identifier.doi | 10.5353/th_b4819952 | - |
dc.date.hkucongregation | 2012 | - |
dc.identifier.mmsid | 991033762219703414 | - |