Demo Data from EDBT 2026 / reviewers in the wild / expert
Paul M. Chau
dblp:28/6157
· DBLP profile ↗
24ranked-venue papers
2as first author
0since 2021 · last 2006
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 9 · 1 first-authorSystems, architecture and hardware · 8 · 1 first-authorArtificial intelligence and machine learning · 5Computer networks · 2
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
8 papers |
Electronic design automation · 50% Interconnection networks and networks-on-chip · 19% Reconfigurable computing and FPGAs · 17% | |
| Artificial intelligence
2 papers |
Deep learning architectures and training · 62% Robot navigation and mapping · 38% |
Topics — the 11 heaviest of 14, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation
physical design |
0.0 | 3 | 1996 | A wire length estimation technique utilizing neighborhood density equations · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996 Prime: A Timing-Driven Placement Tool using A Piecewise Linear Resistive Network Approach · DAC 1993 A Wire Length Estimation Technique Utilizing Neighborhood Density Equations · DAC 1992 |
Interconnection networks and networks-on-chip
flow control |
0.0 | 2 | 1996 | An extension to the SCI flow control protocol for increased network efficiency · IEEE/ACM Trans. Netw. 1996 Enhancing SCI's fairness protocol for increased throughput · ICNP 1993 |
Electronic design automation › physical design › placement
wirelength estimation |
0.0 | 2 | 1996 | A wire length estimation technique utilizing neighborhood density equations · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996 A Wire Length Estimation Technique Utilizing Neighborhood Density Equations · DAC 1992 |
Cloud and datacenter computing › resource allocation › resource allocation policy
max-min fairness |
0.0 | 1 | 1996 | An extension to the SCI flow control protocol for increased network efficiency · IEEE/ACM Trans. Netw. 1996 |
Electronic design automation › physical design
placement |
0.0 | 2 | 1996 | Prime: A Timing-Driven Placement Tool using A Piecewise Linear Resistive Network Approach · DAC 1993 A wire length estimation technique utilizing neighborhood density equations · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996 |
Electronic design automation
design automation tools |
0.0 | 1 | 1994 | Rapid Prototyping of ASIC Based Systems · DAC 1994 |
Reconfigurable computing and FPGAs
FPGA prototyping |
0.0 | 1 | 1994 | Rapid Prototyping of ASIC Based Systems · DAC 1994 |
Machine learning › Deep learning architectures and training › feedforward neural network
radial basis function network |
0.0 | 1 | 1993 | A Hybrid Radial Basis Function Neurocomputer and Its Applications · NIPS 1993 |
Hardware accelerators and domain-specific architectures
neural network hardware |
0.0 | 1 | 1993 | A Hybrid Radial Basis Function Neurocomputer and Its Applications · NIPS 1993 |
Electronic design automation › physical design › placement
timing-driven placement |
0.0 | 1 | 1993 | Prime: A Timing-Driven Placement Tool using A Piecewise Linear Resistive Network Approach · DAC 1993 |
Performance modeling and evaluation
simulation |
0.0 | 1 | 1993 | Enhancing SCI's fairness protocol for increased throughput · ICNP 1993 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.0neighborhood density equations · 0.0topological analysis · 0.0protocol design · 0.0branching process · 0.0standard cell design · 0.0radial basis function networks · 0.0radial basis function network · 0.0primal-dual method · 0.0piecewise linear resistive network · 0.0lagrange relaxation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | Objective Human Visual System Based Video Quality Assessment Metric for Low Bit-Rate Video Communication SystemsabstractQuality assessment is crucial to developments of video communication systems. While subjective test yields most accurate results, its expensive cost and human biasness make it an unsatisfactory figure of merit. The peak-signal to noise ratio (PSNR), the most acceptable objective video quality assessment metric, is based on error sensitivity; its failure to capture perceptual errors is well documented. Other perceptual quality metrics fail to detect the localized errors that are common in sequences produced by low bit-rate video communication systems. In this work, a novel perceptual quality assessment metric, the structural similarity (SSIM) metric, is modified to better detect spatial artifacts often seen in video communication systems David Chih-Che Lin, Paul M. Chau |
MMSP | 2 |
| 2002 | Reduce complexity hardware implementation of discrete wavelet transform for JPEG 2000 standardabstractThis paper presents an efficient method to reduce the implementation complexity of discrete wavelet transform (DWT) for JPEG 2000 standard. The proposed method is based on the design and the implementation of integer wavelets. Instead of using the lifting scheme or sacrificing vanishing moment to obtain integer coefficients, the proposed method derives integer coefficients directly from roots of the half band filter. Based on the integer filter coefficients, we propose an efficient VLSI algorithm, which uses only 17 integer adders and 15 shifters to construct a two-channel filter bank system. The complexity of the proposed method is significantly lower than that found in the convolution and lifting approaches. The convolution approach requires 9 floating-point multiplications and 14 floating-point additions. Likewise, the lifting scheme needs 6 floating-point multiplications and 12 floating-point additions. Besides the mathematical derivation, this paper presents simulation results, which compare the frequency responses and coding efficiency between the floating-point and the integer approaches. In addition, a VHDL implementation result is presented. Philip P. Dang, Paul M. Chau |
ICME (1) | 2 |
| 2002 | Microarchitectural synthesis of performance-constrained, low-power VLSI designsabstractNew portable signal-processing applications such as mobile telephony, wireless computing, and personal digital assistants place stringent power consumption limits on their constituent components. Substantial power savings can be realized if 5 V designs are translated to use the new lower supply voltage standards. This conversion, however, is not achieved easily: a design originally targeted for implementation in a 5 V technology will typically require significant rework to meet timing and throughput requirements at the lower operating voltage. In this paper we describe a high-level synthesis system which assists the designer in performing this task, minimizing the need for manual redesign. Techniques employed in this work include pipelining and a new approach to module selection that minimizes power consumption subject to timing constraints. Using these and other high-level synthesis techniques to target designs to 3.3 V libraries, we show that it is possible to reduce power consumption by as much as 56% as compared to the original 5 V implementation, while meeting specified minimum throughput and maximum latency constraints. Laurence Goodby, Alex Orailoglu, Paul M. Chau |
ACM Trans. Design Autom. Electr. Syst. | 3 |
| 1999 | Conditional probability density function estimation with sigmoidal neural networksabstractReal-world problems can often be couched in terms of conditional probability density function estimation. In particular, pattern recognition, signal detection, and financial prediction are among the multitude of applications requiring conditional density estimation. Previous developments in this direction have used neural nets to estimate statistics of the distribution or the marginal or joint distributions of the input-output variables. We have modified the joint distribution estimating sigmoidal neural network to estimate the conditional distribution. Thus, the probability density of the output conditioned on the inputs is estimated using a neural network. We have derived and implemented the learning laws to train the network. We show that this network has computational advantages over a brute force ratio of joint and marginal distributions. We also compare its performance to a kernel conditional density estimator in a larger scale (higher dimensional) problem simulating more realistic conditions. Amir Sarajedini, Robert Hecht-Nielsen, Paul M. Chau |
IEEE Trans. Neural Networks | 3 |
| 1998 | Reconfigurable Processing for Robust Navigation and Control (Abstract)abstractNo abstract available. Jeanette F. Arrigo, Kevin J. Page, Paul M. Chau, N. C. Tien |
FPGA | 3 |
| 1998 | Blind signal separation with a projection pursuit indexabstractBlind signal separation (BSS) is a powerful technique for separation of mixed signals with weak assumptions on the incoming signals. The objectives of BSS are analogous to the objectives of exploratory projection pursuit which is widely used in the statistical community for finding structure in high dimensional data sets. In this paper, we adapt exploratory projection pursuit for BSS. First, we introduce exploratory projection pursuit and the associated projection pursuit index (PPI). We adapt the PPI for application to BSS. We also investigate the order of approximation required to achieve satisfactory separation using the PPI, and compare its performance to a maximum-likelihood BSS technique using a Gram-Charlier expansion. Amir Sarajedini, Paul M. Chau |
ICASSP | 2 |
| 1996 | A wire length estimation technique utilizing neighborhood density equationsabstractThis paper presents a new wire length estimation technique for row-based design. Noting that the local topological structure of the network is often reflected in the local structure of the placement, we present a technique of topological analysis of the network, in which the local structure of the network is characterized by a growing sequence of multilevel neighborhoods. By assuming a pointwise independent branching process, we derive equations for the probability density of multilevel neighborhoods. The wire length distribution is found by solving these equations. For thirteen industrial circuits tested, this technique gives an average of 15.1% estimation accuracy. Takeo Hamada, Chung-Kuan Cheng, Paul M. Chau |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 3 |
| 1996 | An extension to the SCI flow control protocol for increased network efficiencyabstractThe scalable coherent interface (SCI) is a newly established IEEE standard that provides bus-like services to a network of nodes without actually using a physical bus. Rather, it utilizes very fast, unidirectional links that can be arranged into a variety of topologies. SCI provides a novel fairness protocol that equally allocates bandwidth to all nodes on the network. When global fairness is not required, it is often desirable to relax its enforcement, in exchange for increased network utilization and better load balancing. This paper presents an extension to the SCI flow control protocol that increases network utilization and, hence, attainable system throughput by enforcing fairness only among nodes whose transmissions interfere with one another. The enhanced protocol grants a node as much bandwidth as it requires, as long as its transmissions do not inhibit those of other nodes. Although this is commonly known as max-min fairness, we more descriptively refer to it as relaxed fairness. We present extensive simulation results and compare them to the standard SCI protocol and to our desired performance, which has been preciously derived in the literature. The comparisons show that, on average, this enhancement can provide a substantial increase in performance over the original protocol. Dan Picker, Ronald D. Fellman, Paul M. Chau |
IEEE/ACM Trans. Netw. | 3 |
| 1995 | Execution of a remote sensing application on a custom neurocomputerabstractA radial basis function neural network was successfully applied to an area which is relatively new for neural networks: a remote sensing application that provides estimates of water vapor content, an important parameter for climate modeling. The neural network provided results which are up to 32% better than had been previously obtained using conventional statistical methods on the same data. These results have implications for improved short-term weather forecasting and for long-term global climate modeling. The neural network approach is compared with the past and present operating algorithms at the National Oceanic and Atmospheric Administration. The radial basis function network's performance is compared with sigmoidal backpropagation network. Low-power electronic implementations of the neural methodology were explored to demonstrate the feasibility of placing the network on a remote sensing platform. This would permit processing the raw sensor data into information on the platform, eliminating the need to store the raw data, and helping to contain the expected explosion of climate data. Steven S. Watkins, Paul M. Chau, Raoul Tawel, Bjorn H. Lambrigsten |
IEEE Trans. Neural Networks | 2 |
| 1995 | A supervised learning neural network coprocessor for soft-decision maximum-likelihood decodingabstractA supervised learning neural network (SLNN) coprocessor which enhances the performance of a digital soft-decision Viterbi decoder used for forward error correction in a digital communication channel with either fading plus additive white Gaussian noise (AWGN) or pure AWGN has been investigated and designed. The SLNN is designed to cooperate with a phase shift keying (PSK) demodulator, an automatic gain control (AGC) circuit, and a 3-bit quantizer which is an analog to digital convertor. It is trained to learn the best uniform quantization step-size Delta (BEST) as a function of the mean and the standard deviation of various sets of Gaussian distributed random variables. The channel cutoff rate (R(0)) of the channel is employed to determine the best quantization threshold step-size (Delta(BEST)) that results in the minimization of the Viterbi decoder output bit error rate (BER). For a digital communication system with a SLNN coprocessor, consistent and substantial BER performance improvements are observed. The performance improvement ranges from a minimum of 9% to a maximum of 25% for a pure AWGN channel and from a minimum of 25% to a maximum of 70% for a fading channel. This neural network coprocessor approach can be generalized and applied to any digital signal processing system to decrease the performance losses associated with quantization and/or signal instability. Yu-jhih Wu, Paul M. Chau, Robert Hecht-Nielsen |
IEEE Trans. Neural Networks | 2 |
| 1994 | Rapid Prototyping of ASIC Based SystemsabstractThis paper outlines the development of a rapid prototype methodology used to implement a new communications decoding architecture and a channel simulator to evaluate that decoder's performance. In addition, we describe the subsequent refinement of a key computational component of the decoder using a semicustom approach; namely, a CMOS standard cell implementation. Both these project tasks have relied extensively on the use of design automation (DA) tools and Field Programmable Gate Array (FPGA) technology. Herein, we describe our rapid prototype methodology, some lessons learned, and highlight our experiences using DA tools (specifically, Mentor Graphics and Xilinx) encountered in the progress of our work. Patrick H. Kelly, Kevin J. Page, Paul M. Chau |
DAC | 3 |
| 1994 | Microarchitectural Synthesis of Performance-Constrained, Low-Power VLSI DesignsabstractNew portable signal-processing applications such as mobile telephony, wireless computing, and personal digital assistants place stringent power consumption limits on their constituent components. Substantial power servings can be realized if 5 V designs are translated to use the new lower supply voltage standards. This conversion, however is not achieved easily: a design originally targeted for implementation in a 5 V technology will typically require significant re-work to meet timing and throughput requirements at the lower operating voltage. We describe a high-level synthesis system which assists the designer in performing this task, minimizing the need for manual re-design. Techniques employed in this work include pipelining and a new approach to module selection which minimizes power consumption subject to timing constraints. Using these and other high-level synthesis techniques to target designs to 3.3 V libraries, we show that it is possible to reduce power consumption by as much as 56% as compared to the original 5 V implementation, while meeting specified minimum throughput and maximum latency constraints.> Laurence Goodby, Alex Orailoglu, Paul M. Chau |
ICCD | 3 |
| 1993 | Prime: A Timing-Driven Placement Tool using A Piecewise Linear Resistive Network ApproachabstractAn approach toward ath-oriented tirnii -driven place-{ t ment is proposed.We rst transform the p acement with timing constraints to a Lagrange problem, A primal-dual a.ppro~IS USed to find the optimrd relative module locatlons.In each primal dual iteration, the primal problem is solved by a piecewise linear resistive network method, whale the dual process is used to update the Lagrange multiplier.The sparsity of the piecewiee liiear resistive network is exploited to obt airt dramatic improvement on the efficiency of the calculation.Up to 22.o% of clock cycle reduction was observed for Primary2 test case.1 Takeo Hamada, Chung-Kuan Cheng, Paul M. Chau |
DAC | 3 |
| 1993 | Recursive least squares problem implementation on a generalized interconnection of DSP processors
Sati Banerjee, Paul M. Chau |
ICASSP (3) | 2 |
| 1993 | Enhancing SCI's fairness protocol for increased throughputabstractThe scalable coherent interface (SCI) is a newly established IEEE standard which provides bus-like services to a network of nodes connected by very fast, unidirectional links. SCI provides an efficient flow control protocol that fairly allocates bandwidth to all nodes on the network. When global fairness is not required, it is desirable to relax its enforcement, in exchange for increased network utilization. This paper presents an extension to SCI's fairness protocol that increases attainable throughput by enforcing fairness only among conflicting nodes. The authors present extensive simulation results and compare them to the standard SCI protocol and to the desired performance, which is derived in the paper. The comparisons show that, on average, the enhancements substantially increase the performance of the original protocol.> Dan Picker, Ronald D. Fellman, Paul M. Chau |
ICNP | 3 |
| 1993 | A Hybrid Radial Basis Function Neurocomputer and Its Applications
Steven S. Watkins, Paul M. Chau, Raoul Tawel, Bjorn Lambrigtsen, Mark Plutowski |
NIPS | 2 |
| 1993 | Parallel implementations of direction finding algorithms on networks of general purpose DSP processors
Paul M. Chau, Sati Banerjee |
Integr. | 1 |
| 1992 | A Wire Length Estimation Technique Utilizing Neighborhood Density Equations
Takeo Hamada, Chung-Kuan Cheng, Paul M. Chau |
DAC | 3 |
| 1992 | Macropipelining based heterogeneous multiprocessor schedulingabstractHigh performance multiprocessing systems have been increasingly using heterogeneous digital signal processors (DSPs) for overall systems gain. Scheduling a DSP algorithm on such a system must address issues of interprocessor communication as well as parallelism extraction for optimal throughput. These issues have been extensively examined for multiprocessor systems incorporating homogeneous processors. A heterogeneous macropipelined scheduling scheme has been described which addresses the aforementioned communication and parallelization issues. The advantage of resorting to a heterogeneous scheme in specific cases is illustrated with examples.> Takeo Hamada, Sati Banerjee, Paul M. Chau, Ronald D. Fellman |
ICASSP | 3 |
| 1992 | Sigma-delta encoding for efficient equalization of prefilter based FIR filtersabstractIt is well known that the computational workload of finite impulse response (FIR) filters can be significantly reduced using the prefilter-equalizer approach. A technique for rounding the tap coefficients of the equalizer to a single power-of-two (or a small combination of powers-of-two) with little or no degradation in overall filter performance is described. Using error spectrum shaping, the equalizer coefficient truncation error is moved to higher frequencies where it is attenuated by the prefilter. The resulting equalizer requires no multiplications and is typically only of slightly higher order than an optimal direct form equalizer with infinite precision coefficients. Examples are given showing a 4*decrease in arithmetic complexity over previous prefilter-equalizer approaches and a 1.5*decrease over optimal interpolated FIR approaches.> Scott R. Powell, Paul M. Chau |
ICASSP | 2 |
| 1990 | KINFIDA: an object-oriented model-based digital filter design assistantabstractKINFIDA (knowledge-based intelligent filter design assistant), a hybrid knowledge-based system with a model-based reasoning architecture for digital filter design, is described. It extends the concept of an isolated digital signal processing CAD tool and provides a closed-loop design environment where the system expertise can grow incrementally with minimal effect on the controls and the reasoning process. It utilizes IEEE signal processing libraries and is implemented in Nexpert Object, a commercial object-rule-based development system. The user interface is implemented using the X11 toolkit package. Using an interactive human interface, KINFIDA suggests likely filter approaches, estimates undetermined parameters, provides performance estimates, and suggests candidate VLSI technologies satisfying a desired filtering operation.> Amir Hekmatpour, Scott R. Powell, Paul M. Chau |
ICASSP | 3 |
| 1990 | A neural network architecture for the decoding of long constraint length convolutional codesabstractA neural network decoder designed to provide a constant output of decoded data for long-constraint-length convolutional codes (K⩾11) is presented. With only local connections between neurons and digital EX-OR cells, direct hardware implementation in a VLSI ASIC (application-specific integrated circuit) is feasible. Decoder strategy is discussed along with toggling strategy. Architectural modifications to decode other code rates are also discussed Michael D. Alston, Paul M. Chau |
IJCNN | 2 |
| 1987 | A bit-serial floating-point complex multiplier-accumulator for fault-tolerant digital signal processing arraysabstractThis paper presents the extension of bit-serial architectures for next-generation signal processing chips with floating-point and fault-tolerant capabilities. The architecture and design of a novel bit-serial floating-point complex multiplier-accumulator (CMAC) hardware is described. Fault-tolerant features are incorporated by embedding these CMACs into dynamically reconfigurable systolic arrays. The arrays can be utilized for FIR filtering, convolution, correlation and other signal processing applications based upon multiply-accumulate. Furthermore, these computational cores can be incorporated into more complex processors which perform FFT-type computations. With the advent of submicron VLSI technology, the smaller device geometries will afford either the implementation of greater functionality and/or computational capabilities. These increased capabilities will enable the solution of more demanding signal processing problems where there exist broad dynamic range requirements or low signal to noise conditions. But also associated with the increased functionality is the greater need for fault tolerance in high performance applications. Our bit-serial floating-point complex multiplier-accumulator will serve many such signal processing needs. Paul M. Chau, Kay-Cheung Chew, Walter H. Ku |
ICASSP | 1 |
| 1984 | Digital signal processing capabilities of CUSP, a high performance bit-serial VLSI processorabstractThe Cornell University Signal Processor (CUSP) is a high performance CMOS processor which has been custom designed in VLSI to efficiently compute digital signal processing algorithms based on the Cooley-Tukey Radix-4 Fast Fourier Transform. One CUSP chip can be used as a stand-alone peripheral in a microprocessor system, or CUSP units can be combined into arrays in order to process signals with sampling rates of several MHz. It can attain a high numerical accuracy while maintaining a throughput superior to most available systems. In this paper we discuss the signal processing capabilities of CUSP, its simple programmability, and I/O interface. We also present simulation results which quantify the signal-to-noise ratio advantages of the bit-serial architecture. Richard W. Linderman, Peter P. Reusens, Paul M. Chau, Walter H. Ku |
ICASSP | 3 |