Victor DeBrunner

Dr. Victor DeBrunner


Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 October 2021 in Signals
Verified
Journal Article
Open access
PDF file
RTRajesh Thomas
Rajesh Thomas
VDVictor DeBrunner
Victor DeBrunner
LDLinda DeBrunner
Linda DeBrunner
Direct computation of the discrete Fourier transform (DFT) and its FFT computational algorithms requires multiplication (and addition) of complex numbers. Complex number multiplication requires four real-valued multiplications and two real-valued additions, or three real-valued multiplications and five real-valued additions, as well as the requisite added memory for temporary storage. In this paper, we present a method for computing a DFT via a natively real-valued algorithm that is computationally equivalent to a N=2k-length DFT (where k is a positive integer), and is substantially more efficient for any other length, N. Our method uses the eigenstructure of the DFT, and the fact that sparse, real-valued, eigenvectors can be found and used to advantage. Computation using our method uses only vector dot products and vector-scalar products.

1 November 2014
Verified
Conference Paper
Closed access
SMSoumak Mookherjee
Soumak Mookherjee
LDLinda DeBrunner
Linda DeBrunner
VDVictor DeBrunner
Victor DeBrunner
In this paper, a high throughput and low power architecture for 256-point FFT processor is proposed which is suitable for both high performance and low power applications. The proposed architecture is based on Radix-4 algorithm. We choose pipelined Multi-path Delay Commutators (MDC) for our design. Two separate datapaths are used in this architecture so that it can process eight inputs in parallel. Thus, the throughput is increased by eight times while achieving 100% hardware utilization. Power consumption of this architecture is shown to be about 50% less than a regular Radix-4 MDC structure for a same throughput. We implement our design in Xilinx FPGA Virtex 5 and compare with regular R4MDC for area, throughput, and power.

2 March 2021 in IEEE Transactions on Circuits and Systems I: Regular Papers
Verified
Journal Article
Closed access
DXDingli Xue
Dingli Xue
LDLinda DeBrunner
Linda DeBrunner
VDVictor DeBrunner
Victor DeBrunner
The Discrete Hirschman Transform (DHT) is more computationally attractive than the Discrete Fourier Transform (DFT). Based on its derived linear convolution, we have confirmed that the DHT-based convolution filter shows its superiority in reducing computations conditionally, while compared with the conventional DFT-based convolution filter in our previous work. Since the DHT-based convolution has many configurations depending on parameter choices, we conjecture that there should be an optimal case for the largest reduction in computations. In this paper, for the DHT-based convolution, we express the requirement in real computations and propose an approach of how to determine the optimal parameters to reduce computations. We further compare the computational load of the optimal DHT-based convolution with that of other popular convolutions. Moreover, its reduction in clock cycles has also been estimated using a Digital Signal Processor (DSP) TMS320C5545. Results indicate that the optimal DHT-based convolution can reduce real computations (multiplications by 9.09%-50% and additions by 1.12%-51.09%) and clock cycles, according to the input length and filter size, except for some cases with identical performance to the radix-2 FFT-based competitor.

11 November 2020 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
DXDingli Xue
Dingli Xue
LDLinda DeBrunner
Linda DeBrunner
VDVictor DeBrunner
Victor DeBrunner
The Discrete Hirschman Transform (DHT) is a generalization of the entropy-based Hirschman Transform that canonically represents digital signals with sparse basis functions. The DHT is computationally attractive in providing the flexibility in hardware implementations since it has a sparse structure that is similar to that of the Discrete Fourier Transform (DFT) basis. This Hirschman-based algorithm has been widely applied in many digital signal processing algorithms such as denoising, filtering, and linear convolution. In this paper, we have developed two fast algorithms: the radix-2 and radix-4 DHT algorithms. These efficient algorithms significantly reduce the number of nontrivial real computations when compared to the original DHT algorithm and other popular Fast Fourier Transforms (FFTs). We show that it is feasible to realize our new algorithms in hardware through the use of a repetitive application of butterfly computations in a structure that will be familiar to those already working with the similar FFT algorithms. Our proposed algorithms reduce the number of nontrivial real computations while efficiently using available hardware resources.

22 March 2004
Verified
Conference Paper
Closed access
VDVictor DeBrunner
Victor DeBrunner
DZDonghua Zhou
Donghua Zhou
MTMinh C. Ta
Minh C. Ta

1 January 2001
Verified
Conference Paper
Closed access
TYT.B. Yap
T.B. Yap
JHJ.P. Havlicek
J.P. Havlicek
VDVictor DeBrunner
Victor DeBrunner
We present a fully unsupervised parametric modulation domain technique for segmenting textured images. Textured regions in the image are modeled as multicomponent sums of nonstationary AM-FM functions. The dominant modulations at each pixel are estimated using a technique called DCA and used to construct modulation domain feature vectors. The overall feature space is regarded as a mixture of Gaussians, where the modulations within each texture class are modeled by a single multivariate normal distribution. Although this model is somewhat unrealistic, it leads to a robust segmentation algorithm that is able to operate in a fully unsupervised mode. An EM algorithm is used to estimate the parameters of the Gaussian mixture so that approximate maximum-likelihood estimates of the pixel class labels can be obtained. The proposed technique is demonstrated on a variety of images constructed from juxtapositions of Brodatz-like textures.