EFFICIENT FFT SIMULATION OF DIGITAL TIME SEQUENCES

被引：1
|
作者：
Hudspeth, Robert T.
Borgman, Leon E.
机构：
来源：
| 1979年 / 105卷 / 02期
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
MECHANICS
引用
收藏
页码：223 / 235
相关论文
共 50 条
  • [21] COMMUNICATION EFFICIENT MULTIPROCESSOR FFT
    JOHNSSON, SL
    JACQUEMIN, M
    KRAWITZ, RL
    JOURNAL OF COMPUTATIONAL PHYSICS, 1992, 102 (02) : 381 - 397
  • [22] Efficient path integration by FFT
    Mo, Eirik
    Naess, Arvid
    APPLICATIONS OF STATISICS AND PROBABILITY IN CIVIL ENGINEERING, 2007, : 17 - 17
  • [23] Efficient mining of frequent closed sequences with time constraints
    Huang G.
    Li M.
    Ren J.
    Journal of Convergence Information Technology, 2011, 6 (10) : 129 - 136
  • [24] Efficient real-time correlator for LS sequences
    Perez, M. C.
    Urena, J.
    Hernandez, A.
    Jimenez, A.
    Marnane, W. R.
    Alvarez, F.
    2007 IEEE INTERNATIONAL SYMPOSIUM ON INDUSTRIAL ELECTRONICS, PROCEEDINGS, VOLS 1-8, 2007, : 1663 - +
  • [25] An Efficient Parallel Algorithm for FFT
    乔香珍
    JournalofComputerScienceandTechnology, 1987, (03) : 174 - 190
  • [26] An efficient pipelined FFT architecture
    Chang, YN
    Parhi, KK
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2003, 50 (06) : 322 - 325
  • [27] Efficient Generation of fα Noise Sequences for Pulsed Radar Simulation
    Brooker, Marc
    Inggs, Michael
    IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 2010, 46 (02) : 737 - 744
  • [28] EFFICIENT TIME DOMAIN SIMULATION OF WAVES
    Lundback, Olov
    MARINE 2019: COMPUTATIONAL METHODS IN MARINE ENGINEERING VIII: VIII INTERNATIONAL CONFERENCE ONCOMPUTATIONAL METHODS IN MARINE ENGINEERING (MARINE 2019), 2019, : 771 - 782
  • [29] Simulation of rough surfaces with FFT
    Wu, JJ
    TRIBOLOGY INTERNATIONAL, 2000, 33 (01) : 47 - 58
  • [30] FFT-BASED DIGITAL TACTILE VOCODER SYSTEM FOR REAL-TIME USE
    OZDAMAR, O
    LOPEZ, CN
    OLLER, DK
    EILERS, RE
    MISKIEL, E
    LYNCH, MP
    MEDICAL & BIOLOGICAL ENGINEERING & COMPUTING, 1992, 30 (02) : 213 - 218
12345