scispace - formally typeset
Search or ask a question
Topic

Dirty paper coding

About: Dirty paper coding is a research topic. Over the lifetime, 814 publications have been published within this topic receiving 37097 citations.


Papers
More filters
Proceedings Article
07 Apr 2011
TL;DR: It is shown through simulations that dirty paper coding is promising as an alternative precoding scheme for 802.11ac, the next generation 802.
Abstract: Multi-user MIMO has been recently proposed as a required technology for next generation 802.11 WLAN systems. This new system which will be called 802.11ac, will provide at least 1Gbps of multi-station throughput and at least 500Mbps of single station throughput. While linear precoding can be readily used to achieve this with little complexity, we explore the possibility of employing the non-linear scheme called dirty paper coding. Dirty paper coding is of recent interest in MIMO systems due to the possibility of achieving capacity. We show through simulations that dirty paper coding is promising as an alternative precoding scheme for 802.11ac.

4 citations

Proceedings ArticleDOI
Jong Yeol Ryu1, Eun Young Ahn1, Wan Choi1
05 Dec 2011
TL;DR: Analysis and simulations show that the proposed user relaying in a MIMO BC expands the achievable rate region of a zero-forcing dirty paper coding (ZF-DPC) in aMIMOBC without relaying.
Abstract: A novel user relaying scheme based on bit concatenation is proposed for a two-user multiple input multiple output(MIMO) broadcast channel (BC). In broadcasting phase, a part of information for a destination user is concatenated to data for a relaying user and transmitted to a relaying user. The destination user receives the part of information via the relaying user in relaying phase in addition to the data in broadcasting phase. Achievable rate region of the proposed scheme is derived and an algorithm to characterize the boundary of the rate region is proposed. Our analysis and simulations show that the proposed user relaying in a MIMO BC expands the achievable rate region of a zero-forcing dirty paper coding (ZF-DPC) in a MIMO BC without relaying.

4 citations

Proceedings ArticleDOI
01 Dec 2007
TL;DR: The performance of the MIMO mesh network in LOS environment is evaluated and the nonlinear algorithm based on dirty paper coding and successive interference cancellation is developed is developed, resulting in a network which avoids co-channel interference and supplies link multiplexing simultaneously.
Abstract: In this paper, an architecture of MIMO mesh network which avoids co-channel interference and supplies link multiplexing simultaneously is considered. In particular, this paper considers the multi-hop relaying case with bi-directional transmission. As a MIMO transmission scheme, nonlinear algorithm based on dirty paper coding and successive interference cancellation is developed for the proposed MIMO mesh network. In this paper, the performance of the MIMO mesh network in LOS environment is evaluated. As a result, the MIMO mesh network is superior to the conventional MIMO mesh network in LOS environment as well as NLOS environment.

4 citations

Proceedings ArticleDOI
29 Nov 2012
TL;DR: An outer bound is obtained on the sum-capacity of an ASD-GIC in the asymptotic case where the interference is assumed to be Gaussian variable with unbounded variance and a lattice-based coding scheme is applied.
Abstract: In this work, we consider an additive state-dependent Gaussian interference channel (ASD-GIC) where there is a common additive interference, known to both transmitters but not to the receivers. First, we obtain an outer bound on the sum-capacity for the asymptotic case where the interference is assumed to be Gaussian variable with unbounded variance. This asymptotic case has been referred to as the “strong interference” in [1]. By applying a lattice-based coding scheme, an achievable rate-region is provided. Under some conditions, which depend on the noise variance and channel power constraints, this achievable sum-rate region meets the outer bound and therefore lattice codes can achieve the sum-capacity of an ASD-GIC in the asymptotic case.

4 citations

Proceedings ArticleDOI
12 Apr 2010
TL;DR: A technique to achieve dirty paper coding (DPC) capacity asymptotically with minimum feedback required with least feedback required reported to date in literature is introduced.
Abstract: We introduce a technique to achieve dirty paper coding (DPC) capacity asymptotically with minimum feedback required reported to date in literature. Our approach called opportunistic interference management, is based on a new multiuser diversity scheme designed for wireless cellular networks. When there are K antennas at the base station with M mobile users in the cell, the proposed technique only requires K integer numbers related to channel state information (CSI) between mobile users and base station. The encoding and decoding complexity of this scheme is the same as that of point-to-point communications. In order to guarantee fairness, a new algorithm is proposed which incorporates opportunistic interference management into existing GSM standard.

4 citations

Network Information
Related Topics (5)
Fading
55.4K papers, 1M citations
89% related
Base station
85.8K papers, 1M citations
87% related
Wireless network
122.5K papers, 2.1M citations
86% related
Wireless
133.4K papers, 1.9M citations
84% related
Network packet
159.7K papers, 2.2M citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20236
202217
202121
202013
201926
201823