English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 13864449      Online Users : 84
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    National Tsing Hua University Institutional Repository > 電機資訊學院 > 電機工程學系 > 會議論文  >  On perfect channel identifiability of semiblind ML detection of orthogonal space-time block coded OFDM

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/68498

    Title: On perfect channel identifiability of semiblind ML detection of orthogonal space-time block coded OFDM
    Authors: Chang, Tsung-Hui;Ma, Wing-Kin;Huang, Chuan-Yuan;Chi, Chong-Yung
    教師: 祈忠勇
    Date: 2009
    Publisher: Institute of Electrical and Electronics Engineers (IEEE)
    Relation: 2009 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2009, April 19 - April 24, 2009
    Keywords: Wireless telecommunication systems
    Space time adaptive processing
    Signal processing
    Signal detection
    Orthogonal frequency division multiplexing
    Maximum likelihood estimation
    Interfaces (computer)
    Encoding (symbols)
    Computer peripheral equipment
    Abstract: This paper considers maximum-likelihood (ML) detection of orthogonal space-time block coded OFDM (OSTBC-OFDM) systems without channel state information. Our previous work has shown an interesting identifiability result, that the whole time-domain channel can be uniquely identified by only having one subchannel to transmit pilots. However, this identifiability is in a probability-one sense, under some mild assumptions on the channel statistics. In this paper we establish a "perfect" channel identifiability (PCI) condition under which the channel is always uniquely identifiable. It is shown that PCI can be achieved by judiciously applying the so-called non-intersecting subspace OSTBCs. The resultant PCI achieving scheme has its number of pilots larger than that used in the previous probability-one identifiability achieving scheme, but smaller than that required in conventional pilot-aided channel estimation. Simulation results are presented to show that the proposed scheme can provide a better performance than the other schemes.
    Relation Link: http://www.ieee.org/
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/68498
    Appears in Collections:[電機工程學系] 會議論文

    Files in This Item:

    File Description SizeFormat


    SFX Query


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback