Fast algorithms for DFT of composite sequence lengths

被引：0
|
作者：
Nanyang Technological Univ, Singapore, Singapore [1 ]
机构：
来源：
Signal Process | / 2卷 / 139-145期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [41] EDGE LENGTHS OF TREES FROM SEQUENCE DATA
    HENDY, MD
    PENNY, D
    MATHEMATICAL BIOSCIENCES, 1987, 83 (02) : 157 - 165
  • [42] Fast Dual-Tree Wavelet Composite Splitting Algorithms for Compressed Sensing MRI
    Li, Jianwu
    Zhou, Jinpeng
    Tu, Qiang
    Ikram, Javaria
    Dong, Zhengchao
    NEURAL INFORMATION PROCESSING, ICONIP 2016, PT I, 2016, 9947 : 517 - 525
  • [43] High-dimensional composite quantile regression: Optimal statistical guarantees and fast algorithms
    Moon, Haeseong
    Zhou, Wen-Xin
    ELECTRONIC JOURNAL OF STATISTICS, 2023, 17 (02): : 2067 - 2119
  • [44] Analysis of DFT-based frequency excision algorithms for direct-sequence spread-spectrum communications
    Young, JA
    Lehnert, JS
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1998, 46 (08) : 1076 - 1087
  • [45] Fast algebraic convolution for prime power lengths
    Creutzburg, R
    Minkwitz, T
    ICECS 2001: 8TH IEEE INTERNATIONAL CONFERENCE ON ELECTRONICS, CIRCUITS AND SYSTEMS, VOLS I-III, CONFERENCE PROCEEDINGS, 2001, : 1073 - 1076
  • [46] Analysis of DFT-based frequency excision algorithms for direct-sequence spread-spectrum communications
    Harmon Industries, Grain Valley, United States
    IEEE Trans Commun, 8 (1076-1087):
  • [47] Performance Modeling for DFT Algorithms in FFTW
    Gu, Liang
    Li, Xiaoming
    ICS'09: PROCEEDINGS OF THE 2009 ACM SIGARCH INTERNATIONAL CONFERENCE ON SUPERCOMPUTING, 2009, : 507 - 508
  • [48] Recursive sliding DFT algorithms: A review
    Chauhan, Abhishek
    Singh, Ksh Milan
    DIGITAL SIGNAL PROCESSING, 2022, 127
  • [49] Algorithms for computing lengths of chains in integral partition lattices
    Wan, HH
    Wootton, JC
    THEORETICAL COMPUTER SCIENCE, 2002, 289 (01) : 783 - 800
  • [50] FAST SUBSUMPTION ALGORITHMS
    GOTTLOB, G
    LEITSCH, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1985, 204 : 64 - 77
12345