메뉴 건너뛰기




Volumn , Issue , 2007, Pages 3915-3920

Implementation aspects of list sphere detector algorithms

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DEMODULATION; MATHEMATICAL MODELS; OPTIMIZATION; SIGNAL ANALYSIS;

EID: 39349115887     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2007.744     Document Type: Conference Paper
Times cited : (29)

References (18)
  • 1
    • 0022088892 scopus 로고
    • Analysis and simulation of a digital mobile channel using orthogonal frequency division multiplexing
    • July
    • L. J. Cimini, "Analysis and simulation of a digital mobile channel using orthogonal frequency division multiplexing," IEEE Trans. Commun., vol. 33, no. 7, pp. 665-675, July, 1985.
    • (1985) IEEE Trans. Commun , vol.33 , Issue.7 , pp. 665-675
    • Cimini, L.J.1
  • 3
    • 13244291592 scopus 로고    scopus 로고
    • A road to future broadband wireless access: MIMO-OFDM-based air interface
    • Jan
    • H. Yang, "A road to future broadband wireless access: MIMO-OFDM-based air interface," Communications Magazine, IEEE, vol. 43, no. 1, pp. 53-60, Jan., 2005.
    • (2005) Communications Magazine, IEEE , vol.43 , Issue.1 , pp. 53-60
    • Yang, H.1
  • 4
    • 0030234863 scopus 로고    scopus 로고
    • Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas
    • Aug
    • G. Foschini, "Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas," Bell Labs Tech. J., vol. 1, no. 2, pp. 41-59, Aug. 1996.
    • (1996) Bell Labs Tech. J , vol.1 , Issue.2 , pp. 41-59
    • Foschini, G.1
  • 5
    • 4143154162 scopus 로고    scopus 로고
    • Near-maximum-likelihood detection of MIMO systems using MMSE-based lattice-reduction
    • Paris, France, Jun. 20-24
    • D. Wübben, R. Böhnke, V Kühn, and K. Kammeyer, "Near-maximum-likelihood detection of MIMO systems using MMSE-based lattice-reduction," in Proc. IEEE Int. Conf. Commun. (ICC), vol. 2, Paris, France, Jun. 20-24 2004, pp. 798-802.
    • (2004) Proc. IEEE Int. Conf. Commun. (ICC) , vol.2 , pp. 798-802
    • Wübben, D.1    Böhnke, R.2    Kühn, V.3    Kammeyer, K.4
  • 6
    • 84966239268 scopus 로고
    • Improved methods for calculating vectors of short length in a lattice, including a complexity analysis
    • May
    • U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. Comput., vol. 44, no. 5, pp. 463-471, May 1985.
    • (1985) Math. Comput , vol.44 , Issue.5 , pp. 463-471
    • Fincke, U.1    Pohst, M.2
  • 7
    • 0242365586 scopus 로고    scopus 로고
    • On maximum-likelihood detection and the search for the closest lattice point
    • Oct
    • M. O. Damen, H. E. Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inform. Theory, vol. 49, no. 10, pp. 2389-2402, Oct. 2003.
    • (2003) IEEE Trans. Inform. Theory , vol.49 , Issue.10 , pp. 2389-2402
    • Damen, M.O.1    Gamal, H.E.2    Caire, G.3
  • 8
    • 0038059297 scopus 로고    scopus 로고
    • Achieving near-capacity on a multiple-antenna channel
    • Mar
    • B. Hochwald and S. ten Brink, "Achieving near-capacity on a multiple-antenna channel," IEEE Trans. Commun., vol. 51, no. 3, Mar. 2003.
    • (2003) IEEE Trans. Commun , vol.51 , Issue.3
    • Hochwald, B.1    ten Brink, S.2
  • 9
    • 0036290634 scopus 로고    scopus 로고
    • A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels
    • Helsinki, Finland, Jun. 11-14
    • K.Wong, C. Tsui, R.-K. Cheng, and W. Mow, "A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels," in Proc. IEEE ISCAS'02, vol. 3, Helsinki, Finland, Jun. 11-14 2002, pp. 273-276.
    • (2002) Proc. IEEE ISCAS'02 , vol.3 , pp. 273-276
    • Wong, K.1    Tsui, C.2    Cheng, R.-K.3    Mow, W.4
  • 11
    • 33846200465 scopus 로고
    • Lattice basis reduction: Improved practical algorithms and solving subset sum problems
    • Sep
    • C. P. Schnorr and M. Euchner, "Lattice basis reduction: Improved practical algorithms and solving subset sum problems," Math. Programming, vol. 66, no. 2, pp. 181-191, Sep. 1994.
    • (1994) Math. Programming , vol.66 , Issue.2 , pp. 181-191
    • Schnorr, C.P.1    Euchner, M.2
  • 12
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • Mathematisch Centrum, Amsterdam, Netherlands
    • E. W. Dijkstra, "A note on two problems in connexion with graphs," in Numerische Mathematik, vol. 1, Mathematisch Centrum, Amsterdam, Netherlands, 1959, pp. 269-271.
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 14
    • 44349147218 scopus 로고    scopus 로고
    • M. Myllylä, J. Cavallaro, and M. Juntti, A List Sphere Detector based on Dijkstra's Algorithm for MIMO-OFDM Systems, in Proc. IEEE Int. Symp. Pers., Indoor, Mobile Radio Commun. (PIMRC), Athens, Greece, Sep 12 - 19, 2007, submitted.
    • M. Myllylä, J. Cavallaro, and M. Juntti, "A List Sphere Detector based on Dijkstra's Algorithm for MIMO-OFDM Systems," in Proc. IEEE Int. Symp. Pers., Indoor, Mobile Radio Commun. (PIMRC), Athens, Greece, Sep 12 - 19, 2007, submitted.
  • 18
    • 39349104496 scopus 로고    scopus 로고
    • 3rd Generation Partnership Project (3GPP), TSGR1#41 Rl-050-520, EUTRA downlink numerology, 3rd Generation Partnership Project (3GPP), Tech. Rep., 2005.
    • 3rd Generation Partnership Project (3GPP), "TSGR1#41 Rl-050-520, EUTRA downlink numerology," 3rd Generation Partnership Project (3GPP), Tech. Rep., 2005.


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