نتایج جستجو برای: hartley functions

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

2015
Nagesh V. Anupindi Sri Nagesh Anupindi Soo Chang

Finding the spectrum of a signal swiftly has been an ever-growing demand in Digital Signal Processing. In quest to meet this stipulation, Discrete Hartley Transform (DHT) is becoming as an encouraging substitute to the more popular discrete Fourier transform. Fast methods to compute the DHT are in existence and are named as fast Hartley transforms (FHTs). In this thesis, a new split-radix FHT a...

2014
Jin-Yin Yan Fa-Ming Tian Wen-Ya Wang Ying Cheng Hua-Fang Xu Hui-Ping Song Ying-Ze Zhang Liu Zhang

The Dunkin Hartley (DH) guinea pig is a widely used naturally occurring osteoarthritis model. The aim of this study was to provide detailed evidence of age-related changes in articular cartilage, subchondral bone mineral density, and estradiol levels. We studied the female Dunkin Hartley guinea pigs at 1, 3, 6, 9, and 12 months of age (eight animals in each group). Histological analysis were us...

Journal: :IEEE Trans. Signal Processing 1992
Adam C. Erickson Barry S. Fagin

We have developed a parallel, pipelined architecture for calculating the Fast Hartley Transform. Hardware implementation of the FHT introduces two challenges: retrograde indexing and data scaling. We propose a novel addressing scheme that permits the fast computation of FHT butterflies, and describe a hardware implementation of conditional block floating point scaling that reduces error due to ...

2006
R. K. AMAYO

1.1 We prove that: Over any field I of characteristic p > 0, there exists an infinite dimensional Lie algebra which is the join of two (p + l)-dimensional and nilpotent (of class exactly p) subideals. A result of Hartley ([2; p. 259, theorems 2 and 5]) states that over any field of characteristic zero, the join of a pair of finite dimensional (resp. finite dimensional and nilpotent) subideals i...

1999
Michael Felsberg Gerald Sommer

In this article, we deal with fast algorithms for the quater-nionic Fourier transform (QFT). Our aim is to give a guideline for choosing algorithms in practical cases. Hence, we are not only interested in the theoretic complexity but in the real execution time of the implementation of an algorithm. This includes oating point multiplications, additions, index computations and the memory accesses...

Journal: :Proceedings of the National Academy of Sciences of the United States of America 2009
Chun-I Yeh Dajun Xing Patrick E Williams Robert M Shapley

The concept of receptive field is a linear, feed-forward view of visual signal processing. Frequently used models of V1 neurons, like the dynamic Linear filter--static nonlinearity--Poisson [corrected] spike encoder model, predict that receptive fields measured with different stimulus ensembles should be similar. Here, we tested this concept by comparing spatiotemporal maps of V1 neurons derive...

2011
P. Thangaraj

In the first step, the EEG signal from each electrode is converted to the frequency domain using the Fast Hartley Transform. Artifacts in the transformed signal using the frequency domain were removed using a band pass Chebyshev filter such that only frequencies in the range of 5-15 Hz is retained. The minimum energy, maximum energy and the average energy is computed. The computed features are ...

2007
A. L. POPE

N UTRITIONAL m u s c u l a r d y s t r o p h y (NMD) occurs spontaneously in lambs in many areas (Allaway and Hodgson, 1964; Hartley and Grant, 1961; and Muth, 1963) and can result in substantial economic loss to flock owners. Willman et al. (1945) demonstrated that vitamin E was effective in preventing and curing NMD. However, Muth (1955) and Hartley and Grant (1961) observed that vitamin E ha...

Journal: :IEEE Trans. Signal Processing 2001
Said Boussakta Osama Alshibami M. Y. Aziz

The discrete Hartley transform (DHT) has proved to be a valuable tool in digital signal/image processing and communications and has also attracted research interests in many multidimensional applications. Although many fast algorithms have been developed for the calculation of oneand two-dimensional (1-D and 2-D) DHT, the development of multidimensional algorithms in three and more dimensions i...

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

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