File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/TCOMM.2009.07.070162
- Scopus: eid_2-s2.0-68249145960
- WOS: WOS:000267982700013
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: An efficient greedy scheduler for zero-forcing dirty-paper coding
| Title | An efficient greedy scheduler for zero-forcing dirty-paper coding | ||||
|---|---|---|---|---|---|
| Authors | |||||
| Keywords | Efficient 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 Date | 2009 | ||||
| Publisher | I 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? | ||||
| Abstract | In 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 Identifier | http://hdl.handle.net/10722/73993 | ||||
| ISSN | 2023 Impact Factor: 7.2 2020 SCImago Journal Rankings: 1.468 | ||||
| ISI Accession Number ID |
Funding Information: This work is supported by the open issues of National Mobile Communications Research Laboratory, Southeast University (No. A200509). | ||||
| References |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Dai, J | en_HK |
| dc.contributor.author | Chang, C | en_HK |
| dc.contributor.author | Ye, Z | en_HK |
| dc.contributor.author | Hung, YS | en_HK |
| dc.date.accessioned | 2010-09-06T06:56:46Z | - |
| dc.date.available | 2010-09-06T06:56:46Z | - |
| dc.date.issued | 2009 | en_HK |
| dc.identifier.citation | Ieee Transactions On Communications, 2009, v. 57 n. 7, p. 1939-1943 | en_HK |
| dc.identifier.issn | 0090-6778 | en_HK |
| dc.identifier.uri | http://hdl.handle.net/10722/73993 | - |
| dc.description.abstract | In 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.language | eng | en_HK |
| dc.publisher | I E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=26 | en_HK |
| dc.relation.ispartof | IEEE Transactions on Communications | en_HK |
| 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.subject | Efficient greedy scheduler | en_HK |
| dc.subject | Multiple-input multiple-output (MIMO) | en_HK |
| dc.subject | QR factorization by Householder transformation | en_HK |
| dc.subject | Vector Gaussian broadcast channel (GBC) | en_HK |
| dc.subject | Zero-forcing dirty-paper coding (ZF-DPC) | en_HK |
| dc.title | An efficient greedy scheduler for zero-forcing dirty-paper coding | en_HK |
| dc.type | Article | en_HK |
| dc.identifier.openurl | http://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+coding | en_HK |
| dc.identifier.email | Chang, C: cqchang@eee.hku.hk | en_HK |
| dc.identifier.email | Hung, YS: yshung@hkucc.hku.hk | en_HK |
| dc.identifier.authority | Chang, C=rp00095 | en_HK |
| dc.identifier.authority | Hung, YS=rp00220 | en_HK |
| dc.description.nature | published_or_final_version | - |
| dc.identifier.doi | 10.1109/TCOMM.2009.07.070162 | en_HK |
| dc.identifier.scopus | eid_2-s2.0-68249145960 | en_HK |
| dc.identifier.hkuros | 163901 | en_HK |
| dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-68249145960&selection=ref&src=s&origin=recordpage | en_HK |
| dc.identifier.volume | 57 | en_HK |
| dc.identifier.issue | 7 | en_HK |
| dc.identifier.spage | 1939 | en_HK |
| dc.identifier.epage | 1943 | en_HK |
| dc.identifier.isi | WOS:000267982700013 | - |
| dc.publisher.place | United States | en_HK |
| dc.identifier.scopusauthorid | Dai, J=26421945900 | en_HK |
| dc.identifier.scopusauthorid | Chang, C=7407033052 | en_HK |
| dc.identifier.scopusauthorid | Ye, Z=7401957018 | en_HK |
| dc.identifier.scopusauthorid | Hung, YS=8091656200 | en_HK |
| dc.identifier.issnl | 0090-6778 | - |