Approaching the Dirty Paper Limit for Canceling Known Interference
暂无分享,去创建一个
[1] Claude E. Shannon,et al. Channels with Side Information at the Transmitter , 1958, IBM J. Res. Dev..
[2] John Cocke,et al. Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.
[3] Max H. M. Costa,et al. Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.
[4] G. Forney,et al. Trellis shaping , 1992, IEEE/CAM Information Theory Workshop at Cornell.
[5] G. David Forney,et al. Trellis precoding: Combined coding, precoding and shaping for intersymbol interference channels , 1992, IEEE Trans. Inf. Theory.
[6] A. Glavieux,et al. Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.
[7] Joachim Hagenauer,et al. Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.
[8] H. Jin,et al. Irregular repeat accumulate codes , 2000 .
[9] B. Girod,et al. A blind watermarking scheme based on structured codebooks , 2000 .
[10] Gregory W. Wornell,et al. Quantization index modulation: A class of provably good methods for digital watermarking and information embedding , 2001, IEEE Trans. Inf. Theory.
[11] R. Zamir,et al. Combined shaping and precoding for interference cancellation at low SNR , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..
[12] Shlomo Shamai,et al. Writing on dirty tape with LDPC codes , 2003, Multiantenna Channels: Capacity, Coding and Signal Processing.
[13] Stephan ten Brink,et al. Design of repeat-accumulate codes for iterative detection and decoding , 2003, IEEE Trans. Signal Process..
[14] Shlomo Shamai,et al. Capacity and lattice strategies for canceling known interference , 2005, IEEE Transactions on Information Theory.