TY - CONF T1 - Applying graphics processor acceleration in a software defined radio prototyping environment T2 - 2011 22nd IEEE International Symposium on Rapid System Prototyping (RSP) Y1 - 2011 A1 - Plishker,W. A1 - Zaki, G.F. A1 - Bhattacharyya, Shuvra S. A1 - Clancy, C. A1 - Kuykendall, J. KW - Acceleration KW - coprocessors KW - dataflow foundation KW - GNU radio KW - Graphics processing unit KW - graphics processor acceleration KW - Kernel KW - Libraries KW - multicore platforms KW - Multicore processing KW - PARALLEL PROCESSING KW - Pipelines KW - Protocols KW - software defined radio prototyping environment KW - software radio KW - stand-alone GPU accelerated library AB - With higher bandwidth requirements and more complex protocols, software defined radio (SDR) has ever growing computational demands. SDR applications have different levels of parallelism that can be exploited on multicore platforms, but design and programming difficulties have inhibited the adoption of specialized multicore platforms like graphics processors (GPUs). In this work we propose a new design flow that augments a popular existing SDR development environment (GNU Radio), with a dataflow foundation and a stand-alone GPU accelerated library. The approach gives an SDR developer the ability to prototype a GPU accelerated application and explore its design space fast and effectively. We demonstrate this design flow on a standard SDR benchmark and show that deciding how to utilize a GPU can be non-trivial for even relatively simple applications. JA - 2011 22nd IEEE International Symposium on Rapid System Prototyping (RSP) ER - TY - JOUR T1 - Utilizing Hierarchical Multiprocessing for Medical Image Registration JF - IEEE Signal Processing Magazine Y1 - 2010 A1 - Plishker,W. A1 - Dandekar,O. A1 - Bhattacharyya, Shuvra S. A1 - Shekhar,R. KW - Acceleration KW - application parallelism KW - Biomedical imaging KW - domain-specific taxonomy KW - GPU acceleration KW - gradient descent approach KW - Graphics processing unit KW - hierarchical multiprocessing KW - image registration KW - Magnetic resonance imaging KW - Medical diagnostic imaging KW - medical image processing KW - medical image registration KW - multicore platform set KW - Multicore processing KW - PARALLEL PROCESSING KW - parallel programming KW - Robustness KW - Signal processing algorithms KW - Ultrasonic imaging AB - This work discusses an approach to utilize hierarchical multiprocessing in the context of medical image registration. By first organizing application parallelism into a domain-specific taxonomy, an algorithm is structured to target a set of multicore platforms.The approach on a cluster of graphics processing units (GPUs) requiring the use of two parallel programming environments to achieve fast execution times is demonstrated.There is negligible loss in accuracy for rigid registration when employing GPU acceleration, but it does adversely effect our nonrigid registration implementation due to our usage of a gradient descent approach. VL - 27 SN - 1053-5888 CP - 2 ER - TY - CONF T1 - Fast Multipole Accelerated Boundary Elements for Numerical Computation of the Head Related Transfer Function T2 - IEEE International Conference on Acoustics, Speech and Signal Processing, 2007. ICASSP 2007 Y1 - 2007 A1 - Gumerov, Nail A. A1 - Duraiswami, Ramani A1 - Zotkin,Dmitry N KW - Acceleration KW - Acoustic measurements KW - Acoustic scattering KW - audio signal processing KW - boundary element formulation KW - Boundary element method KW - Boundary element methods KW - boundary-elements methods KW - Costs KW - Ear KW - Fast Multipole Method KW - Frequency KW - Head related transfer function KW - HUMANS KW - Irrigation KW - iterative methods KW - multipole accelerated boundary elements KW - multipole based iterative preconditioned Krylov solution KW - numerical computation KW - Reciprocity KW - Transfer functions AB - The numerical computation of head related transfer functions has been attempted by a number of researchers. However, the cost of the computations has meant that usually only low frequencies can be computed and further the computations take inordinately long times. Because of this, comparisons of the computations with measurements are also difficult. We present a fast multipole based iterative preconditioned Krylov solution of a boundary element formulation of the problem and use a new formulation that enables the reciprocity technique to be accurately employed. This allows the calculation to proceed for higher frequencies and larger discretizations. Preliminary results of the computations and of comparisons with measured HRTFs are presented. JA - IEEE International Conference on Acoustics, Speech and Signal Processing, 2007. ICASSP 2007 PB - IEEE VL - 1 SN - 1-4244-0727-3 M3 - 10.1109/ICASSP.2007.366642 ER - TY - JOUR T1 - How Multirobot Systems Research will Accelerate our Understanding of Social Animal Behavior JF - Proceedings of the IEEE Y1 - 2006 A1 - Balch, T. A1 - Dellaert, F. A1 - Feldman, A. A1 - Guillory, A. A1 - Isbell, C.L. A1 - Zia Khan A1 - Pratt, S.C. A1 - Stein, A.N. A1 - Wilde, H. KW - Acceleration KW - Animal behavior KW - ant movement tracking KW - Artificial intelligence KW - biology computing KW - Computer vision KW - control engineering computing KW - Insects KW - Intelligent robots KW - Labeling KW - monkey movement tracking KW - multi-robot systems KW - multirobot systems KW - robotics algorithms KW - Robotics and automation KW - social animal behavior KW - social animals KW - social insect behavior KW - Speech recognition KW - tracking AB - Our understanding of social insect behavior has significantly influenced artificial intelligence (AI) and multirobot systems' research (e.g., ant algorithms and swarm robotics). In this work, however, we focus on the opposite question: "How can multirobot systems research contribute to the understanding of social animal behavior?" As we show, we are able to contribute at several levels. First, using algorithms that originated in the robotics community, we can track animals under observation to provide essential quantitative data for animal behavior research. Second, by developing and applying algorithms originating in speech recognition and computer vision, we can automatically label the behavior of animals under observation. In some cases the automatic labeling is more accurate and consistent than manual behavior identification. Our ultimate goal, however, is to automatically create, from observation, executable models of behavior. An executable model is a control program for an agent that can run in simulation (or on a robot). The representation for these executable models is drawn from research in multirobot systems programming. In this paper we present the algorithms we have developed for tracking, recognizing, and learning models of social animal behavior, details of their implementation, and quantitative experimental results using them to study social insects VL - 94 SN - 0018-9219 CP - 7 ER - TY - JOUR T1 - Accelerated speech source localization via a hierarchical search of steered response power JF - IEEE Transactions on Speech and Audio Processing Y1 - 2004 A1 - Zotkin,Dmitry N A1 - Duraiswami, Ramani KW - accelerated speech source localization KW - Acceleration KW - array signal processing KW - conferencing system KW - Delay KW - delay-and-sum beamforming KW - direction-of-arrival estimation KW - Frequency KW - hierarchical search algorithm KW - Inverse problems KW - multimedia applications KW - Multimedia communication KW - multiple speech sound source KW - Position measurement KW - Robustness KW - search problems KW - Sensor arrays KW - Signal processing algorithms KW - speech KW - speech enhancement KW - Speech processing KW - steered response power KW - steered response power phase-transform weighted source localization algorithm KW - transducer arrays KW - User interfaces AB - Accurate and fast localization of multiple speech sound sources is a problem that is of significant interest in applications such as conferencing systems. Recently, approaches that are based on search for local peaks of the steered response power are becoming popular, despite their known computational expense. Based on the observation that the wavelengths of the sound from a speech source are comparable to the dimensions of the space being searched and that the source is broadband, we have developed an efficient search algorithm. Significant speedups are achieved by using coarse-to-fine strategies in both space and frequency. We present applications of the search algorithm to speed up simple delay-and-sum beamforming and steered response power phase-transform weighted (SRP-PHAT) source localization algorithms. A systematic series of comparisons with previous algorithms are made that show that the technique is much faster, robust, and accurate. The performance of the algorithm can be further improved by using constraints from computer vision. VL - 12 SN - 1063-6676 CP - 5 M3 - 10.1109/TSA.2004.832990 ER - TY - JOUR T1 - Secure quality of service handling: SQoSH JF - IEEE Communications Magazine Y1 - 2000 A1 - Alexander,D. S A1 - Arbaugh, William A. A1 - Keromytis,A. D A1 - Muir,S. A1 - Smith,J. M KW - Acceleration KW - Access control KW - active networks KW - ALIEN active loader KW - Clocks KW - Computer network management KW - cryptographic credentials KW - cryptography KW - customized networking services KW - Data security KW - Data structures KW - denial-of-service attacks KW - interfaces KW - Kernel KW - loaded modules KW - network resources KW - network traffic KW - open signaling KW - packet switching KW - Piglet lightweight device kernel KW - programmable network element KW - programmable network infrastructures KW - Programming profession KW - Proposals KW - quality of service KW - remote invocation KW - resource control KW - restricted control of quality of service KW - SANE KW - scheduling KW - scheduling discipline KW - secure active network environment architecture KW - secure quality of service handling KW - security infrastructure KW - security risks KW - SQoSH KW - SwitchWare architecture KW - telecommunication security KW - tuning knobs KW - virtual clock AB - Proposals for programmable network infrastructures, such as active networks and open signaling, provide programmers with access to network resources and data structures. The motivation for providing these interfaces is accelerated introduction of new services, but exposure of the interfaces introduces many new security risks. We describe some of the security issues raised by active networks. We then describe our secure active network environment (SANE) architecture. SANE was designed as a security infrastructure for active networks, and was implemented in the SwitchWare architecture. SANE restricts the actions that loaded modules can perform by restricting the resources that can be named; this is further extended to remote invocation by means of cryptographic credentials. SANE can be extended to support restricted control of quality of service in a programmable network element. The Piglet lightweight device kernel provides a “virtual clock” type of scheduling discipline for network traffic, and exports several tuning knobs with which the clock can be adjusted. The ALIEN active loader provides safe access to these knobs to modules that operate on the network element. Thus, the proposed SQoSH architecture is able to provide safe, secure access to network resources, while allowing these resources to be managed by end users needing customized networking services. A desirable consequence of SQoSH's integration of access control and resource control is that a large class of denial-of-service attacks, unaddressed solely with access control and cryptographic protocols, can now be prevented VL - 38 SN - 0163-6804 CP - 4 M3 - 10.1109/35.833566 ER - TY - CONF T1 - Skip Strips: maintaining triangle strips for view-dependent rendering T2 - Visualization '99. Proceedings Y1 - 1999 A1 - El-Sana,J. A1 - Azanli,E. A1 - Varshney, Amitabh KW - (computer KW - Acceleration KW - acceleration;graphics KW - applications;path KW - applications;skip-list-like KW - changes;view-dependent KW - compression;rendering KW - connectivity;triangle KW - data KW - datasets;graphics KW - datasets;static KW - environments;data KW - equipment;data KW - graphic KW - Graphics KW - graphics);spatial KW - hardware;hardware-supported KW - hierarchy KW - manner;static KW - mechanism;immediate-mode KW - mesh KW - meshes;triangle KW - nodes;view-dependent KW - rendering;view-dependent KW - simplification;visualization;computer KW - Skip KW - Strips;complex KW - strips;vertex KW - structure;dynamic KW - structures; KW - techniques;retained-mode KW - triangle KW - visualisation;rendering AB - View-dependent simplification has emerged as a powerful tool for graphics acceleration in visualization of complex environments. However, view-dependent simplification techniques have not been able to take full advantage of the underlying graphics hardware. Specifically, triangle strips are a widely used hardware-supported mechanism to compactly represent and efficiently render static triangle meshes. However, in a view-dependent framework, the triangle mesh connectivity changes at every frame, making it difficult to use triangle strips. We present a novel data structure, Skip Strip, that efficiently maintains triangle strips during such view-dependent changes. A Skip Strip stores the vertex hierarchy nodes in a skip-list-like manner with path compression. We anticipate that Skip Strips will provide a road map to combine rendering acceleration techniques for static datasets, typical of retained-mode graphics applications, with those for dynamic datasets found in immediate-mode applications. JA - Visualization '99. Proceedings M3 - 10.1109/VISUAL.1999.809877 ER -