Show simple item record

dc.contributor.authorLagén Morancho, Sandra
dc.contributor.authorAgustín de Dios, Adrián
dc.contributor.authorVidal Manzano, José
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions
dc.date.accessioned2016-01-08T13:02:58Z
dc.date.available2016-01-08T13:02:58Z
dc.date.issued2015-08-01
dc.identifier.citationLagen, S., Agustin, A., Vidal, J. Decentralized coordinated precoding for dense TDD small cell networks. "IEEE transactions on wireless communications", 01 Agost 2015, vol. 14, núm. 8, p. 4546-4561.
dc.identifier.issn1536-1276
dc.identifier.urihttp://hdl.handle.net/2117/81143
dc.description©2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
dc.description.abstractCellular networks need the densification of small eNBs (SeNBs) to face the tremendous data traffic demand growth, implying an interference increase and making transmit coordination a key enabler. This article proposes a decentralized coordinated precoding (D-CoP) for downlink (DL) weighted sum-rate maximization in dense MIMO TDD small cell networks (SCNs). Each SeNB designs its own precoding matrices based on channel state information (CSI) of the served users and knowledge of the interference-cost matrix that allows managing interference towards unintended users. A protocol is proposed to acquire the interference-cost matrix by processing the uplink (UL) received signal provided that: 1) channel reciprocity can be assumed and 2) all users participating in DL can transmit in UL with an adequate transmit filter. In contrast to existing transmit coordination techniques, D-CoP is fully scalable, avoids estimation of the interfering channels, and does not require information exchange between SeNBs. In case all parameters are perfectly acquired, an iterative algorithm is presented with demonstrated monotonic convergence when all SeNBs update its transmit precoders simultaneously. Further, the problem is reformulated in order to derive a robust D-CoP under imperfect CSI conditions. Finally, simulations in 3GPP LTE-Advanced SCNs show significant user packet throughput gains, without increasing the complexity associated to transmit coordination. Robustness to imperfect CSI and non-ideal channel reciprocity is shown through simulations.
dc.format.extent16 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Enginyeria de la telecomunicació
dc.subject.lcshMIMO systems
dc.subject.lcshCell phone systems
dc.subject.lcshData Traffic Management System (Computer system)
dc.subject.otherMulti-cell multi-user MIMO
dc.subject.otherDecentralized coordinated precoding design
dc.subject.otherInterference management
dc.subject.otherDense TDD small cell networks
dc.titleDecentralized coordinated precoding for dense TDD small cell networks
dc.typeArticle
dc.subject.lemacSistemes MIMO
dc.subject.lemacTelefonia mòbil
dc.subject.lemacDades -- Transmissió
dc.contributor.groupUniversitat Politècnica de Catalunya. SPCOM - Grup de Recerca de Processament del Senyal i Comunicacions
dc.identifier.doi10.1109/TWC.2015.2422704
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7084684
dc.rights.accessOpen Access
drac.iddocument15728956
dc.description.versionPostprint (author's final draft)
upcommons.citation.authorLagen, S., Agustin, A., Vidal, J.
upcommons.citation.publishedtrue
upcommons.citation.publicationNameIEEE transactions on wireless communications
upcommons.citation.volume14
upcommons.citation.number8
upcommons.citation.startingPage4546
upcommons.citation.endingPage4561


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder