Results 81 to 90 of about 51,064 (263)

Calculation Scheme Based on a Weighted Primitive: Application to Image Processing Transforms

EURASIP Journal on Advances in Signal Processing, 2007
This paper presents a method to improve the calculation of functions which specially demand a great amount of computing resources. The method is based on the choice of a weighted primitive which enables the calculation of function values under the scope ...
Gregorio de Miguel Casado, Higinio Mora Mora, Juan Manuel García Chamizo, María Teresa Signes Pont   +3 more
doaj   +2 more sources

Water‐Soluble Metal Phthalocyanines Enable Molecularly Dispersed Heterogeneous Electrochemical CO2 Conversion

Advanced Science, EarlyView.
Water‐soluble metallophthalocyanines self‐assemble onto the surface of carbon black via π–π interactions, creating highly dispersed and electronically coupled MPcTs/CB, which enables selective CO2‐to‐CO conversion in aqueous media with near‐quantitative Faradaic efficiency and remarkable stability. Optimized flow‐cell operation delivers up to 500 mA cm−
Xiangyu Zhang, Shoulong Pan, Yu Li, Pan Li, Zizi Ruan, Qing Bai, Qinglin Jiang, Cheng Zhou, Bing Yang, Liang Yao, Yuguang Ma   +10 more
wiley   +1 more source

In Situ Quantization with Memory‐Transistor Transfer Unit Based on Electrochemical Random‐Access Memory for Edge Applications

Advanced Science, EarlyView.
By combining ionic nonvolatile memories and transistors, this work proposes a compact synaptic unit to enable low‐precision neural network training. The design supports in situ weight quantization without extra programming and achieves accuracy comparable to ideal methods. This work obtains energy consumption advantage of 25.51× (ECRAM) and 4.84× (RRAM)
Zhen Yang, Yuxiang Yang, Baiqian Wang, Yaoyu Tao, Zelun Pan, Lei Cai, Teng Zhang, Longhao Yan, Xianbin Li, Yuchao Yang   +9 more
wiley   +1 more source

A VLSI pipeline design of a fast prime factor DFT on a finite field [PDF]

A conventional prime factor discrete Fourier transform (DFT) algorithm is used to realize a discrete Fourier-like transform on the finite field, GF(q sub n). A pipeline structure is used to implement this prime factor DFT over GF(q sub n). This algorithm
Hsu, I. S., Reed, I. S., Shao, H. M., Shyu, H. C., Truong, T. K.   +4 more
core   +1 more source

Mendisain GUI untuk Menampilkan Nilai FFT dan IFFT Menggunakan LabVIEW [PDF]

, 2019
Methods FFT (Fast Fourier Transform) is a method for solving discrete signals which method IFFT (Inverse Fast Fourier Transform) is the reciprocal of the FFT method. Basically FFT only used for transformation and must not be separated from the method DFT
Alfina, R. (Riny), Arifianto, I. (Indrawan), Astharini, D. (Dwi), Wulandari, P. (Putri)   +3 more
core  

Properties of continuous Fourier extension of the discrete cosine transform and its multidimensional generalization

, 2003
A versatile method is described for the practical computation of the discrete Fourier transforms (DFT) of a continuous function $g(t)$ given by its values $g_{j}$ at the points of a uniform grid $F_{N}$ generated by conjugacy classes of elements of ...
A. Atoyan, Bracewell R. N., Gentleman W. M., J. Patera, Kac V. G., Makhoul J., McKay W. G., Narasimha M. J., Rader C. M., Shannon C. E., Singleton R. C., Strang G., Tseng B. D., Vetterli M., Wang Z., Winograd S.   +15 more
core   +1 more source

Probing Ultrastrong Through‐Space Electronic Coupling in Donor‐Acceptor Systems at the Single‐Molecule Level

Advanced Science, EarlyView.
A series of through‐space coupled donor‐acceptor (D–A) molecules is sandwiched between two electrodes to determine their single‐molecule conductance. As the D–A interaction weakens, single‐molecule conductance reduces while Flicker Noise PSD n‐value increases (coupling strength decreases).
Xin Wang, Dan Yang, Jiazheng Diao, Jens Ulstrup, Chengyang Zhang, Florian Auras, Qiang Fu, Jinlong Yang, Linsong Cui, Yueqi Li, Jinghong Li   +10 more
wiley   +1 more source

A separable two-dimensional discrete Hartley transform [PDF]

Bracewell has proposed the Discrete Hartley Transform (DHT) as a substitute for the Discrete Fourier Transform (DFT), particularly as a means of convolution.
Poirson, A., Watson, A. B.
core   +1 more source

Ion‐Confinement‐Assisted Erasure Purifies Oxidized MXene for Reuse

Advanced Science, EarlyView.
An erasure‐purification strategy removes surface‐derived TiO2 from oxidized Ti3C2Tx MXene by ion‐confinement‐induced interfacial conversion to soluble titanates, followed by brief acid washing. The scalable process enables approximately 70% material recovery, restores electrical conductivity, and recovers functional performance, including high ...
Xuefeng Zhang, Yujia Wu, Huayu Xu, Jinyi Ye, Yanfang Yang, Haohan Wu, Jiayi Lu, Hao Li, Dongxiao Kan, Jingfeng Wang, Hui Kang, Zhimin Fan   +11 more
wiley   +1 more source

Type-II/III DCT/DST algorithms with reduced number of arithmetic operations

, 2009
We present algorithms for the discrete cosine transform (DCT) and discrete sine transform (DST), of types II and III, that achieve a lower count of real multiplications and additions than previously published algorithms, without sacrificing numerical ...
Ahmed, Arai, Arguello, Astola, Chan, Chen, Crochiere, Duhamel, Duhamel, Duhamel, Feig, Frigo, Frigo, Gentleman, Gopinath, Guo, Haralick, Hou, Johnson, Kamar, Kok, Krot, Lee, Lee, Li, Lundy, Makhoul, Malvar, Martens, Narasimha, Pennebaker, Plonka, Press, Püschel, Qian, Rao, Schatzman, Sorensen, Steidl, Steven G. Johnson, Suehiro, Swarztrauber, Takala, Tasche, Tseng, van Loan, Vetterli, Wang, Wang, Xuancheng Shao, Yaroslavskii, Yavne   +51 more
core   +2 more sources