Data-recovery algorithm and circuit for cyclic convolution based on FNT
スポンサーリンク
概要
- 論文の詳細を見る
The existing cyclic convolution based on Fermat number transform(FNT) cant produce the same results as the conventional one based on fast Fourier transform (FFT) due to the impact of modular operation in many cases. To overcome the problem, this paper proposes a novel data-recovery algorithm (DRA) for the cyclic convolution based on FNT with transform kernel 2 or its integer power in the ordinary binary number system. Then an efficient data-recovery circuit (DRC) is designed to implement the algorithm in the diminished-1 number systems, involving parallel-prefix carry computation units. The DRA and the DRC can eliminate the impact of modular operation and make the cyclic convolution based on FNT produce the correct resulting sequences. Synthesis results show that delay and area of the n-bit DRC are both less than the ones of an n-bit parallel-prefix adder (PPA).
著者
-
Li Shuguo
Institute of Microelectronics, Tsinghua University
-
Zhang Jian
Institute of Microelectronics, Tsinghua University
-
Zhang Jian
Institute Of Applied Ecology Chinese Academy Of Science
関連論文
- Data-recovery algorithm and circuit for cyclic convolution based on FNT
- Efficient FPGA implementation of sharp FIR filters using the FRM technique
- The Effect of Different Species Aminopeptidase N Structure on the Activity Screening of Aminopeptidase N Inhibitor
- Opposing effects of interferon-α and interferon-γ on the expression of major histocompatibility complex class I chain-related A in tumors
- Cisplatin up-regulates ICAM-1 expression in endothelial cell via a NF-κB dependent pathway
- Spatial variation of species diversity across scales in an old-growth temperate forest of China