Showing 1 - 7 results of 7 for search '曾凡鑫' Skip to content
    • About the Library
    • Rules and Regulations
    • Library Services
    • Library Hours
  • Library News
    • Digital Repository
    • Google Scholar
    • ResearchGate
    • AJoGPL
    • KURJ
    • AJLS
    • MyLOFT
    • Lexis Plus UK
    • Up-to-Date Database
    • Research Support Tools
    • Quick Resource Links
  • Login
Advanced
  • Author
  • 曾凡鑫
Showing 1 - 7 results of 7 for search '曾凡鑫', query time: 0.01s Refine Results
  1. 1
    关于本原M序列的一些自相关函数取值

    关于本原M序列的一些自相关函数取值 by 曾凡鑫

    Published 1997-01-01
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    基于广义最小均方的自适应递归滤波算法

    基于广义最小均方的自适应递归滤波算法 by 曾凡鑫

    Published 1992-01-01
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    二元非线性等重码的构造与检错性能

    二元非线性等重码的构造与检错性能 by 曾凡鑫

    Published 1999-01-01
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    一种低计算量的ARMA谱估计

    一种低计算量的ARMA谱估计 by 曾凡鑫, 王兵

    Published 1993-01-01
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    QS-THSS-UWB中具有二级低碰撞区特性的跳时序列构造

    QS-THSS-UWB中具有二级低碰撞区特性的跳时序列构造 by 张振宇, 曾凡鑫, 葛利嘉

    Published 2005-01-01
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    MC-CDMA系统中具有组内互补特性的序列构造

    MC-CDMA系统中具有组内互补特性的序列构造 by 张振宇, 曾凡鑫, 宣贵新, 吴华, 仲元红

    Published 2011-01-01
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    QS-THSS-UWB中具有二级低碰撞区特性的跳时序列构造                                                                                                                        附视频

    QS-THSS-UWB中具有二级低碰撞区特性的跳时序列构造 附视频... by 张振宇, 曾凡鑫, 葛利嘉, 1.重庆通信学院信息工程系, 2.重庆通信学院信息工程系, 3.重庆通信学院信息工程系 重庆400035, 4.重庆400035, 5.重庆400035

    Published 2005-01-01
    Get full text
    Article
    Save to List
    Saved in:

Search Tools:

  • RSS Feed
  • Email Search

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs