نتایج جستجو برای: discrete fourier transform

تعداد نتایج: 281989  

Journal: :Jurnal Matematika, Statistika dan Komputasi 2020

Journal: :International Journal for Research in Applied Science and Engineering Technology 2018

Journal: :IEICE Transactions on Information and Systems 2014

Journal: :Science China Information Sciences 2019

Journal: :IEEE Transactions on Signal Processing 2021

A binary vector of length $N$ has elements that are either 0 or 1. We investigate the question whether and how a known can be reconstructed from limited set its discrete Fourier transform (DFT) coefficients. priori information is provides powerful constraint. prove uniquely defined by two complex DFT coefficients (zeroth, which gives popcount, first) if prime. If prime factors, additional must ...

Journal: :IEEE Access 2021

In this work, we present two parallel algorithms for the large-scale discrete Fourier transform (DFT) on Tensor Processing Unit (TPU) clusters. The are associated with DFT formulations: one formulation, denoted as KDFT, is based Kronecker product; other famous Cooley-Tukey algorithm and phase adjustment, FFT. Both KDFT FFT formulations take full advantage of TPU's strength in matrix multiplicat...

Journal: :Advances in Applied Mathematics 1985

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید