Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems Based on Game Theory-Part II: Algorithms

In this two-part paper, we address the problem of finding the optimal precoding/multiplexing scheme for a set of noncooperative links sharing the same physical resources, e.g., time and bandwidth. We consider two alternative optimization problems: P.l) the maximization of mutual information on each...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on signal processing Ročník 56; číslo 3; s. 1250 - 1267
Hlavní autoři: Scutari, G., Palomar, D.P., Barbarossa, S.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.03.2008
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:1053-587X, 1941-0476
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract In this two-part paper, we address the problem of finding the optimal precoding/multiplexing scheme for a set of noncooperative links sharing the same physical resources, e.g., time and bandwidth. We consider two alternative optimization problems: P.l) the maximization of mutual information on each link, given constraints on the transmit power and spectral mask; and P.2) the maximization of the transmission rate on each link, using finite-order constellations, under the same constraints as in P.l, plus a constraint on the maximum average error probability on each link. Aiming at finding decentralized strategies, we adopted as optimality criterion the achievement of a Nash equilibrium and thus we formulated both problems P.l and P.2 as strategic noncooperative (matrix-valued) games. In Part I of this two-part paper, after deriving the optimal structure of the linear transceivers for both games, we provided a unified set of sufficient conditions that guarantee the uniqueness of the Nash equilibrium. In this Part II of the paper, we focus on the achievement of the equilibrium and propose alternative distributed iterative algorithms that solve both games. Specifically, the new proposed algorithms are the following: 1) the sequential and simultaneous iterative waterfilling-based algorithms, incorporating spectral mask constraints and 2) the sequential and simultaneous gradient-projection-based algorithms, establishing an interesting link with variational inequality problems. Our main contribution is to provide sufficient conditions for the global convergence of all the proposed algorithms which, although derived under stronger constraints, incorporating for example spectral mask constraints, have a broader validity than the convergence conditions known in the current literature for the sequential iterative waterfilling algorithm.
AbstractList In this two-part paper, we address the problem of finding the optimal precoding/multiplexing scheme for a set of noncooperative links sharing the same physical resources, e.g., time and bandwidth. We consider two alternative optimization problems: P.l) the maximization of mutual information on each link, given constraints on the transmit power and spectral mask; and P.2) the maximization of the transmission rate on each link, using finite-order constellations, under the same constraints as in P.l, plus a constraint on the maximum average error probability on each link. Aiming at finding decentralized strategies, we adopted as optimality criterion the achievement of a Nash equilibrium and thus we formulated both problems P.l and P.2 as strategic noncooperative (matrix-valued) games. In Part I of this two-part paper, after deriving the optimal structure of the linear transceivers for both games, we provided a unified set of sufficient conditions that guarantee the uniqueness of the Nash equilibrium. In this Part II of the paper, we focus on the achievement of the equilibrium and propose alternative distributed iterative algorithms that solve both games. Specifically, the new proposed algorithms are the following: 1) the sequential and simultaneous iterative waterfilling-based algorithms, incorporating spectral mask constraints and 2) the sequential and simultaneous gradient-projection-based algorithms, establishing an interesting link with variational inequality problems. Our main contribution is to provide sufficient conditions for the global convergence of all the proposed algorithms which, although derived under stronger constraints, incorporating for example spectral mask constraints, have a broader validity than the convergence conditions known in the current literature for the sequential iterative waterfilling algorithm.
P.l the maximization of mutual information on each link, given constraints on the transmit power and spectral mask; and P.2 the maximization of the transmission rate on each link, using finite-order constellations, under the same constraints as in P.l, plus a constraint on the maximum average error probability on each link.
Author Scutari, G.
Barbarossa, S.
Palomar, D.P.
Author_xml – sequence: 1
  givenname: G.
  surname: Scutari
  fullname: Scutari, G.
  organization: Univ. of Rome, Rome
– sequence: 2
  givenname: D.P.
  surname: Palomar
  fullname: Palomar, D.P.
– sequence: 3
  givenname: S.
  surname: Barbarossa
  fullname: Barbarossa, S.
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=21033222$$DView record in Pascal Francis
BookMark eNp9kU1rGzEURUVJoUnadRbdiEK7G0efM6PuUpOmBtMY7NLshEbzxlGYkRxJDvjfV8Ehiyy6kuCdqyveOUMnPnhA6IKSGaVEXW7WqxkjpJkp0rSkfYdOqRK0IqKpT8qdSF7Jtrn7gM5SeiCECqHqU_R4u8tuMiNeOg8m4lUEG3rnt3ido8mwdZDwECL-63rojO_x7-CreQg7KGP3BHh9SBmmhH-YBD0OHt-YCfDmHkI8VCsTM14svuOrcRuiy_dT-ojeD2ZM8OnlPEd_fl5v5r-q5e3NYn61rCwXKlfGcglDR7uODKRRYMhgDaul7K2SzcB7y8B0ojdlWEPDZCutUVQ0nDEpWuDn6Nvx3V0Mj3tIWU8uWRhH4yHsky4tTJBWFvDLG_Ah7KMvf9NtzUsl5aJAX18gk6wZh2i8dUnvYllePGhGCS_FrHCXR87GkFKE4RWhRD970sWTfvakj55KQr5JWJfLaoMvAtz4n9znY84BwGuLEJIyVfN_tsShfg
CODEN ITPRED
CitedBy_id crossref_primary_10_1109_ACCESS_2020_2970914
crossref_primary_10_1109_TSP_2009_2032039
crossref_primary_10_1049_iet_com_2013_0463
crossref_primary_10_1155_2009_295739
crossref_primary_10_1109_TIT_2008_2011433
crossref_primary_10_1109_TSP_2020_2983284
crossref_primary_10_1109_TCCN_2017_2707387
crossref_primary_10_1109_TWC_2012_120412_112001
crossref_primary_10_1109_TWC_2013_060413_121158
crossref_primary_10_1109_TSP_2015_2452231
crossref_primary_10_1109_TIT_2008_926399
crossref_primary_10_1109_MCOM_2011_5978427
crossref_primary_10_1109_TCOMM_2012_051712_110066
crossref_primary_10_1109_TWC_2014_2318719
crossref_primary_10_1007_s11277_014_2261_6
crossref_primary_10_31799_1684_8853_2019_1_65_75
crossref_primary_10_31799_1684_8853_2018_6_82_94
crossref_primary_10_1109_TWC_2018_2867474
crossref_primary_10_1109_TSP_2011_2121063
crossref_primary_10_1109_LWC_2014_2387833
crossref_primary_10_1109_TSP_2020_3029983
crossref_primary_10_1109_TVT_2013_2278920
crossref_primary_10_31799_1684_8853_2018_4_86_104
crossref_primary_10_1137_20M135474X
crossref_primary_10_1109_TWC_2010_06_090271
crossref_primary_10_1109_LCSYS_2017_2716190
crossref_primary_10_1109_MSP_2008_929297
crossref_primary_10_1109_TIT_2008_924723
crossref_primary_10_1109_MSP_2009_933446
crossref_primary_10_1109_TSP_2010_2062178
crossref_primary_10_1109_JOE_2017_2731060
crossref_primary_10_1186_s13634_016_0428_x
crossref_primary_10_1109_JSAC_2014_2369615
crossref_primary_10_1109_ACCESS_2018_2823898
crossref_primary_10_1017_S0269964816000127
crossref_primary_10_1109_TSP_2011_2173337
crossref_primary_10_1049_iet_com_2010_0585
crossref_primary_10_1109_TWC_2013_010214_130724
crossref_primary_10_1109_TSP_2010_2052044
crossref_primary_10_1109_TVT_2011_2171011
crossref_primary_10_1109_TSP_2007_907807
crossref_primary_10_1145_2489253_2489261
crossref_primary_10_1016_j_phycom_2012_05_009
crossref_primary_10_1109_TSP_2013_2259162
crossref_primary_10_1109_TCOMM_2014_2382095
crossref_primary_10_1186_1687_1499_2013_15
crossref_primary_10_1186_s13638_016_0594_4
crossref_primary_10_1109_TSP_2009_2013894
crossref_primary_10_1155_2009_354890
crossref_primary_10_1109_TCOMM_2012_091312_110334
crossref_primary_10_1109_TSP_2010_2092773
crossref_primary_10_1109_COMST_2017_2690866
crossref_primary_10_1109_TWC_2014_2384510
crossref_primary_10_1186_1687_1499_2011_79
crossref_primary_10_1109_TSP_2011_2135347
crossref_primary_10_1049_iet_com_2010_0277
crossref_primary_10_1109_LWC_2015_2496954
crossref_primary_10_1109_JSAC_2008_080907
crossref_primary_10_1109_TWC_2015_2456055
crossref_primary_10_1007_s11277_014_1818_8
crossref_primary_10_1016_j_trc_2018_09_019
crossref_primary_10_1109_TSP_2011_2165059
crossref_primary_10_1109_TVT_2013_2284344
crossref_primary_10_1109_TWC_2014_042314_130981
crossref_primary_10_1109_TSP_2011_2113341
crossref_primary_10_1109_TSP_2010_2043138
crossref_primary_10_1109_TCOMM_2012_022912_110277
Cites_doi 10.1109/98.683739
10.1109/DYSPAN.2005.1542641
10.1109/TCOMM.2004.833140
10.1109/26.634685
10.1017/CBO9780511807213
10.1109/TNET.2003.810314
10.1109/78.771047
10.1109/TIT.2005.850045
10.1017/CBO9780511810817
10.1109/TSP.2005.859241
10.1109/JSAC.2002.1007390
10.1109/78.995090
10.1007/978-94-009-8177-5
10.1023/A:1019108223561
10.1109/JRPROC.1949.232969
10.1109/18.6015
10.1109/TSP.2004.840816
10.1109/49.414651
10.1109/TSP.2005.855087
10.1155/ASP/2006/24012
10.1002/0471200611
10.1109/25.260747
10.1137/1.9780898719468
10.1109/ICASSP.2004.1326891
10.1080/1055678042000218975
10.1016/0893-9659(89)90014-1
10.1109/ISIT.2003.1228331
10.1109/ISIT.2006.261855
10.1109/TIT.2008.924723
10.1109/26.983324
10.1109/TAC.2007.910665
10.1145/318789.318894
10.1109/SPAWC.2003.1318944
10.1109/WIOPT.2005.41
10.1109/26.662641
ContentType Journal Article
Copyright 2009 INIST-CNRS
Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2008
Copyright_xml – notice: 2009 INIST-CNRS
– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2008
DBID 97E
RIA
RIE
AAYXX
CITATION
IQODW
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
F28
FR3
DOI 10.1109/TSP.2007.907808
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Pascal-Francis
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList
Technology Research Database
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Applied Sciences
EISSN 1941-0476
EndPage 1267
ExternalDocumentID 2328864651
21033222
10_1109_TSP_2007_907808
4451296
Genre orig-research
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
53G
5GY
5VS
6IK
85S
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACIWK
ACKIV
ACNCT
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AJQPL
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
E.L
EBS
EJD
F5P
HZ~
H~9
ICLAB
IFIPE
IFJZH
IPLJI
JAVBF
LAI
MS~
O9-
OCL
P2P
RIA
RIE
RNS
TAE
TN5
VH1
AAYXX
CITATION
IQODW
RIG
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
F28
FR3
ID FETCH-LOGICAL-c349t-ac35efb1bb0f079ea0fca2655dc957f3dc2eab4da0796e72585ca9147322548e3
IEDL.DBID RIE
ISICitedReferencesCount 113
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000253358400030&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1053-587X
IngestDate Sat Sep 27 19:48:30 EDT 2025
Wed Oct 15 13:14:38 EDT 2025
Mon Jul 21 09:17:02 EDT 2025
Tue Nov 18 22:20:44 EST 2025
Sat Nov 29 02:31:05 EST 2025
Tue Aug 26 16:47:34 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords Multiplexing
Error probability
Nash equilibrium
Iterative method
Optimization
Transceiver
Optimal strategy
Wide band
iterative waterfilling
Coding
Sequential method
Optimal planning
Gradient method
Competitive optimality
Cooperative systems
Game theory
Sufficient condition
Decentralized system
distributed algorithms
Distributed algorithm
Signal processing
Optimality criterion
Transmission rate
Mutual information
Power spectrum
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c349t-ac35efb1bb0f079ea0fca2655dc957f3dc2eab4da0796e72585ca9147322548e3
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
PQID 863265134
PQPubID 85478
PageCount 18
ParticipantIDs proquest_journals_863265134
ieee_primary_4451296
pascalfrancis_primary_21033222
crossref_citationtrail_10_1109_TSP_2007_907808
crossref_primary_10_1109_TSP_2007_907808
proquest_miscellaneous_34924085
PublicationCentury 2000
PublicationDate 2008-03-01
PublicationDateYYYYMMDD 2008-03-01
PublicationDate_xml – month: 03
  year: 2008
  text: 2008-03-01
  day: 01
PublicationDecade 2000
PublicationPlace New York, NY
PublicationPlace_xml – name: New York, NY
– name: New York
PublicationTitle IEEE transactions on signal processing
PublicationTitleAbbrev TSP
PublicationYear 2008
Publisher IEEE
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: Institute of Electrical and Electronics Engineers
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
nagurney (ref32) 1999
ref12
ref15
boyd (ref45) 2003
ref11
ref10
alpcan (ref14) 1998; 3
ref17
bertsekas (ref3) 1989
ref16
scutari (ref1) 2008; 56
ref50
ref46
ref48
ref42
ref41
ref44
ref43
facchinei (ref30) 2000
proakis (ref34) 1995
ref49
ref8
ref9
ref4
ref6
ref5
ref40
bazaraa (ref47) 1993
ref35
cottle (ref31) 1992
ref37
ref36
ref33
ref39
ref38
mitra (ref7) 1993
scutari (ref28) 2004
chiang (ref18) 2005; 5
ref24
ref23
ref26
ref25
ref20
ref22
ref21
ref27
ref29
boyd (ref19) 2005
osborne (ref2) 1994
References_xml – volume: 3
  start-page: 1427
  year: 1998
  ident: ref14
  article-title: CDMA uplink power control as a non-cooperative game
  publication-title: Proc IEEE Int Symp Personal Indoor and Mobile Radio Communications (PIMRC)
– volume: 56
  year: 2008
  ident: ref1
  article-title: Optimal linear precoding strategies for non-cooperative systems based on game theory-Part I: Nash equilibria
  publication-title: IEEE Trans Signal Process
– ident: ref13
  doi: 10.1109/98.683739
– ident: ref26
  doi: 10.1109/DYSPAN.2005.1542641
– ident: ref10
  doi: 10.1109/TCOMM.2004.833140
– ident: ref39
  doi: 10.1109/26.634685
– ident: ref38
  doi: 10.1017/CBO9780511807213
– year: 1999
  ident: ref32
  publication-title: Network Economics A Variational Inequality Approach
– ident: ref17
  doi: 10.1109/TNET.2003.810314
– ident: ref4
  doi: 10.1109/78.771047
– ident: ref11
  doi: 10.1109/TIT.2005.850045
– ident: ref44
  doi: 10.1017/CBO9780511810817
– ident: ref5
  doi: 10.1109/TSP.2005.859241
– ident: ref21
  doi: 10.1109/JSAC.2002.1007390
– ident: ref40
  doi: 10.1109/78.995090
– year: 1989
  ident: ref3
  publication-title: Parallel and Distributed Computation Numerical Methods
– ident: ref46
  doi: 10.1109/TSP.2005.859241
– ident: ref48
  doi: 10.1007/978-94-009-8177-5
– year: 2000
  ident: ref30
  publication-title: Finite-Dimensional Variational Inequalities and Complementarity Problems
– ident: ref12
  doi: 10.1023/A:1019108223561
– year: 1992
  ident: ref31
  publication-title: The Linear Complementarity Problem
– ident: ref33
  doi: 10.1109/JRPROC.1949.232969
– year: 2005
  ident: ref19
  publication-title: ?A tutorial on geometric programming ?
– volume: 5
  start-page: 289
  year: 2005
  ident: ref18
  publication-title: Resource Allocation in Next Generation Wireless Networks
– ident: ref36
  doi: 10.1109/18.6015
– ident: ref50
  doi: 10.1109/TSP.2004.840816
– ident: ref9
  doi: 10.1109/49.414651
– year: 1994
  ident: ref2
  publication-title: A Course in Game Theory
– ident: ref6
  doi: 10.1109/TSP.2005.855087
– ident: ref27
  doi: 10.1155/ASP/2006/24012
– ident: ref35
  doi: 10.1002/0471200611
– year: 2004
  ident: ref28
  publication-title: Competition and cooperation in wireless communication networks
– ident: ref8
  doi: 10.1109/25.260747
– ident: ref43
  doi: 10.1137/1.9780898719468
– ident: ref24
  doi: 10.1109/ICASSP.2004.1326891
– ident: ref23
  doi: 10.1080/1055678042000218975
– ident: ref42
  doi: 10.1016/0893-9659(89)90014-1
– ident: ref22
  doi: 10.1109/ISIT.2003.1228331
– year: 1993
  ident: ref47
  publication-title: Nonlinear Programming?Theory and Algorithms
– ident: ref29
  doi: 10.1109/ISIT.2006.261855
– ident: ref49
  doi: 10.1109/TIT.2008.924723
– ident: ref15
  doi: 10.1109/26.983324
– ident: ref20
  doi: 10.1109/TAC.2007.910665
– year: 1995
  ident: ref34
  publication-title: Digital Communications
– ident: ref41
  doi: 10.1145/318789.318894
– start-page: 249
  year: 1993
  ident: ref7
  article-title: An asynchronous distributed algorithm for power control in celular radio systems
  publication-title: Proc 4th Winlab Workshop Third Generation Wireless Information Network
– ident: ref25
  doi: 10.1109/SPAWC.2003.1318944
– ident: ref16
  doi: 10.1109/WIOPT.2005.41
– ident: ref37
  doi: 10.1109/26.662641
– year: 2003
  ident: ref45
  publication-title: Convex optimization
SSID ssj0014496
Score 2.337431
Snippet In this two-part paper, we address the problem of finding the optimal precoding/multiplexing scheme for a set of noncooperative links sharing the same physical...
P.l the maximization of mutual information on each link, given constraints on the transmit power and spectral mask; and P.2 the maximization of the...
SourceID proquest
pascalfrancis
crossref
ieee
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 1250
SubjectTerms Algorithms
Applied sciences
Bandwidth
Coding, codes
Competitive optimality
Constraint optimization
Convergence
distributed algorithms
Economic models
Error probability
Exact sciences and technology
Game theory
Information, signal and communications theory
Iterative algorithms
iterative waterfilling
Miscellaneous
Multiplexing
Mutual information
Nash equilibrium
Signal and communications theory
Signal processing
Studies
Sufficient conditions
Telecommunications and information theory
Wideband
Title Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems Based on Game Theory-Part II: Algorithms
URI https://ieeexplore.ieee.org/document/4451296
https://www.proquest.com/docview/863265134
https://www.proquest.com/docview/34924085
Volume 56
WOSCitedRecordID wos000253358400030&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1941-0476
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014496
  issn: 1053-587X
  databaseCode: RIE
  dateStart: 19910101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3BbtQwEB21FQc40EJBbAvFBw4ccJuNndjmVioKvSwrUcTeIseelJW6Sdns9vs7jrNRUeHALZEnipUZe2Yy4_cA3nlKAbxOHBcaSy6FcrzM85KrFHPtKme1sh3ZhJpM9GxmplvwYTgLg4hd8xkeh8uulu8btw6_yk4CmFZq8m3YVkrFs1pDxUDKjouLwgXBM61mPYzPODEnl9-nEauQEkEdeCTveaCOUiU0RNqWvkkVySwe7Mudsznf_b9p7sHTPqhkp9EKnsEW1s_hyT2owX34_Y32hgUJUfJJxs2mIRMOfott8GmxZRTAsp9zj6WtPZs0NT9rmhuM2OCsxzZnn8jvedbU7ItdIItn-_mULJBdXHxkp9dXzXK--rVoX8CP88-XZ195T7fAnZBmxa0TGVbluCyTKlEGbUKqSvMs885kqhLepWhL6S0N5qhSSjScNWOpwp4gNYqXsFM3Nb4CpkK5zQpPYpIyRmkqspQcHdKdNShHcLxRQeF6LPJAiXFddDlJYgrSWWDIVEXU2QjeDw_cRBiOf4vuB5UMYr02RnD0h46Hccp5RSg3jeBwo_SiX8dtoXMKb7OxoBm_HUZpAYaqiq2xWbdFgHcMMHEHf3_vITyOLSahbe017KyWa3wDj9ztat4ujzobvgM1I_C2
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Nb9QwEB2VggQc-CqIpdD6wIEDbpPYiW1upaJ0RVlWYhF7ixx7Ait1k7LZ5fczTrJREXDglsgTxcqMPTOZ8XsALz2lAF5HjguNBZdCOV5kWcFVgpl2pbNa2ZZsQk0mej430x14PZyFQcS2-QyPwmVby_e124RfZccBTCsx2Q24mUqZxN1praFmIGXLxkUBg-CpVvMeyCeOzPHs87RDK6RUUAcmyWs-qCVVCS2RtqGvUnZ0Fn_szK27Obv_fxN9APf6sJKddHbwEHawegR3r4EN7sGPT7Q7LEmI0k8ybzYNuXDwXGyLUIsNoxCWfV14LGzl2aSu-GldX2GHDs56dHP2ljyfZ3XF3tslsu50P5-SDbLx-A07ufxWrxbr78vmMXw5ezc7Pec94QJ3Qpo1t06kWBZxUURlpAzaiJSVZGnqnUlVKbxL0BbSWxrMUCWUajhrYqnCriA1iiewW9UVPgWmQsHNCk9iknJGaUqylQwd0p01KEdwtFVB7no08kCKcZm3WUlkctJZ4MhUeaezEbwaHrjqgDj-LboXVDKI9doYwcFvOh7GKesVoeA0gv2t0vN-JTe5zijATWNBMz4cRmkJhrqKrbDeNHkAeAxAcc_-_t5DuH0--3iRX4wnH_bhTtdwEprYnsPuerXBF3DL_VwvmtVBa8-_ANqj8_0
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Optimal+Linear+Precoding+Strategies+for+Wideband+Non-Cooperative+Systems+Based+on+Game+Theory-Part+II%3A+Algorithms&rft.jtitle=IEEE+transactions+on+signal+processing&rft.au=SCUTARI%2C+Gesualdo&rft.au=PALOMAR%2C+Daniel+P&rft.au=BARBAROSSA%2C+Sergio&rft.date=2008-03-01&rft.pub=Institute+of+Electrical+and+Electronics+Engineers&rft.issn=1053-587X&rft.volume=56&rft.issue=3&rft.spage=1250&rft.epage=1267&rft_id=info:doi/10.1109%2FTSP.2007.907808&rft.externalDBID=n%2Fa&rft.externalDocID=21033222
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1053-587X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1053-587X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1053-587X&client=summon