English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 94201/94201 (100%)
造訪人次 : 81832568      線上人數 : 2722
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: https://ir.lib.ncu.edu.tw/handle/987654321/105876


    題名: Blind iterative maximum likelihood-based frequency and transition time estimation for frequency hopping systems
    作者: 陳永芳;Fu, Kuo-Ching;Chen, Yung-Fang
    貢獻者: 資訊電機學院通訊工程學系
    關鍵詞: blind iterative maximum likelihood‐based frequency;Blinds;Complexity;computational complexity;Computer simulation;Convergence;Effectiveness;estimation problems;frequency estimation;Frequency hopping;frequency hopping systems;frequency‐hopping spread spectrum;frequency‐hopping spread spectrum systems;greedy algorithms;iterative assemble algorithm;iterative disassemble algorithm;iterative fashion;Iterative methods;maximum likelihood estimation;maximum‐likelihood greedy search algorithm;search problems;spread spectrum communication;Spreads;synchronisation;timing synchronisation;transition time estimation
    日期: 2013-08-15
    上傳時間: 2026-04-23 12:58:35 (UTC+8)
    出版者: Institution of Engineering and Technology;Stevenage: The Institution of Engineering and Technology
    摘要: 摘要: Timing synchronisation and frequency estimation are two major estimation problems for frequency-hopping spread spectrum systems. We present a blind scheme for estimating frequency and transition time in an iterative fashion: the iterative disassemble and assemble algorithm. The proposed scheme does not require initial random guesses as with common iterative algorithms. Improper initial guesses may suffer from the problem of convergence to the local maximum. The proposed approach can converge to the global maximum in order to achieve the solution. The proposed scheme offers a much lower computational complexity than that of the maximum-likelihood greedy search algorithm. Moreover, it also outperforms existing schemes with comparable complexity. The simulation results demonstrate the efficacy of the proposed approach.
    出版者: Stevenage: The Institution of Engineering and Technology
    出版日期: 2013-06
    出處: IET communications, 2013-06, Vol.7 (9), p.883-892
    資源來源: Wiley Online Library Open Access
    版權: The Institution of Engineering and Technology
    版權: 2021 The Institution of Engineering and Technology
    版權: Copyright The Institution of Engineering & Technology Jun 2013
    識別號: ISSN: 1751-8628
    識別號: ISSN: 1751-8636
    識別號: EISSN: 1751-8636
    識別號: DOI: 10.1049/iet-com.2012.0557
    顯示於類別:[通訊工程學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML12檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明