Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Arun Raghupathy

dblp:50/4909 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2003
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Integrated circuit design · 61% Energy-efficient computing · 30% Reconfigurable computing and FPGAs · 9%
Computer graphics and multimedia
1 paper
Image and video processing · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video processing › image resampling
image rescaling
0.012003
Algorithm and VLSI architecture for high performance adaptive video scaling · IEEE Trans. Multim. 2003
Integrated circuit design
ASIC design
0.012003
Algorithm and VLSI architecture for high performance adaptive video scaling · IEEE Trans. Multim. 2003
Energy-efficient computing
energy-efficient signal processing
0.011998
Algorithm-based low-power and high-performance multimedia signal processing · Proc. IEEE 1998
Reconfigurable computing and FPGAs
reconfigurable computing
0.011998
Algorithm-based low-power and high-performance multimedia signal processing · Proc. IEEE 1998

Methods — techniques the papers use, named apart from their topics

oriented polynomial image model · 0.1nonlinear oriented interpolation · 0.1multirate signal processing · 0.0filterbank design · 0.0
YearPublicationVenuePosition
2003 Algorithm and VLSI architecture for high performance adaptive video scaling
abstract
We propose an efficient high-performance scaling algorithm based on the oriented polynomial image model. We develop a simple classification scheme that classifies the region around a pixel as an oriented or nonoriented block. Based on this classification, a nonlinear oriented interpolation is performed to obtain high quality video scaling. In addition, we also propose a generalization that can perform scaling for arbitrary scaling factors. Based on this algorithm, we develop an efficient architecture for image scaling. Specifically, we consider an architecture for scaling a Quarter Common Intermediate Format (QCIF) image to 4CIF format. We show the feasibility of the architecture by describing the various computation units in a hardware description language (Verilog) and synthesizing the design into a netlist of gates. The synthesis results show that an application specific integrated circuit (ASIC) design which meets the throughput requirements can be built with a reasonable silicon area.
Arun Raghupathy, Nitin Chandrachoodan, K. J. Ray Liu
IEEE Trans. Multim.1
1998 Algorithm-based low-power and high-performance multimedia signal processing
abstract
Low power and high performance are the two most important criteria for many signal-processing system designs, particularly in real-time multimedia applications. There have been many approaches to achieve these two design goals at many different implementation levels ranging from very-large-scale-integration fabrication technology to system design. We review the works that have been done at various levels and focus on the algorithm-based approaches for low-power and high-performance design of signal processing systems. We present the concept of multirate computing that originates from filterbank design, then show how to employ it along with the other algorithmic methods to develop low-power and high-performance signal processing systems. The proposed multirate design methodology is systematic and applicable to many problems. We demonstrate that multirate computing is a powerful tool at the algorithmic level that enables designers to achieve either significant power reduction or high throughput depending on their choice. Design examples on basic multimedia processing blocks such as filtering, source coding, and channel coding are given. A digital signal-processing engine that is an adaptive reconfigurable architecture is also derived from the common features of our approach. Such an architecture forms a new generation of high-performance embedded signal processor based on the adaptive computing model. The goal of this paper is to demonstrate the flexibility and effectiveness of algorithm-based approaches and to show that the multirate approach is an effective and systematic design methodology to achieve low-power and high throughput signal processing at the algorithmic and architectural level.
K. J. Ray Liu, An-Yeu Wu, Arun Raghupathy, Jie Chen 0002
Proc. IEEE3
1998 System architecture of an adaptive reconfigurable DSP computing engine
abstract
In this paper, we present the system architecture of an adaptive reconfigurable DSP computing engine for numerically intensive front-end audio/video communications. The proposed system is a massively parallel architecture that is capable of performing most low-level computationally intensive data processing including finite impulse response/infinite impulse response (FIR/IIR) filtering, subband filtering, discrete orthogonal transforms (DT), adaptive filtering, and motion estimation for the host processor in DSP applications. Since the properties of each programmed function such as parallelism and pipelinability have been fully exploited in this design, the computational speed of this computing engine can be as fast as ASIC designs that are optimized for individual specific applications. We also show that the system can be easily configured to perform multirate FIR/IIR/DT operations at negligible hardware overhead. Since the processing elements are operated at half of the input data rate, we are able to double the processing speed on-the-fly based on the same system architecture without using high-speed/full-custom circuits. The programmable/high-speed features of the proposed design make it very suitable for cost-effective video-rate DSP applications.
An-Yeu Wu, K. J. Ray Liu, Arun Raghupathy
IEEE Trans. Circuits Syst. Video Technol.3
1995 Parallel programmable video co-processor design
abstract
Modern video applications call for computationally intensive data processing at very high data rate. In order to meet the high-performance/low-cost constraints, the state-of-the-art video processor should be a programmable design which performs various tasks in video applications without sacrificing the computational power and the manufacturing cost in exchange for such flexibility. In this paper, we present a programmable video co-processor design that is capable of performing FIR/IIR filtering, subband filtering, and most discrete orthogonal transforms (DT), for the host processor in video applications. The computational speed of this co-processor is as fast as that of ASIC designs which are optimized for individual specific applications. We also show that the system can be easily reconfigured to perform multirate FIR/IIR/DT operations at negligible hardware overhead. Hence, we can either double the processing speed on the fly based on the same processing elements, or apply this feature to the low-power implementation of this co-processor.
An-Yeu Wu, K. J. Ray Liu, Arun Raghupathy, Shang-Chieh Liu
ICIP3
1995 A Waveront Array for URV Decomposition Updating
abstract
The rank revealing URV decomposition is a useful tool in many signal processing applications that require the computation of the noise subspace of a matrix. In this paper, we look at the problem of updating the URV decomposition and consider its implementation on a wavefront array. We propose a wavefront array for efficient VLSI implementation of the URV decomposition. The array provides a mechanism for accumulating the null space of the matrix as well as for handling rank changes during updating.
Arun Raghupathy, Ut-Va Koc, K. J. Ray Liu
ISCAS1