检索结果-内蒙古大学图书馆

advanced signal processing: algorithms, architectures, and implementations v

作者： Lee, Tong J. Univ. of Hawaii/Manoa Honolulu HI USA

ISBN: (纸本)0819416207

A number of adaptive condition number estimators have been proposed in the past to dynamically estimate the sensitivity of the coefficient matrix of a linear systems of equations. Applications of these techniques often arise in the context of signal processing, where the information matrix is being updated with rank-one modifications. various schemes, such as ACE, ALE and ICE, were proposed to cope with this problem. In this paper, we will briefly review the past work, and show how the small-sample condition estimator can be used in an adaptive manner.

关键词： signal processing

来源：评论

学校读者我要写书评

暂无评论

Application of symmetric redundant residues for fast and reliable arithmetic

Application of symmetric redundant residues for fast and rel...

引用

Conference on advanced signal processing algorithms, architectures and implementations XII

作者： Parhami, B Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA

ISBN: (纸本)0819445584

Despite difficulties in general division, magnitude comparison, and sign detection, residue number system arithmetic has been used for many special-purpose systems in light of its parallelism and modularity for the most common arithmetic operations of addition/subtraction and multiplication. Computation in RNS requires modular reduction, both for the initial conversion from binary to RNS and after each operation to bring the result back to within a valid residue range. Use of redundant residues simplifies this critical operation, leading to even faster arithmetic. One type of redundant mod-m residue, that keeps the representational redundancy to the minimum of 1 bit per residue, has the nearly symmetric range [-m, m) and allows two values for each pseudoresidue: (m) or (m) - m. We study the extent of simplification and speed-up in the modular reduction process afforded by such redundant residues and discuss its potential implications to the design of RNS arithmetic circuits. In particular, we show that besides cost and performance benefits, introduction of error checking and fault tolerance in arithmetic computations is facilitated when such redundant residues are used.

关键词： computer arithmetic error code modular reduction parallel processing redundant representation RNS

来源：评论

学校读者我要写书评

暂无评论

BLOCK CIRCULANT PRECONDITIONERS FOR 2-D DECONvOLUTION

BLOCK CIRCULANT PRECONDITIONERS FOR 2-D DECONVOLUTION

引用

CONF ON advanced signal processing algorithms, architectures, AND implementations 3

作者： CHAN, RH NAGY, JG PLEMMONS, RJ Univ. of Hong Kong (Hong Kong China) Univ. of Minnesota (United States) Wake Forest Univ. (United States)

ISBN: (纸本)081940943X

Discretized 2-D deconvolution problems arising, e.g., in image restoration and seismic tomography, can be formulated as 1eas squares compuaions, mm lib— Tx112 where T is often a large-scale rectangular Toeplitz-block matrix. We consider solving such block least squares problems by the preconditioned conjugate gradient algorithm using square nonsingular circulant-block and related preconditioners, constructed from the blocks of the rectangular matrix T. Preconditioning with such matrices allows efficient implementation using the 1-D or 2-D Fast Fourier Transform (FFT). It is well known that the resolution of ill-posed deconvolution problems can be substantially improved by regularization to compensate for their ill-posed nature. We show that regularization can easily be incorporated into our preconditioners, and we report on numerical experiments on a Cray Y-MP. The experiments illustrate good convergence properties of these FET—based preconditioned iterations.

关键词： Image restoration Matrices Deconvolution Fourier transforms Point spread functions Radon Image processing Information operations Iterative methods Mathematics

来源：评论

学校读者我要写书评

暂无评论

ADAPTIvE ANTENNA BEAMFORMING USING ORTHOGONAL DECOMPOSITION 4

ADAPTIVE ANTENNA BEAMFORMING USING ORTHOGONAL DECOMPOSITION

引用

4TH CONF ON advanced signal processing algorithms, architectures, AND implementations

作者： YU, KB GE Corporate Research and Development Ctr. (United States)

ISBN: (纸本)0819412767

An algorithm has been developed to control the antenna array beam pattern for multiple beam antenna (MBA) or phased array systems. The algorithm is motivated by military satellite communications applications where the uplink received antenna is desired to provide beamforming capability for selective earth coverage and jamming protection. The problem can be formulated as to determine the control weight to meet the user gain and jammer null requirements in their known directions subject to the norm constraint of the weight defined by the power conservation law. The algorithm makes use of an orthogonal decomposition of the weight vector into the constraint weight vector and the zero-output weight vector. If the constraint weight vector satisfies the norm bound constraint, the zero-output vector can further be optimized to minimize the deviation of the resulting weight from the quiescent weight. If the constraint weight vector does not satisfy the norm bound constraint, a recursive procedure has been developed which provides flexibility in the determination of the constraint vectors, the constraint order and the constraint phase optimization. This algorithm provides a practical means to achieve the constraints subject to the norm bound condition.

关键词： Antennas Algorithm development Phased arrays Control systems Nulling interferometry Satellite communications Telecommunications Data processing Mobile communications Receivers

来源：评论

学校读者我要写书评

暂无评论

video compression with parallel processing

引用

PARALLEL COMPUTING 2002年第7-8期28卷 1039-1078页

作者： Ahmad, I He, Y Liou, ML Univ Texas Dept Comp Sci & Engn Arlington TX 76019 USA Motorola Inc San Diego CA USA Hong Kong Univ Sci & Technol Dept Elect & Elect Engn Hong Kong Hong Kong Peoples R China

Driven by the rapidly increasing demand for audio-visual applications, digital video compression technology has become a mature field, offering several available products based on both hardware and software implementations. Taking advantage of spatial, temporal, and statistical redundancies in video data, a video compression system aims to maximize the compression ratio while maintaining a high picture quality. Despite the tremendous progress in this area, video compression remains a challenging research problem due to its computational requirements and also because of the need for higher picture quality at lower data rates. Designing efficient coding algorithms continues to be a prolific area of research. For circumvent the computational requirement, researchers has resorted to parallel processing with a variety of approaches using dedicated parallel vLSI architectures as well as software on general-purpose available multiprocessor systems. Despite the availability of fast single processors, parallel processing helps to explore advanced algorithms and to build more sophisticated systems. This paper presents an overview of the recent research in video compression using parallel processing. The paper provides a discussion of the basic compression techniques, existing video coding standards and various parallelization approaches. Since video compression is multi-step in nature using various algorithms, parallel processing can be exploited at an individual algorithm or at a complete system level. The paper covers a broad spectrum of such approaches, outlining the. basic philosophy of each approach and providing examples. We contrast these approaches when possible, highlight their pros and cons, and suggest future research directions. While the emphasis of this paper is on software-based methods, a significant discussion of hardware and vLSI is also included. (C) 2002 Published by Elsevier Science B.v.

关键词： video compression image processing parallel algorithms cluster computing parallel architectures problem and data portioning

来源：评论

学校读者我要写书评

暂无评论

Parallel and fault -tolerant techniques for adaptive matched -field processing (MFP) on distributed array systems

Parallel and fault -tolerant techniques for adaptive matched...

引用

作者： Cho, Kil Seok University of Florida

学位级别：Ph.D.

Sonar array systems in the highly cluttered undersea environment require new and enhanced signal-processing algorithms and sophisticated architectures to meet the stringent real-time and reliability mission requirements. These demands present significant challenges in terms of computational complexity and dependability; and necessitate the development and use of high-performance computing techniques and advanced signal-processing algorithms. Our study introduces novel parallel and fault-tolerant techniques for adaptive matched-field processing (MFP) which we investigated on distributed array systems along with high-performance networking and distributed computing architectures. We developed the parallel algorithms for adaptive MFP to satisfy the computational and memory requirements not readily supported by cutting-edge, high-performance, single-processor systems. We proposed robust MFP algorithms to compensate for the performance degradation presented by sensor failures in sonar array systems. We also developed fault-tolerant parallel algorithms characterized by low overhead and fast recovery time to enhance dependability. We implemented the proposed parallel algorithms and fault-tolerant mechanisms on scalable clusters of computers. We compared their performance considering several critical factors such as parallel and fault-tolerant techniques, communication schemes, and processor architectures. Results show that these parallel and fault-tolerant algorithms can provide a feasible solution for real-time, scalable, and highly reliable beamforming implementations on distributed array systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PARALLEL AND ADAPTIvE HIGH-RESOLUTION DIRECTION FINDING

PARALLEL AND ADAPTIVE HIGH-RESOLUTION DIRECTION FINDING

引用

CONF ON advanced signal processing algorithms, architectures, AND implementations 3

作者： vANPOUCKE, F MOONEN, M DEPRETTERE, E Katholieke Univ. Leuven (Belgium) Delft Univ. of Technology (Netherlands)

ISBN: (纸本)081940943X

The direction-of-arrival (DOA) estimation problem consists in determining the angles of arrival of a number of signals impinging on a sensor array. Recently, the so-called ESPRIT method of Roy and Paulraj has received a great deal of attention in the literature. The method employs matrix decomposition techniques, such as singular value decomposition (SvD) and generalized Schur decomposition (GSD). The computational complexity thus involved represents a serious impediment, especially when a real-time implementation is aimed for. Therefore, the aim here is to develop an ESPRIT-type algorithm which is fully adaptive and amenable to parallel implementation. By introducing adaptivity, the computational complexity per sampling period is reduced from (Omicron) (m³) to (Omicron) (m²), where m is the `problem size,' i.e., the number of antenna doublets. On a parallel processor array with (Omicron) (m²) processors, the throughput is then (Omicron) (m^o), which means that the number of measurements that are processed per time unit is independent of the problem size. The algorithm is based on an adaptive SvD updating algorithm, combined with an adaptive GSD. The corresponding systolic implementation is based on the systolic SvD updating array of Moonen et al.

关键词： Matrices Sensors Algorithm development Interference (communication) Array processing Antennas Data processing Parallel computing Electrical engineering Phase shifts

来源：评论

学校读者我要写书评

暂无评论

Optimizing time-frequency distributions for automatic classification

Optimizing time-frequency distributions for automatic classi...

引用

Conference on advanced signal processing - algorithms, architectures, and implementations vII

作者： Atlas, L Droppo, J McLaughlin, J Univ. of Washington (United States) MIT Lincoln Lab. (United States)

ISBN: (纸本)0819425842

An entirely new set of criteria for the design of kernels (generating functions) for time-frequency representations (TFRs) is presented. These criteria aim only to produce kernels (and thus, TFRs) which will enable more accurate classification. We refer to these kernels, which are optimized to discriminate among several classes of signals, as signal class dependent kernels, or simply class dependent kernels. The genesis of the class dependent kernel is to be found in the area of operator theory, which we use to establish a direct link between a discrete-time, discrete-frequency TFR and its corresponding discrete signal. We see that many similarities, but also some important differences, exist between the results of the continuous-time operator approach and our discrete one. The differences between the continuous representations and discrete ones may not be the simple sampling relationship which has often been assumed. From this work, we obtain a very concise, matrix-based expression for a discrete-time/discrete-frequency TFR which is simply the product of the kernel with another matrix. This simple expression opens up the possibility to optimize the kernel in a number of ways. We focus, of course, on optimizations most suitable for classification, and ultimately wind up with the class dependent kernel. When applied to simulated sonar transient signals, we find that our approach does a good job of discriminating within very similar classes of transients and is especially sensitive to differences in time variation across classes.

关键词： Time-frequency analysis Matrices Fourier transforms Convolution Detection theory Distance measurement signal generators signal processing Silicon Stochastic processes

来源：评论

学校读者我要写书评

暂无评论

Parallel digital signal processing architectures for image processing

Parallel digital signal processing architectures for image p...

引用

advanced signal processing: algorithms, architectures, and implementations v

作者： Kshirsagar, Shirish P. Hartley, David A. Harvey, David M. Hobson, Clifford A. Liverpool John Moores Univ. Maharashtra India

ISBN: (纸本)0819416207

This paper describes research into a high speed image processing system using parallel digital signal processors for the processing of electro-optic images. The objective of the system is to reduce the processing time of non-contact type inspection problems including industrial and medical applications. A single processor can not deliver sufficient processing power required for the use of applications hence, a MIMD system is designed and constructed to enable fast processing of electro-optic images. The Texas Instruments TMS320C40 digital signal processor is used due to its high speed floating point CPU and the support for the parallel processing environment. A custom designed vISION bus is provided to transfer images between processors. The system is being applied for solder joint inspection of high technology printed circuit boards.

关键词： Image processing

来源：评论

学校读者我要写书评

暂无评论

Fast algorithms for Cauchy-vandermonde matrices with multiple poles

Fast algorithms for Cauchy-Vandermonde matrices with multipl...

引用

Proceedings of the 1999 advanced signal processing algorithms, architectures, and implementations IX

作者： Martinez, J.J. Pena, J.M. Universidad de Alcala Madrid Spain

Cauchy-vandermonde matrices are related with rational interpolation problems. In this paper we consider the general case in which multiple poles can appear. Fast algorithms for solving the corresponding linear systems... 详细信息

关键词： signal processing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：