Selected Research Highlights
- First Formulation of Algorithm Transformations for DSP Computing (Proc. IEEE, Dec. 1989)
- First Formulation and introduction of the folding algorithm to synthesize time-multiplexed DSP circuits from data-flow graphs for specified folding sets (IEEE JSSC, Jan. 1992)
- First Formulation and introduction of the unfolding algorithm to unfold or unroll digital signal processing data-flow graphs (IEEE Trans. Computers, Feb. 1991)
- First formulation of retiming and folding for multi-rate digital signal processing data-flow graphs (IEEE T-VLSI, Dec. 1998)
- First exhaustive generation of all retiming and scheduling solutions for digital signal processing data-flow graphs (IEEE T-CAS-II, July 1998)
- Loop scheduling algorithms and the MARS DSP Synthesis Tool (IEEE T-CAD, March 1995)
- HEAT tool for Power estimation in DSP Systems (IEEE D&T Magazine, April 2000) , (DAC, 1996)
- A maximum cycle mean algorithm for computing iteration period bound of DSP data-flow graphs (Springer JSPS, Dec. 1995)
- First pipelining of IIR digital filters using scattered look-ahead transformation (IEEE T-ASSP, Part-I, July 1989)
- First combined pipelining and parallel processing of IIR digital filters (IEEE T-ASSP, Part-II, July 1989)
- First approach to pipelining quantizer loop based DSP algorithms using parallel-branch and delayed-decision techniques (IEEE T-CAS, July 1991)
- First pipelining of lattice IIR Digital filters (IEEE T-SP, April 1994)
- First formulation of relaxed look-ahead transformation for pipelining the LMS Adaptive filter (IEEE T-CAS-II, Dec. 1993)
- First pipelining of the QRD-RLS Adaptive filter using annihilation reordering transformation (IEEE T-SP, Aug. 2000)
- First pipelining and parallel processing of the Tomlinson-Harashima precoder (IEEE T-CAS-I, Sept. 2007) ( IEEE T-CAS-II, May 2008)
- Arbitrary concurrency in Huffman decoders (IEEE ICASSP 1999)
- Arbitrary concurrency in CRC checks, BCH encoders, and linear feedback shift registers (IEEE TCAS-I, March 2004), (IEEE T-SP, Sept. 2011)
- An architecture for discrete wavelet transform (IEEE T-VLSI, June 1993)
- First optimization of FFT architectures for real input signals (IEEE T-CAS-I, Dec. 2009) , (Springer JSPS, Oct. 2018) (EURASIP JASP, June 2017), (Asilomar, 2014), (Asilomar, 2015)
- Generalized FFT Architectures using Folding (IEEE T-VLSI, June 2012)
- Low-Energy Architectures for Welch Power Spectral Density (IEEE T-CAS-I, Jan. 2014)
- First architectures for multi-gigabit decision feedback equalizers (IEEE T-VLSI, April 2005)
- Pipelined parallel decision feedback decoder (IEEE T-SP, Feb. 2007)
- Complexity reduction in parallel FIR filter (Springer September 1997) (IEEE T-CAS-I, Aug. 2004)
- FEXT cancellation and equallization for 10-gigabit ethernet (IEEE T-CAS-I, June 2009)
- A new low-power binary adder (IEEE T-VLSI, Dec. 1999)
- High-speed architectures for the AES algorithm (IEEE T-VLSI, Sept. 2004)
- MUX Feed-Forward XOR Physical Unclonable Functions (IEEE TIFS, 2020)
- Functional Encryption/Obfuscation of Chips using Keys that that are harder to reverse engineer (IEEE T-VLSI, May 2015) (IEEE TIFS, Jan. 2018)
- Fast Polynomial Modular Multiplication in Time-Domain (IEEE Trans. Computers, Sept. 2023)
- Fast Polynomial Modular Multiplication using NTT (IEEE TIFS, 2024), (IEEE TVLSI, Sept. 2025)
- True Random Number Generators (ACM JETC, April 2016)