Cooperative MIMO relay beamforming in overloaded DS/CDMA multicast networks

A new beamforming scheme is proposed for multi-input multi-output (MIMO) non-regenerative relays in an overloaded synchronous direct sequence code division multiple access (DS-CDMA) network in which the number of users is larger than the processing gain. In this scheme, several transmitters multicas...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IET communications Ročník 11; číslo 3; s. 344 - 354
Hlavní autori:	Mehrizi, Sajad, Mahboobi, Behrad
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	The Institution of Engineering and Technology 16.02.2017
Predmet:	antenna number array signal processing Beamforming code division multiple access computational complexity concave programming cooperative communication cooperative MIMO relay beamforming DC programming method difference‐of‐two convex functions direct sequence code division multiple access network indefinite quadratic programming Interference MIMO communication MIMO‐CDMA scheme Multicast multiinput multioutput nonregenerative relays multiple‐access interference Networks nonconvex programming optimisation problem overloaded synchronous DS‐CDMA multicast networks Programming radiofrequency interference Receivers Relay relay networks (telecommunication) SDP SINR constraint SOCP spread spectrum communication total relay transmission power minimization Transmitters nonconvex programming spread spectrum communication optimisation problem radiofrequency interference SINR constraint multiinput multioutput nonregenerative relays difference-of-two convex functions total relay transmission power minimization MIMO communication concave programming SDP relay networks (telecommunication) array signal processing overloaded synchronous DS-CDMA multicast networks DC programming method code division multiple access multiple-access interference cooperative communication direct sequence code division multiple access network SOCP cooperative MIMO relay beamforming MIMO-CDMA scheme indefinite quadratic programming antenna number computational complexity
ISSN:	1751-8628, 1751-8636
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!