Space‐Time Processing for MIMO Communications 2005
DOI: 10.1002/0470010045.ch8
|View full text |Cite
|
Sign up to set email alerts
|

Convex Optimization Theory Applied to Joint Transmitter‐Receiver Design in MIMO Channels

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2006
2006
2012
2012

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(19 citation statements)
references
References 84 publications
0
19
0
Order By: Relevance
“…The results are derived without using the existing optimal solutions. For a given symbol error rate constraint and target bit rate , the power-minimizing problem A with real bit allocation can be formulated as [11]- [17] A minimize subject to (7) where is the symbol error rate of the th subchannel and is the set of nonnegative real numbers. Given a symbol error rate constraint and power constraint , the rate-maximizing problem A with real bit allocation is [19]- [22] A maximize subject to (8) In either problem, we need to design the transmit matrix and bit allocation jointly to maximize bit rate or minimize power.…”
Section: Power-minimizing and Rate-maximizing Problems With Non-mentioning
confidence: 99%
See 4 more Smart Citations
“…The results are derived without using the existing optimal solutions. For a given symbol error rate constraint and target bit rate , the power-minimizing problem A with real bit allocation can be formulated as [11]- [17] A minimize subject to (7) where is the symbol error rate of the th subchannel and is the set of nonnegative real numbers. Given a symbol error rate constraint and power constraint , the rate-maximizing problem A with real bit allocation is [19]- [22] A maximize subject to (8) In either problem, we need to design the transmit matrix and bit allocation jointly to maximize bit rate or minimize power.…”
Section: Power-minimizing and Rate-maximizing Problems With Non-mentioning
confidence: 99%
“…3) When the error rate is constrained to be equal to for all subchannels, it has been shown that equality in the power and bit rate constraints will hold [17], [22], [25] using majorization theorem [41] and optimization theorem [42]. Lemma 3 is more general in that we have considered inequality constraint on the error rate in addition to power and bit rate constraints.…”
Section: ) Lemma 3 Shows That All the Inequalities In Constraints Ofmentioning
confidence: 99%
See 3 more Smart Citations