메뉴 건너뛰기




Volumn 59, Issue 4, 2013, Pages 2459-2470

Multiple access demodulation in the lifted signal graph with spatial coupling

Author keywords

Iterative decoding; Optimal joint detection; Random signaling; Spatial coupling

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); ITERATIVE DECODING; MIMO SYSTEMS; OPTICAL VARIABLES MEASUREMENT; OPTIMIZATION; SIGNAL TO NOISE RATIO;

EID: 84896691796     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2012.2232965     Document Type: Article
Times cited : (27)

References (43)
  • 1
    • 0032155264 scopus 로고    scopus 로고
    • Iterative detection in code-division multiple-access with error control coding
    • Sep./Oct
    • P. Alexander, A. Grant, andM. Reed, "Iterative detection in code-division multiple-access with error control coding," Eur. Trans. Telecommun., vol. 9, pp. 419-426, Sep./Oct. 1998.
    • (1998) Eur. Trans. Telecommun. , vol.9 , pp. 419-426
    • Alexander, P.1    Grant, A.2    Reed, M.3
  • 2
    • 0030257652 scopus 로고    scopus 로고
    • Near optimum error correcting coding and decoding: Turbo-codes
    • Oct
    • C. Berrou and A. Glavieux, "Near optimum error correcting coding and decoding: Turbo-codes," IEEE Trans. Commun., vol. 44, no. 10, pp. 1261-1271, Oct. 1996.
    • (1996) IEEE Trans. Commun. , vol.44 , Issue.10 , pp. 1261-1271
    • Berrou, C.1    Glavieux, A.2
  • 3
    • 0036648193 scopus 로고    scopus 로고
    • Iterative multi-user joint decoding: Unified framework and asymptotic analysis
    • Jul
    • J. Boutros and G. Caire, "Iterative multi-user joint decoding: Unified framework and asymptotic analysis," IEEE Trans. Inf. Theory, vol. 48, no. 7, pp. 1772-1793, Jul. 2002.
    • (2002) IEEE Trans. Inf. Theory , vol.48 , Issue.7 , pp. 1772-1793
    • Boutros, J.1    Caire, G.2
  • 4
    • 14844359210 scopus 로고    scopus 로고
    • Analysis of the dynamics of iterative interference cancellation in iterative decoding
    • M. V. Burnashev, C. Schlegel,W. A. Krzymien, and Z. Shi, "Mathematical analysis of one successive cancellation scheme in iterative decoding," Probl. Inf. Trans., vol. 40, no. 4, pp. 3-25, 2004. (Pubitemid 40356524)
    • (2004) Problemy Peredachi Informatsii , vol.40 , Issue.4 , pp. 3-25
    • Burnashev, M.V.1    Schlegel, C.B.2    Krzymien, W.A.3    Shi, Z.4
  • 6
    • 0035332194 scopus 로고    scopus 로고
    • Iterative turbo decoder analysis based on density evolution
    • DOI 10.1109/49.924873, PII S0733871601039038
    • D.Divsalar, S. Dolinar, and F. Pollara, "Iterative turbo decoder analysis based on density evolution," IEEE J. Sel. Areas Commun., vol. 19, no. 5, pp. 891-907, May 2001. (Pubitemid 32576668)
    • (2001) IEEE Journal on Selected Areas in Communications , vol.19 , Issue.5 , pp. 891-907
    • Divsalar, D.1    Dolinar, S.2    Pollara, F.3
  • 7
    • 0033184966 scopus 로고    scopus 로고
    • Time-varying periodic convolutional codes with low-density parity-check matrix
    • Sep
    • A. J. Felstrom and K. S. Zigangirov, "Time-varying periodic convolutional codes with low-density parity-check matrix," IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 2181-2190, Sep. 1999.
    • (1999) IEEE Trans. Inf. Theory , vol.45 , Issue.5 , pp. 2181-2190
    • Felstrom, A.J.1    Zigangirov, K.S.2
  • 8
    • 70149110596 scopus 로고    scopus 로고
    • The status of the p versus np problem
    • Sep
    • L. Fortnow, "The status of the P versus NP problem," Commun. ACM, vol. 52, no. 9, pp. 78-86, Sep. 2009.
    • (2009) Commun. ACM , vol.52 , Issue.9 , pp. 78-86
    • Fortnow, L.1
  • 9
    • 84925405668 scopus 로고
    • Low-density parity-check codes
    • Jan
    • R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inf. Theory, vol. 8, no. 1, pp. 21-28, Jan. 1962.
    • (1962) IRE Trans. Inf. Theory , vol.8 , Issue.1 , pp. 21-28
    • Gallager, R.G.1
  • 10
    • 0032202137 scopus 로고    scopus 로고
    • Random sequence multisets for synchronous code-division multiple-access channels
    • PII S0018944898067455
    • A. Grant and P. Alexander, "Random sequence multisets for synchronous code-division multiple-access channels," IEEE Trans. Inf. Theory, vol. 44, no. 7, pp. 2832-2836, Nov. 1998. (Pubitemid 128739988)
    • (1998) IEEE Transactions on Information Theory , vol.44 , Issue.7 , pp. 2832-2836
    • Grant, A.J.1    Alexander, P.D.2
  • 12
    • 77958536438 scopus 로고    scopus 로고
    • Tight bounds on the capacity of binary input random cdma systems
    • Nov
    • S. B. Korada and N. Macris, "Tight bounds on the capacity of binary input random CDMA systems," IEEE Trans. Inf. Theory, vol. 56, no. 11, pp. 5590-5613, Nov. 2010.
    • (2010) IEEE Trans. Inf. Theory , vol.56 , Issue.11 , pp. 5590-5613
    • Korada, S.B.1    Macris, N.2
  • 13
    • 80054815867 scopus 로고    scopus 로고
    • Connection between annealed free energy and belief propagation on random factor graph ensembles
    • R. Mori, "Connection between annealed free energy and belief propagation on random factor graph ensembles," in Proc. IEEE Int. Symp. Inf. Theory, 2011, pp. 2016-2020.
    • Proc. IEEE Int. Symp. Inf. Theory , vol.2011 , pp. 2016-2020
    • Mori, R.1
  • 14
  • 15
    • 79251496645 scopus 로고    scopus 로고
    • Threshold saturation via spatial coupling: Why convolutional ldpc ensembles perform so well over the bec
    • Feb
    • S. Kudekar, T. Richardson, and R. Urbanke, "Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC," IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 803-834, Feb. 2011.
    • (2011) IEEE Trans. Inf. Theory , vol.57 , Issue.2 , pp. 803-834
    • Kudekar, S.1    Richardson, T.2    Urbanke, R.3
  • 16
    • 0030736022 scopus 로고    scopus 로고
    • Low complexity optimal joint detection for oversaturated multiple access communications
    • PII S1053587X97005205
    • R. Learned, A. Willsky, and D. Boroson, "Low complexity optimal joint detection for oversaturated multiple access communications," IEEE Trans. Signal Process., vol. 45, no. 1, pp. 113-123, Jan. 1997. (Pubitemid 127765851)
    • (1997) IEEE Transactions on Signal Processing , vol.45 , Issue.1 , pp. 113-123
    • Learned, R.E.1    Willsky, A.S.2    Boroson, D.M.3
  • 19
    • 0032114472 scopus 로고    scopus 로고
    • An iterative multiuser decoder for near-capacity communications
    • PII S009067789805171X
    • M. Moher, "An iterative multi-user decoder for near-capacity communications," IEEE Trans. Commun., vol. 47, no. 7, pp. 870-880, Jul. 1998. (Pubitemid 128739438)
    • (1998) IEEE Transactions on Communications , vol.46 , Issue.7 , pp. 870-880
    • Moher, M.1
  • 20
    • 33645833658 scopus 로고    scopus 로고
    • Interleave division multipleaccess
    • Apr
    • L. Ping, L. Liu, K. Wu, and W. Leung, "Interleave division multipleaccess," IEEE Trans. Wireless Commun., vol. 5, no. 4, pp. 938-947, Apr. 2006.
    • (2006) IEEE Trans. Wireless Commun. , vol.5 , Issue.4 , pp. 938-947
    • Ping, L.1    Liu, L.2    Wu, K.3    Leung, W.4
  • 21
    • 0032299357 scopus 로고    scopus 로고
    • Iterative multiuser detection for CDMA with FEC: Near-single-user performance
    • PII S0090677898093805
    • M. C. Reed, C. B. Schlegel, P. D. Alexander, and J. A. Asenstorfer, "Iterative multi-user detection for CDMA with FEC: Near-single-user performance," IEEE Trans. Commun., vol. 46, no. 12, pp. 1693-1699, Dec. 1998. (Pubitemid 128739525)
    • (1998) IEEE Transactions on Communications , vol.46 , Issue.12 , pp. 1693-1699
    • Reed, M.C.1
  • 22
    • 0035246127 scopus 로고    scopus 로고
    • Design of capacity-approaching irregular low-density parity-check codes
    • DOI 10.1109/18.910578, PII S0018944801007386
    • T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001. (Pubitemid 32318093)
    • (2001) IEEE Transactions on Information Theory , vol.47 , Issue.2 , pp. 619-637
    • Richardson, T.J.1    Shokrollahi, M.A.2    Urbanke, R.L.3
  • 23
    • 0035246307 scopus 로고    scopus 로고
    • The capacity of low-density parity-check codes under message-passing decoding
    • DOI 10.1109/18.910577, PII S0018944801007374
    • T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes undermessage-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001. (Pubitemid 32318092)
    • (2001) IEEE Transactions on Information Theory , vol.47 , Issue.2 , pp. 599-618
    • Richardson, T.J.1    Urbanke, R.L.2
  • 24
    • 0034270965 scopus 로고    scopus 로고
    • Polynomial complexity optimal detection of certain multiple-access systems
    • Sep
    • C. Schlegel and A. Grant, "Polynomial complexity optimal detection of certain multiple-access systems," IEEE Trans. Inf. Theory, vol. 46, no. 6, pp. 2246-2248, Sep. 2000.
    • (2000) IEEE Trans. Inf. Theory , vol.46 , Issue.6 , pp. 2246-2248
    • Schlegel, C.1    Grant, A.2
  • 25
    • 0032164266 scopus 로고    scopus 로고
    • Solving a class of optimum multiuser detection problems with polynomial complexity
    • PII S0018944898059082
    • C. Sankaran and A. Ephremides, "Solving a class of optimum multiuser detection problemswith polynomial complexity," IEEE Trans. Inf. Theory, vol. 44, no. 5, pp. 1958-1961, Sep. 1998. (Pubitemid 128738564)
    • (1998) IEEE Transactions on Information Theory , vol.44 , Issue.5 , pp. 1958-1961
    • Sankaran, C.1    Ephremides, A.2
  • 27
    • 38149105650 scopus 로고    scopus 로고
    • Cdma with partitioned spreading
    • Dec
    • C. Schlegel, "CDMA with partitioned spreading," IEEE Commun. Lett., vol. 11, no. 12, pp. 913-915, Dec. 2007.
    • (2007) IEEE Commun. Lett. , vol.11 , Issue.12 , pp. 913-915
    • Schlegel, C.1
  • 28
    • 33748547596 scopus 로고    scopus 로고
    • Asymptotically optimal power allocation and code selection for iterative joint detection of coded random cdma
    • Sep
    • C. Schlegel, Z. Shi, and M. Burnashev, "Asymptotically optimal power allocation and code selection for iterative joint detection of coded random CDMA," IEEE Trans. Inf. Theory, vol. 52, no. 9, pp. 4286-4295, Sep. 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.9 , pp. 4286-4295
    • Schlegel, C.1    Shi, Z.2    Burnashev, M.3
  • 29
    • 0037250702 scopus 로고    scopus 로고
    • Spreading code construction for cdma
    • Jan
    • Z. Shi and C. Schlegel, "Spreading code construction for CDMA," IEEE Comm. Lett., vol. 7, no. 1, pp. 4-6, Jan. 2003.
    • (2003) IEEE Comm. Lett. , vol.7 , Issue.1 , pp. 4-6
    • Shi, Z.1    Schlegel, C.2
  • 30
    • 0035416420 scopus 로고    scopus 로고
    • Joint iterative decoding of serially concatenated error control coded CDMA
    • DOI 10.1109/49.942525, PII S0733871601072316
    • Z. Shi and C. Schlegel, "Joint iterative decoding of serially concatenated error control coded CDMA," IEEE J. Sel. Areas Commun., vol. 19, no. 8, pp. 1646-1653, Aug. 2001. (Pubitemid 32866243)
    • (2001) IEEE Journal on Selected Areas in Communications , vol.19 , Issue.8 , pp. 1646-1653
    • Shi, Z.1    Schlegel, C.2
  • 31
    • 33646054821 scopus 로고    scopus 로고
    • Iterative multi-user detection and error control code decoding in random cdma
    • , May
    • Z. Shi and C. Schlegel, "Iterative multi-user detection and error control code decoding in random CDMA," IEEE Trans. Signal Proc., vol. 54, no. 5, pp. 1886-1895, May 2006.
    • (2006) IEEE Trans. Signal Proc. , vol.54 , Issue.5 , pp. 1886-1895
    • Shi, Z.1    Schlegel, C.2
  • 32
    • 33747786275 scopus 로고    scopus 로고
    • On maximum contention-free interleavers and permutation polynomials over integer rings
    • DOI 10.1109/TIT.2005.864450
    • O. Takeshita, "On maximum contention-free interleavers and permutation polynomials over integer rings," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 1249-1253, Mar. 2006. (Pubitemid 46444910)
    • (2006) IEEE Transactions on Information Theory , vol.52 , Issue.3 , pp. 1249-1253
    • Takeshita, O.Y.1
  • 33
    • 0036846395 scopus 로고    scopus 로고
    • A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors
    • DOI 10.1109/TIT.2002.804053
    • T. Tanaka, "A statistical-mechanics approach to large-system analysis of CDMA multi-user detectors," IEEE Trans. Inf. Theory, vol. 48, no. 11, pp. 2888-2910, Nov. 2002. (Pubitemid 35327603)
    • (2002) IEEE Transactions on Information Theory , vol.48 , Issue.11 , pp. 2888-2910
    • Tanaka, T.1
  • 35
    • 10644253226 scopus 로고    scopus 로고
    • On quasi-cyclic repeat-accumulate codes
    • Monticello, IL, Sep
    • R. Tanner, "On quasi-cyclic repeat-accumulate codes," in Proc. 37th Allerton Conf. Commun. Contr. Comp., Monticello, IL, Sep. 1999, pp. 249-259.
    • (1999) Proc. 37th Allerton Conf. Commun. Contr. Comp. , pp. 249-259
    • Tanner, R.1
  • 36
    • 0035481826 scopus 로고    scopus 로고
    • Convergence behavior of iteratively decoded parallel concatenated codes
    • DOI 10.1109/26.957394, PII S0090677801091048
    • S. t. Brink, "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Commun., vol. 49, no. 10, pp. 1727-1737, Oct. 2001. (Pubitemid 33048353)
    • (2001) IEEE Transactions on Communications , vol.49 , Issue.10 , pp. 1727-1737
    • Brink, S.T.1
  • 38
    • 58249129026 scopus 로고    scopus 로고
    • A two-stage capacity achieving demodulation/decoding method for random matrix channels
    • Jan
    • D. Truhachev, C. Schlegel, and L. Krzymien, "A two-stage capacity achieving demodulation/decoding method for random matrix channels," IEEE Trans. Inf. Theory, vol. 55, no. 1, pp. 136-146, Jan. 2009.
    • (2009) IEEE Trans. Inf. Theory , vol.55 , Issue.1 , pp. 136-146
    • Truhachev, D.1    Schlegel, C.2    Krzymien, L.3
  • 39
    • 3342886083 scopus 로고    scopus 로고
    • Optimum multiuser detection is tractable for synchronons CDMA systems usine M-sequences
    • S. Ulukus and R. Yates, "Optimum multi-user detection is tractable for synchronous CDMA using m-sequences," IEEE Commun. Lett., vol. 2, no. 4, pp. 89-91, Apr. 1998. (Pubitemid 128555387)
    • (1998) IEEE Communications Letters , vol.2 , Issue.4 , pp. 89-91
    • Ulukus, S.1    Yates, R.D.2
  • 40
    • 0035395906 scopus 로고    scopus 로고
    • Iterative construction of optimum signature sequence sets in synchronous CDMA systems
    • DOI 10.1109/18.930932, PII S0018944801044832
    • S. Ulukus and R. Yates, "Iterative construction of optimum signature sequence sets in synchronous CDMA systems," IEEE Trans. Inf. Theory, vol. 47, no. 5, pp. 1989-1998, Jul. 2001. (Pubitemid 32644710)
    • (2001) IEEE Transactions on Information Theory , vol.47 , Issue.5 , pp. 1989-1998
    • Ulukus, S.1    Yates, R.D.2
  • 41
    • 0010185175 scopus 로고
    • Computational complexity of optimalmulti-user detection
    • S. Verdú, "Computational complexity of optimalmulti-user detection," Algorithmica, vol. 4, pp. 303-312, 1989.
    • (1989) Algorithmica , vol.4 , pp. 303-312
    • Verdú, S.1
  • 42
    • 0022581781 scopus 로고
    • Minimum probability of error for asynchronous gaussian multiple-Access channels
    • S. Verdú, "Minimum probability of error for asynchronous Gaussian multiple-access channels," IEEE Trans. Inf. Theory, vol. 32, no. 1, pp. 85-96, Jan. 1986. (Pubitemid 16595647)
    • (1986) IEEE Transactions on Information Theory , vol.IT-32 , Issue.1 , pp. 85-96
    • Verdu Sergio1
  • 43
    • 0032658791 scopus 로고    scopus 로고
    • Iterative (turbo) soft interference cancellation and decoding for coded cdma
    • Jul
    • X. Wang and H. V. Poor, "Iterative (turbo) soft interference cancellation and decoding for coded CDMA," IEEE Trans. Commun., vol. 47, no. 7, pp. 1046-1061, Jul. 1999.
    • (1999) IEEE Trans. Commun. , vol.47 , Issue.7 , pp. 1046-1061
    • Wang, X.1    Poor, H.V.2


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