S. I. Hariharan

S. I. Hariharan

Auto-generated profile, based on publicly available information

S. I. Hariharan

Ocius Technologies, Akron, OH, USA

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

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

Representative Publications

View All Publications
5 August 2009 in BioMedical Engineering OnLine
Verified
Journal Article
Open access
PDF file
SKSaket S Kulkarni
Saket S Kulkarni
NRNarender P Reddy
Narender P Reddy
SHSi Hariharan
Si Hariharan
Background: Facial expressions are important in facilitating human communication and interactions. Also, they are used as an important tool in behavioural studies and in medical rehabilitation. Facial image based mood detection techniques may provide a fast and practical approach for non-invasive mood detection. The purpose of the present study was to develop an intelligent system for facial image based expression classification using committee neural networks. Methods: Several facial parameters were extracted from a facial image and were used to train several generalized and specialized neural networks. Based on initial testing, the best performing generalized and specialized neural networks were recruited into decision making committees which formed an integrated committee neural network system. The integrated committee neural network system was then evaluated using data obtained from subjects not used in training or in initial testing. Results and conclusion: The system correctly identified the correct facial expression in 255 of the 282 images (90.43% of the cases), from 62 subjects not used in training or in initial testing. Committee neural networks offer a potential tool for image based mood detection.

17 September 2020 in IEEE Journal of Solid-State Circuits
Verified
Journal Article
Closed access
NUNilan Udayanga
Nilan Udayanga
AMArjuna Madanayake
Arjuna Madanayake
SHS. I. Hariharan
S. I. Hariharan
JLJifu Liang
Jifu Liang
Soumyajit MandalSoumyajit Mandal
Soumyajit Mandal
LBLen T. Bruton
Len T. Bruton
Software-programmable analog computing is proposed for power- and area-efficient acceleration of computational electromagnetics. All-pass filters are employed to realize a continuous-time finite-difference time-domain (FDTD) algorithm. A CMOS realization of an analog computer (AC) that solves the 1-D wave equation using this time-continuous FDTD algorithm at an equivalent temporal update rate of 625 MHz is reported (180-nm CMOS, chip area of 4 mm², supply voltage =1.8 V, and power =200 mW). The AC operates at up to 30 MHz over 18 discrete spatial points. Analog arithmetic operations (multiply and add) are realized in parallel using op-amps with gain-bandwidth product >500 MHz. Computational grid boundaries can be configured to simulate multiple propagation scenarios. The AC is calibrated using a stochastic optimization algorithm. The normalized mean squared error of the AC varies between -10 and -20 dB within the computational grid. The power- and area-normalized performance of the design improves on earlier integrated ACs by up to three orders of magnitude. The chip is also 26x faster than a C-based software FDTD solver running on an Intel Xeon CPU and 420x faster than CUDA FDTD code running on an NVIDIA GeForce GTX 1080 Ti GPU, albeit at lower accuracy (~6 bits). Finally, the AC is 2.8x faster than a digital systolic array FDTD processor realized using a Xilinx RFSoC ZCU1275 and has 15x better power efficiency (computations/W).

6 May 2021 in IEEE Journal of Solid-State Circuits
Verified
Journal Article
Closed access
JLJifu Liang
Jifu Liang
NUNilan Udayanga
Nilan Udayanga
AMArjuna Madanayake
Arjuna Madanayake
SHS. I. Hariharan
S. I. Hariharan
Soumyajit MandalSoumyajit Mandal
Soumyajit Mandal
This article describes a single-chip analog computer for solving 1-D wave equations. The chip uses switched-capacitor (SC)-based fully differential analog circuits to build a discrete-time but continuous-valued finite difference solver with spatially programmable wave velocity, selectable boundary conditions, and arbitrary input excitation waveforms. Correlated double sampling (CDS) and auto-zero techniques are utilized to minimize the offset and low-frequency noise of the op-amps. Built-in third-order Δ- Σ modulators allow the analog solution to be easily read out by a digital processor. The design was realized in TSMC 180-nm CMOS and has an active area of 3.596 mm ×3.131 mm. The solver consumes 560 mW while providing a dynamic range (DR) of 41 dB and a computational bandwidth of either 2.5 MHz (if limited by the analog core) or 0.25 MHz (if limited by the on-chip modulators). Normalized mean squared solution errors for a typical problem (uniform medium with radiation boundary condition) range from 0.3% to 2% (-25 to -17 dB). Measured simulation times are 21×, 5×, and 1.3× faster than CUDA-C code running on a modern GPU (NVIDIA GTX 1080 Ti) and MATLAB or C code running on an 8-core CPU (Intel Xeon Silver 4110 at 2.10 GHz), respectively.

9 June 2021 in IEEE Transactions on Circuits and Systems I: Regular Papers
Verified
Journal Article
Closed access
HMHasantha Malavipathirana
Hasantha Malavipathirana
SHS. I. Hariharan
S. I. Hariharan
NUNilan Udayanga
Nilan Udayanga
SMSoumyajit Mandal
Soumyajit Mandal
AMArjuna Madanayake
Arjuna Madanayake
A general-purpose analog computing method is proposed to compute the continuous-time solutions of nonlinear partial differential equations (PDEs). The discrete-time difference operator in the standard finite difference time domain (FDTD) method is replaced by continuous-time delay operators that can be realized using analog all-pass filters. The resulting spatially discrete time-continuous (SDTC) update equations are realized using analog circuits which compute continuous-time solutions of the PDE with prescribed initial and boundary conditions. The proposed concept is demonstrated in simulation via an integrated circuit (IC) design of a nonlinear acoustic wave equation solver in 180 nm CMOS technology. Analog arithmetic operations (multiply, scale, and add) are realized in parallel using fully differential op-amps and analog multipliers. The proposed IC computes the PDE solution in parallel at 33 discrete spatial points and has a simulated bandwidth and power consumption of approximately 2 MHz and 3 W, respectively. The performance of the IC is simulated using foundry-supplied device models and quantified using i) the mean squared difference between the circuit simulation results and FDTD simulations, and ii) the noise to signal energy ratio. Acceptable accuracy is obtained, with error metric values varying between -7 and -30 dB for various configurations of the problem. Comparison of the custom analog IC simulations with MATLAB- and C-based FDTD code running on a modern workstation shows an expected average speedup of 205× and 140×, respectively.

14 March 2014 in IEEE Antennas and Wireless Propagation Letters
Verified
Journal Article
Closed access
AMArjuna Madanayake
Arjuna Madanayake
CWChamith Wijenayake
Chamith Wijenayake
SWSewwandi Wijayaratna
Sewwandi Wijayaratna
RARoberto Acosta
Roberto Acosta
SHS. I. Hariharan
S. I. Hariharan
A uniform linear array (ULA) digital beamformer with enhanced selectivity (interference rejection) over conventional true-time delay-sum (TTDS) beamforming is proposed for scanned aperture applications. Conventional TTDS transfer function, which contains only zero-manifolds, is modified by introducing complex pole-manifolds based on 2-D infinite impulse response (IIR) digital beam filters, thereby achieving enhanced selectivity for the same number of antennas in the ULA. For a ULA of 64 antennas, desired direction of arrival (DOA) 30° and interference DOA -60° from array broadside, a relative improvement in signal-to-interference ratio (SIR) of 7 dB is verified. For 128-element ULA, interference DOA -10°, a relative improvement in SIR of 5-10 dB is obtained for the desired DOA in the range 10°-90°. The projected improvements are independent of the weights of the conventional phased-array, TTDS, or filter-sum beamformer used because the method does not change the zero-manifolds of the original array pattern.

20 November 1995 in Applied Optics
Verified
Journal Article
Closed access
PDF file
SHS. I. Hariharan
S. I. Hariharan
DJDavid K. Johnson
David K. Johnson
Optics InfoBase is the Optical Society's online library for flagship journals, partnered and copublished journals, and recent proceedings from OSA conferences.