FFT algorithms with the constant calculation structure at all iterations

被引：0
|
作者：
机构：
来源：
Izv VUZ Radioelektron | / 1卷 / 68-73期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] MODIFIED FFT ALGORITHMS WITH DECREASED MULTIPLICATIONS
    GRECHISHNIKOV, AI
    RADIOTEKHNIKA I ELEKTRONIKA, 1983, 28 (01): : 195 - 197
  • [32] FFT algorithms and their adaptation to parallel processing
    Chu, E
    George, A
    LINEAR ALGEBRA AND ITS APPLICATIONS, 1998, 284 (1-3) : 95 - 124
  • [33] PARALLEL FFT ALGORITHMS FOR MIMD COMPUTERS
    FUNG, MK
    NANDI, AK
    ELECTRONICS LETTERS, 1991, 27 (03) : 286 - 288
  • [34] A Common Operator for FFT and Viterbi algorithms
    Naoues, Malek
    Alaus, Laurent
    Noguet, Dominique
    13TH EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN: ARCHITECTURES, METHODS AND TOOLS, 2010, : 309 - 313
  • [35] Algorithms for FFT Beamforming Radio Interferometers
    Masui, Kiyoshi W.
    Shaw, J. Richard
    Ng, Cherry
    Smith, Kendrick M.
    Vanderlinde, Keith
    Paradise, Adiv
    ASTROPHYSICAL JOURNAL, 2019, 879 (01):
  • [36] On the number of iterations for convergence of CoSaMP and Subspace Pursuit algorithms
    Satpathi, Siddhartha
    Chakraborty, Mrityunjoy
    APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2017, 43 (03) : 568 - 576
  • [37] Arc consistency algorithms via iterations of subsumed functions
    Gennari, R
    COMPUTATIONAL LOGIC - CL 2000, 2000, 1861 : 358 - 372
  • [38] Starting algorithms for the iterations of the RKN-Gauss methods
    Laburta, MP
    APPLIED NUMERICAL MATHEMATICS, 1999, 31 (01) : 81 - 101
  • [39] Decoding algorithms by reducing iterations based on convergence criterion
    Fan, Ce
    Liu, Peihua
    IEEE ICMA 2006: PROCEEDING OF THE 2006 IEEE INTERNATIONAL CONFERENCE ON MECHATRONICS AND AUTOMATION, VOLS 1-3, PROCEEDINGS, 2006, : 2367 - +
  • [40] Constant time algorithms for the 3-D all nearest neighbor problem on the LARPBS
    Wang, YR
    Horng, SJ
    PARALLEL AND DISTRIBUTED COMPUTING: APPLICATIONS AND TECHNOLOGIES, PROCEEDINGS, 2004, 3320 : 243 - 247
12345