메뉴 건너뛰기




Volumn 58, Issue 8, 2012, Pages 5388-5397

Writing on fading paper, dirty tape with little ink: Wideband limits for causal transmitter CSI

Author keywords

Capacity per unit cost; causal channel state information (CSI); dirty paper channel; dirty tape; low SNR; opportunistic communication; orthogonal code; transmitter CSI (CSIT); wideband channel

Indexed keywords

CAPACITY PER UNIT COST; DIRTY-PAPER CHANNEL; LOW SNR; OPPORTUNISTIC COMMUNICATIONS; ORTHOGONAL CODE; WIDEBAND CHANNEL;

EID: 84863963782     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2012.2201330     Document Type: Article
Times cited : (16)

References (20)
  • 1
    • 0001560154 scopus 로고
    • Channels with side information at the transmitter
    • C. E. Shannon, "Channels with side information at the transmitter," IBM J. Res. Develop., vol. 2, pp. 289-293, 1958.
    • (1958) IBM J. Res. Develop. , vol.2 , pp. 289-293
    • Shannon, C.E.1
  • 2
    • 0019148101 scopus 로고
    • Coding for channel with random parameters
    • S. Gel'fand and M. Pinsker, "Coding for channel with random parameters," Problems Control Inf. Theory, vol. 9, no. 1, pp. 19-31, 1980.
    • (1980) Problems Control Inf. Theory , vol.9 , Issue.1 , pp. 19-31
    • Gel'fand, S.1    Pinsker, M.2
  • 3
    • 0020821981 scopus 로고
    • On the capacity computer memory with defects
    • Sep.
    • C. Heegard and A. Gamal, "On the capacity computer memory with defects," IEEE Trans. Inf. Theory, vol. IT-29, no. 5, pp. 731-739, Sep. 1983.
    • (1983) IEEE Trans. Inf. Theory , vol.IT29 , Issue.5 , pp. 731-739
    • Heegard, C.1    Gamal, A.2
  • 4
    • 0020752342 scopus 로고
    • Writing on dirty paper
    • May
    • M. Costa, "Writing on dirty paper," IEEE Trans. Inf. Theory, vol. IT-29, no. 3, pp. 439-441, May 1983.
    • (1983) IEEE Trans. Inf. Theory , vol.IT29 , Issue.3 , pp. 439-441
    • Costa, M.1
  • 6
    • 0034230060 scopus 로고    scopus 로고
    • Capacity and mutual information of wideband multipath fading channels
    • Jul.
    • I. E. Telatar and D. N. C. Tse, "Capacity and mutual information of wideband multipath fading channels," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1384-1400, Jul. 2000.
    • (2000) IEEE Trans. Inf. Theory , vol.46 , Issue.4 , pp. 1384-1400
    • Telatar, I.E.1    Tse, D.N.C.2
  • 7
    • 39049154386 scopus 로고    scopus 로고
    • Writing on fading paper and causal transmitter CSI
    • DOI 10.1109/ISIT.2006.261631, 4036062, Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
    • S. Borade and L. Zheng, "Writing on fading paper and causal transmitter CSI," in Proc. IEEE Int. Symp. Inf. Theory, Jul. 2006, pp. 744-748. (Pubitemid 351244193)
    • (2006) IEEE International Symposium on Information Theory - Proceedings , pp. 744-748
    • Borade, S.1    Zheng, L.2
  • 8
    • 78649392343 scopus 로고    scopus 로고
    • Wideband fading channels with feedback
    • Dec.
    • S. Borade and L. Zheng, "Wideband fading channels with feedback," IEEE Trans. Inf. Theory, vol. 56, no. 12, pp. 6058-6065, Dec. 2010.
    • (2010) IEEE Trans. Inf. Theory , vol.56 , Issue.12 , pp. 6058-6065
    • Borade, S.1    Zheng, L.2
  • 9
    • 33646049041 scopus 로고    scopus 로고
    • Opportunistic orthogonal writing on dirty paper
    • May
    • T. Liu and P. Vishwanath, "Opportunistic orthogonal writing on dirty paper," IEEE Trans. Inf. Theory, vol. 52, no. 5, pp. 1828-1846, May 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.5 , pp. 1828-1846
    • Liu, T.1    Vishwanath, P.2
  • 10
    • 0025485582 scopus 로고
    • On channel capacity per unit cost
    • DOI 10.1109/18.57201
    • S. Verdu, "On channel capacity per unit cost," IEEE Trans. Inf. Theory, vol. 36, no. 5, pp. 1019-1030, Sep. 1990. (Pubitemid 20738361)
    • (1990) IEEE Transactions on Information Theory , vol.36 , Issue.5 , pp. 1019-1030
    • Verdu Sergio1
  • 13
    • 27744491562 scopus 로고    scopus 로고
    • Capacity and lattice strategies for canceling known interference
    • DOI 10.1109/TIT.2005.856935
    • U. Erez, S. Shamai, and R. Zamir, "Capacity and lattice strategies for cancelling known interference," IEEE Trans. Inf. Theory, vol. 51, no. 11, pp. 3820-3833, Nov. 2005. (Pubitemid 41622583)
    • (2005) IEEE Transactions on Information Theory , vol.51 , Issue.11 , pp. 3820-3833
    • Erez, U.1    Shamai, S.2    Zamir, R.3
  • 17
    • 33646044455 scopus 로고    scopus 로고
    • presented at the presented at the Winter School Coding Inf. Theory, Ascona, Switzerland, Feb.
    • D. Hoesli, "On the capacity per unit cost of the dirty-tape channel," presented at the presented at the Winter School Coding Inf. Theory, Ascona, Switzerland, Feb. 2003.
    • (2003) On the Capacity per Unit Cost of the Dirty-tape Channel
    • Hoesli, D.1
  • 18
    • 84863929366 scopus 로고    scopus 로고
    • presented at the presented at the DIMACS Workshop Signal Process. Wireless Transmiss., Newark, NJ, Oct.
    • G. Caire and S. Shamai, "Writing on dirty tape with LDPC codes," presented at the presented at the DIMACS Workshop Signal Process. Wireless Transmiss., Newark, NJ, Oct. 2003.
    • (2003) Writing on Dirty Tape with LDPC Codes
    • Caire, G.1    Shamai, S.2
  • 19
    • 33646065637 scopus 로고    scopus 로고
    • Superposition coding for side-information channels
    • May
    • A. Bennatan, D. Burshtein, G. Caire, and S. Shamai, "Superposition coding for side-information channels," IEEE Trans. Inf. Theory, vol. 52, no. 5, pp. 1872-1889, May 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.5 , pp. 1872-1889
    • Bennatan, A.1    Burshtein, D.2    Caire, G.3    Shamai, S.4
  • 20
    • 39049170294 scopus 로고    scopus 로고
    • Iterative algorithms for finding the stationary points of the dirty tape problem
    • DOI 10.1109/ISIT.2006.261632, 4036063, Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
    • M. Kesal, S. Mallik, and R. Koetter, "Iterative algorithms for finding the stationary points of the dirty-tape problem," in Proc. IEEE Int. Symp. Inf. Theory, Jul. 2006, pp. 749-753. (Pubitemid 351244194)
    • (2006) IEEE International Symposium on Information Theory - Proceedings , pp. 749-753
    • Kesal, M.1    Mallik, S.2    Koetter, R.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.