File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: An efficient greedy scheduler for zero-forcing dirty-paper coding

TitleAn efficient greedy scheduler for zero-forcing dirty-paper coding
Authors
KeywordsEfficient greedy scheduler
Multiple-input multiple-output (MIMO)
QR factorization by Householder transformation
Vector Gaussian broadcast channel (GBC)
Zero-forcing dirty-paper coding (ZF-DPC)
Issue Date2009
PublisherI E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=26
Citation
Ieee Transactions On Communications, 2009, v. 57 n. 7, p. 1939-1943 How to Cite?
AbstractIn this paper, an efficient greedy scheduler for zeroforcing dirty-paper coding (ZF-DPC), which can be incorporated in complex Householder QR factorization of the channel matrix, is proposed. The ratio of the complexity of the proposed scheduler to the complexity of the channel matrix factorization required by ZF-DPC is O(M-1), while such ratio for the original greedy scheduler is O(M), where M is the number of transmitters. Therefore, the new scheduler reduces the overhead of scheduling from being the bottleneck of ZF-DPC to being negligible. © 2009 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/73993
ISSN
2015 Impact Factor: 2.298
2015 SCImago Journal Rankings: 1.659
ISI Accession Number ID
Funding AgencyGrant Number
National Mobile Communications Research Laboratory, Southeast UniversityA200509
Funding Information:

This work is supported by the open issues of National Mobile Communications Research Laboratory, Southeast University (No. A200509).

References

 

DC FieldValueLanguage
dc.contributor.authorDai, Jen_HK
dc.contributor.authorChang, Cen_HK
dc.contributor.authorYe, Zen_HK
dc.contributor.authorHung, YSen_HK
dc.date.accessioned2010-09-06T06:56:46Z-
dc.date.available2010-09-06T06:56:46Z-
dc.date.issued2009en_HK
dc.identifier.citationIeee Transactions On Communications, 2009, v. 57 n. 7, p. 1939-1943en_HK
dc.identifier.issn0090-6778en_HK
dc.identifier.urihttp://hdl.handle.net/10722/73993-
dc.description.abstractIn this paper, an efficient greedy scheduler for zeroforcing dirty-paper coding (ZF-DPC), which can be incorporated in complex Householder QR factorization of the channel matrix, is proposed. The ratio of the complexity of the proposed scheduler to the complexity of the channel matrix factorization required by ZF-DPC is O(M-1), while such ratio for the original greedy scheduler is O(M), where M is the number of transmitters. Therefore, the new scheduler reduces the overhead of scheduling from being the bottleneck of ZF-DPC to being negligible. © 2009 IEEE.en_HK
dc.languageengen_HK
dc.publisherI E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=26en_HK
dc.relation.ispartofIEEE Transactions on Communicationsen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rightsIEEE Transactions on Communications. Copyright © IEEE.-
dc.rights©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.subjectEfficient greedy scheduleren_HK
dc.subjectMultiple-input multiple-output (MIMO)en_HK
dc.subjectQR factorization by Householder transformationen_HK
dc.subjectVector Gaussian broadcast channel (GBC)en_HK
dc.subjectZero-forcing dirty-paper coding (ZF-DPC)en_HK
dc.titleAn efficient greedy scheduler for zero-forcing dirty-paper codingen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0090-6778&volume=57&issue=7&spage=1939&epage=1943&date=2009&atitle=An+efficient+greedy+scheduler+for+zero-forcing+dirty-paper+codingen_HK
dc.identifier.emailChang, C: cqchang@eee.hku.hken_HK
dc.identifier.emailHung, YS: yshung@hkucc.hku.hken_HK
dc.identifier.authorityChang, C=rp00095en_HK
dc.identifier.authorityHung, YS=rp00220en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/TCOMM.2009.07.070162en_HK
dc.identifier.scopuseid_2-s2.0-68249145960en_HK
dc.identifier.hkuros163901en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-68249145960&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume57en_HK
dc.identifier.issue7en_HK
dc.identifier.spage1939en_HK
dc.identifier.epage1943en_HK
dc.identifier.isiWOS:000267982700013-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridDai, J=26421945900en_HK
dc.identifier.scopusauthoridChang, C=7407033052en_HK
dc.identifier.scopusauthoridYe, Z=7401957018en_HK
dc.identifier.scopusauthoridHung, YS=8091656200en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats