Thomas P. Kelliher
Pennsylvania State University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Thomas P. Kelliher.
IEEE Transactions on Computers | 1992
Thomas P. Kelliher; Robert Michael Owens; Mary Jane Irwin; TingTing Hwang
A new addition algorithm, ELM, is presented. This algorithm makes use of a tree of simple processors and requires O(log n) time, where n is the number of bits in the augend and addend. The sum itself is computed in one pass through the tree. This algorithm was discovered by a VLSI CAD tool, FACTOR, developed for use in synthesizing CMOS VLSI circuits. >
signal processing systems | 1999
Benjamin Bishop; Thomas P. Kelliher; Mary Jane Irwin
In this paper, we present a detailed analysis of the MediaBench benchmark suite. MediaBench consists of a number of popular embedded applications for communications and multimedia. MediaBench performance characteristics were examined by running MediaBench under the SimpleScalar simulation environment. Characteristics such as instruction mix, branch prediction accuracy, cache hit rates, memory usage, and integer bit utilization were considered. This information can be of use in designing embedded systems targeted at multimedia applications.
great lakes symposium on vlsi | 1999
Benjamin Bishop; Thomas P. Kelliher; Mary Jane Irwin
Register renaming is often used to improve performance in many high-ILP processors. However there is a lack of publications regarding register renaming hardware design. This paper presents a detailed look at one possible implementation of a register renaming unit, as well as some possible optimizations.
great lakes symposium on vlsi | 2000
Benjamin Bishop; Thomas P. Kelliher; Mary Jane Irwin
In this paper, we discuss hardware acceleration for real-time physical modeling that would allow for realistic virtual environments. Additionally, we propose algorithms and their architectural implementation (SPARTA), which is specifically tuned for real-time use. We expect performance orders of magnitude higher than general-purpose CPUs.
international conference on acoustics speech and signal processing | 1996
Raminder Singh Bajwa; Robert Michael Owens; Thomas P. Kelliher
In this paper a dynamic programming algorithm for simultaneous speech segmentation and phoneme recognition is presented. Given a sequence of samples of an unknown speech pattern and a library of phonemes, this algorithm finds the best phonological match and, with a backtracking step, identifies the phoneme boundaries. This approach is different from a traditional two step process whereby first the phoneme boundaries are determined locally and then speech recognition is performed. Its advantage over the two step process is that incorrect phoneme boundaries due to slurring or sudden changes in the speech are reduced. Unlike other dynamic programming algorithms, it does not lend itself to systolic wavefront processing, hence an alternate parallel algorithm is presented.
international conference on acoustics, speech, and signal processing | 1991
Mary Jane Irwin; Robert Michael Owens; Thomas P. Kelliher; K.-K. Leung; Mohan Vishwanath
A description is given of the synthesis, design, and simulation of the arithmetic cube II, a second-generation, high-performance digital signal processing architecture. The architecture implements the so-called small-n algorithms. The authors are currently building a CMOS prototype system which should be capable of computing a 1024 point complex DFT in 410 mu s.<<ETX>>
acm southeast regional conference | 2006
Shrirang M. Yardi; Benjamin Bishop; Thomas P. Kelliher
Applications involving interactive modeling of deformable objects require highly iterative, floating-point intensive numerical simulations. As the complexity of these models increases, the computational power required for their simulation quickly grows beyond the capabilities of current general purpose systems. In this paper, we present the design of a low--cost, high--performance, specialized architecture to accelerate these simulations. Our aim is to use such specialized hardware to allow complex interactive physical modeling even on consumer-grade PCs. In this paper, we present details of the target algorithms, the HELLAS architecture, simulation results and lessons learned from our implementation.
IEEE Transactions on Circuits and Systems for Video Technology | 2003
Benjamin Bishop; Thomas P. Kelliher
Deformable object modeling is a technology that will enable a broad range of new applications. Unfortunately, current techniques are far from being able to offer interactive performance for realistic scenes. We examine the idea of using low-cost highly specialized hardware in order to accelerate deformable object modeling. Details are presented regarding two generations of such experimental systems.
international conference on multimedia and expo | 2000
Benjamin Bishop; Thomas P. Kelliher; Mary Jane Irwin
Physical modeling of a mass-spring system allows for realistic object motion and deformation in a virtual environment. Previous work in this type of physical modeling relies on general-purpose hardware, and cannot offer the performance necessary for real-time human-machine interaction. In this paper, we consider the co-design of software and hardware in order to achieve real-time physical modeling.
great lakes symposium on vlsi | 1997
Kevin P. Acken; Eric Gayles; Thomas P. Kelliher; Robert Michael Owens; Mary Jane Irwin
The Micro-Grain Array Processor (MGAP) is a family of massively parallel SIMD arrays of fine grain processing elements powerful enough to perform complex signal and image processing algorithms in real time. The MGAP was also designed to be compact enough to conveniently fit as an add-on board to a standard workstation at a fraction of the development cost of other comparable parallel machines. In this paper we update the status of the MGAP-2 which became operational in October 1996, and present a comparison of the MGAP-1 and the MGAP-2. We also give performance comparisons of the two designs through three popular image/video compression algorithms: the Discrete Cosine Transform, Motion Estimation, and Fractal Compression.