Foundations and Trends® in Networking
MIMO transceiver design via majorization theory
Foundations and Trends in Communications and Information Theory
Hybrid digital-analog coding with bandwidth compression for Gaussian source-channel pairs
IEEE Transactions on Communications
Trellis precoding for MIMO broadcast signaling
IEEE Transactions on Communications
Coding schemes for relay-assisted information embedding
IEEE Transactions on Information Forensics and Security
Flow optimization in parallel relay networks with cooperative relaying
IEEE Transactions on Wireless Communications
Bounds and lattice-based transmission strategies for the phase-faded dirty-paper channel
IEEE Transactions on Wireless Communications
Dynamic linear precoding for the exploitation of known interference in MIMO broadcast systems
IEEE Transactions on Wireless Communications
On the loss of single-letter characterization: the dirty multiple access channel
IEEE Transactions on Information Theory
Near-capacity dirty-paper code design: a source-channel coding approach
IEEE Transactions on Information Theory
Precoding for the AWGN channel with discrete interference
IEEE Transactions on Information Theory
On the designs and challenges of practical binary dirty paper coding
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Capacity of compound state-dependent channels with states known at the transmitter
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
On the capacity of multi-user cognitive radio networks
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Joint Wyner-Ziv/dirty-paper coding by modulo-lattice modulation
IEEE Transactions on Information Theory
Improved linear transmit processing for single-user and multi-user MIMO communications systems
IEEE Transactions on Signal Processing
Algebraic lattice alignment for K-user interference channel
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Lower bounds on the capacity of the relay channel with states at the source
EURASIP Journal on Wireless Communications and Networking
Vector perturbation precoding for MIMO broadcast channel with quantized channel feedback
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Achieving lower distortion with lattice strategies in multicast wireless networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Practical dirty paper coding with nested binary LDGM-LDPC codes
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Rate allocation for the multi-source downlink channel with minimax optimization
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Selective channel inversion precoding for the downlink of MIMO wireless systems
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
IEEE Transactions on Communications
On the robustness of dirty paper coding
IEEE Transactions on Communications
Cooperative relaying with state available noncausally at the relay
IEEE Transactions on Information Theory
Estimating watermarking capacity in gray scale images based on image complexity
EURASIP Journal on Advances in Signal Processing
Joint source channel coding with side information using hybrid digital analog codes
IEEE Transactions on Information Theory
Multi-cell MIMO cooperative networks: a new look at interference
IEEE Journal on Selected Areas in Communications - Special issue on cooperative communications in MIMO cellular networks
Grouping Algorithm for Partner Selection in Cooperative Transmission
Wireless Personal Communications: An International Journal
Achieving high data rates in a distributed MIMO system
Proceedings of the 18th annual international conference on Mobile computing and networking
AirSync: enabling distributed multiuser MIMO with full spatial multiplexing
IEEE/ACM Transactions on Networking (TON)
Hi-index | 755.20 |
We consider the generalized dirty-paper channel Y=X+S+N,E{X2}≤PX, where N is not necessarily Gaussian, and the interference S is known causally or noncausally to the transmitter. We derive worst case capacity formulas and strategies for "strong" or arbitrarily varying interference. In the causal side information (SI) case, we develop a capacity formula based on minimum noise entropy strategies. We then show that strategies associated with entropy-constrained quantizers provide lower and upper bounds on the capacity. At high signal-to-noise ratio (SNR) conditions, i.e., if N is weak relative to the power constraint PX, these bounds coincide, the optimum strategies take the form of scalar lattice quantizers, and the capacity loss due to not having S at the receiver is shown to be exactly the "shaping gain" 1/2log(2πe/12)≈ 0.254 bit. We extend the schemes to obtain achievable rates at any SNR and to noncausal SI, by incorporating minimum mean-squared error (MMSE) scaling, and by using k-dimensional lattices. For Gaussian N, the capacity loss of this scheme is upper-bounded by 1/2log2πeG(Λ), where G(Λ) is the normalized second moment of the lattice. With a proper choice of lattice, the loss goes to zero as the dimension k goes to infinity, in agreement with the results of Costa. These results provide an information-theoretic framework for the study of common communication problems such as precoding for intersymbol interference (ISI) channels and broadcast channels.