Low-Complexity GSVD-Based Beamforming and Power Allocation for a Cognitive Radio Network

Cited 6 time in webofscience Cited 0 time in scopus
  • Hit : 368
  • Download : 0
In this paper, low-complexity generalized singular value decomposition (GSVD) based beamforming schemes are proposed for a cognitive radio (CR) network in which multiple secondary users (SUs) with multiple antennas coexist with multiple primary users (PUs). In general, optimal beamforming, which suppresses the interference caused at PUs to below a certain threshold and maximizes the signal-to-interference-plus-noise ratios (SINRs) of multiple SUs simultaneously, requires a complicated iterative optimization process. To overcome the computational complexity, we introduce a signal-to-leakage-plus-noise ratio (SLNR) maximizing beamforming scheme in which the weight can be obtained by using the GSVD algorithm, and does not require any iterations or matrix squaring operations. Here, to satisfy the leakage constraints at PUs, two linear methods, zero forcing (ZF) preprocessing and power allocation, are proposed.
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
Issue Date
2012-11
Language
English
Article Type
Article
Keywords

CHANNELS; ACCESS

Citation

IEICE TRANSACTIONS ON COMMUNICATIONS, v.E95B, no.11, pp.3536 - 3544

ISSN
0916-8516
DOI
10.1587/transcom.E95.B.3536
URI
http://hdl.handle.net/10203/103472
Appears in Collection
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 6 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0