Publications

Refine Results

(Filters Applied) Clear All

Variable projection and unfolding in compressed sensing

Published in:
Proc. 14th IEEE/SP Workshop on Statistical Signal Processing, 26-28 August 2007, pp. 358-362.

Summary

The performance of linear programming techniques that are applied in the signal identification and reconstruction process in compressed sensing (CS) is governed by both the number of measurements taken and the number of nonzero coefficients in the discrete basis used to represent the signal. To enhance the capabilities of CS, we have developed a technique called Variable Projection and Unfolding (VPU). VPU extends the identification and reconstruction capability of linear programming techniques to signals with a much greater number of nonzero coefficients in the basis in which the signals are compressible with significantly better reconstruction error.
READ LESS

Summary

The performance of linear programming techniques that are applied in the signal identification and reconstruction process in compressed sensing (CS) is governed by both the number of measurements taken and the number of nonzero coefficients in the discrete basis used to represent the signal. To enhance the capabilities of CS...

READ MORE

A new approach to achieving high-performance power amplifier linearization

Published in:
IEEE Radar Conf., 17-20 April 2007. doi: 10.1109/RADAR.2007.374329

Summary

Digital baseband predistortion (DBP) is not particularly well suited to linearizing wideband power amplifiers (PAs); this is due to the exorbitant price paid in computational complexity. One of the underlying reasons for the computational complexity of DBP is the inherent inefficiency of using a sufficiently deep memory and a high enough polynomial order to span the multidimensional signal space needed to mitigate PA-induced nonlinear distortion. Therefore we have developed a new mathematical method to efficiently search for and localize those regions in the multidimensional signal space that enable us to invert PA nonlinearities with a significant reduction in computational complexity. Using a wideband code division multiple access (CDMA) signal we demonstrate and compare the PA linearization performance and computational complexity of our algorithm to that of conventional DBP techniques using measured results.
READ LESS

Summary

Digital baseband predistortion (DBP) is not particularly well suited to linearizing wideband power amplifiers (PAs); this is due to the exorbitant price paid in computational complexity. One of the underlying reasons for the computational complexity of DBP is the inherent inefficiency of using a sufficiently deep memory and a high...

READ MORE

Nonlinear equalization for RF receivers

Published in:
Proc. Conf. on High Performance Computer Modernization Program, 26-29 June 2006, pp. 303-307.

Summary

This paper describes the need for High Performance Computing (HPC) to facilitate the development and implementation of a nonlinear equalizer that is capable of mitigating and/or eliminating nonlinear distortion to extend the dynamic range of radar front-end receivers decades beyond the analog state-of-the-art. The search space for the optimal nonlinear equalization (NLEQ) solution is computationally intractable using only a single desktop computer. However, we have been able to leverage a combination of an efficient greedy search with the high performance computing technologies of LLGrid and MatlabMPI to construct an NLEQ architecture that is capable of extending the dynamic range of Radar front-end receivers by over 25dB.
READ LESS

Summary

This paper describes the need for High Performance Computing (HPC) to facilitate the development and implementation of a nonlinear equalizer that is capable of mitigating and/or eliminating nonlinear distortion to extend the dynamic range of radar front-end receivers decades beyond the analog state-of-the-art. The search space for the optimal nonlinear...

READ MORE

Next-generation technologies to enable sensor networks

Published in:
Handbook of Sensor Networks, Chapter 2

Summary

Examples are advances in ground moving target indicator (GMTI) processing, space-time adaptive processing (STAP), target discrimination, and electronic counter-countermeasures (ECCM). All these advances have improved the capabilities of radar sensors. Major improvements expected in the next several years will come from exploiting collaborative network-centric architectures to leverage synergies among individual sensors. Such an approach has become feasible as a result of major advances in network computing, as well as communication technologies in both wireless and fiber networks. The exponential growth of digital technology, together with highly capable networks, enable in-depth exploitation of sensor synergy, including multi-aspect sensing. New signal processing algorithms exploiting multi-sensor data have been demonstrated in non-real-time, achieving improved performance against surface mobile targets by leveraging high-speed sensor networks. The paper demonstrates a significant advancement in exploiting complex ground moving target indicator (GMTI) and synthetic aperture radar (SAR) data to accurately geo-locate and identify mobile targets.
READ LESS

Summary

Examples are advances in ground moving target indicator (GMTI) processing, space-time adaptive processing (STAP), target discrimination, and electronic counter-countermeasures (ECCM). All these advances have improved the capabilities of radar sensors. Major improvements expected in the next several years will come from exploiting collaborative network-centric architectures to leverage synergies among individual...

READ MORE

Discrete optimization using decision-directed learning for distributed networked computing

Summary

Decision-directed learning (DDL) is an iterative discrete approach to finding a feasible solution for large-scale combinatorial optimization problems. DDL is capable of efficiently formulating a solution to network scheduling problems that involve load limiting device utilization, selecting parallel configurations for software applications and host hardware using a minimum set of resources, and meeting time-to-result performance requirements in a dynamic network environment. This paper quantifies the algorithms that constitute DDL and compares its performance to other popular combinatorial self-directed real-time networked resource configuration for dynamically building a mission specific signal-processor for real-time distributed and parallel applications.
READ LESS

Summary

Decision-directed learning (DDL) is an iterative discrete approach to finding a feasible solution for large-scale combinatorial optimization problems. DDL is capable of efficiently formulating a solution to network scheduling problems that involve load limiting device utilization, selecting parallel configurations for software applications and host hardware using a minimum set of...

READ MORE