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

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

作者： BOASHASH, B RISTICH, B Queensland Univ. of Technology (Australia)

ISBN: (纸本)0819412767

The paper addresses two questions of time-varying higher-order spectra (TVHOS), whose solutions are essential for the further development of these methods and their applicability to a wide range of situations. They are: (1) defining cumulant TVHOS and (2) predicting the behavior of TVHOS of composite signals. It is shown first that the cumulant Wigner-Ville trispectrum (as a particular member of cumulant TVHOS), can preserve the essential properties of cumulant higher-order spectra (e.g., eliminates Gaussian additive noise) and at the same time is able to characterize the time-variations of the signal's spectral (i.e., trispectral) content. Secondly, when dealing with composite FM signals, a special kind of `non-oscillating cross-terms' appear in the moment TVHOS time-frequency subspace. These cross-terms cannot be eliminated by smoothing the WVT, but rather by appropriate slicing of the full time-multi-frequency space.

关键词： Fermium Frequency modulation Composites Time-frequency analysis Interference (communication) signal processing Smoothing signal analyzers Chromium Nonlinear optics

来源：评论

学校读者我要写书评

暂无评论

Segmented chirp features and hidden Gauss-Markov models for classification of wandering-tone signals

Segmented chirp features and hidden Gauss-Markov models for ...

引用

Conference on advanced signal processing algorithms, architectures and implementations XII

作者： Ainsleigh, PL USN Undersea Warfare Ctr Newport RI 02840 USA

ISBN: (纸本)0819445584

A new feature set and decision function are proposed for classifying transient wandering-tone signals. signals are partitioned in time and modeled as having piecewise-linear instantaneous frequency and piecewise-constant amplitude. The initial frequency, chirp rate, and amplitude are estimated in each segment. The resulting sequences of estimates are used as features for classification. The decision function employs a linear Gaussian dynamical model, or hidden Gauss-Markov model (HGMM). The parameters that characterize the HGMM for each class are estimated from labeled training sequences, and the trained models are used to evaluate the class-conditional likelihoods of an unlabeled signal. The signal is assigned to the-class whose model gives the maximum conditional likelihood. Simulation experiments demonstrate perfect classification performance in a three-class forced-choice problem.

关键词： Ferroelectric materials Bismuth Picosecond phenomena Information technology Weapons of mass destruction signal processing

来源：评论

学校读者我要写书评

暂无评论

A novel signal detection technique based on generalized scale transforms - art. no. 63130Y

A novel signal detection technique based on generalized scal...

引用

Conference on advanced signal processing algorithms, architectures, and implementations XVI

作者： Nickel, Robert M. Penn State Univ Dept Elect Engn University Pk PA 16802 USA

ISBN: (纸本)0819463922

We are presenting an extension to the classic multiple signal classification method (MUSIC) developed by Schmidt and Bienvenu in 1979.(1) While the classic MUSIC algorithm is limited to the detection of constant frequency sinusoids in white noise, the proposed new method is capable of detecting signals with a continuously varying instantaneous frequency. The method is based on the development of a discrete-time version of the generalized scale transform (GST) which was introduced by Nickel and Williams in 1999.(2) As a byproduct we obtain techniques for discrete-time warp-shift invariant filtering which can be used in addition to the signal detection to separate signals with different instantaneous frequency contours.

关键词： warping functions sampling theory generalized scale transform signal detection multiple signal classification (MUSIC)

来源：评论

学校读者我要写书评

暂无评论

Binary openings and closings in one pass using finite-state machines 6

Binary openings and closings in one pass using finite-state ...

引用

Conference on advanced signal processing algorithms, architectures, and implementations VI

作者： Waltz, FM Consultant (United States)

ISBN: (纸本)0819422347

In a series of ten papers published since 1994, a radically new technique for implementing a wide range of standard image processing operations has been presented, under the acronym SKIPSM (Separated-Kernel Image processing using finite State Machines). Key steps are: (1) the operation is separated into a row operation followed by a column operation, (2) these row and column operations are put in recursive form. That is, in a form compatible with either one-step software implementation or pipelined raster-scan hardware implementation, (3) the resulting operations are realized as FSMs (finite-state machines), and (4) these FSMs are implemented in software or in inexpensive off-the-shelf integrated circuits. Note that this technique does not require separability, in the usual sense. In this paper, the SKIPSM technique is applied to computing binary openings and closings in one pass using arbitrary binary structuring elements. Whether the resulting finite state machines are implemented in software or hardware, the result is generally much faster and/or much cheaper than conventional implementations. Furthermore, this same SKIPSM architecture is highly versatile and programmable, allowing it to be software-reconfigured to perform hundreds of other software- based or pipelined image processing operations, such a binary and grey-level morphology, the Grassfire Transform, binary and grey-level template matching, binary skeletonization, etc.

关键词： fast implementations image processing finite-state machines separability pipelining real-time inspection

来源：评论

学校读者我要写书评

暂无评论

Design and evaluation of automated checks for signal processing applications 6

Design and evaluation of automated checks for signal process...

引用

Conference on advanced signal processing algorithms, architectures, and implementations VI

作者： Nair, VSS Kim, HC Krishnamurthy, N Abraham, JA SO METHODIST UNIV DEPT COMP SCI & ENGNDALLASTX 75275

ISBN: (纸本)0819422347

Most of the signal processing application programs involve computationally intensive iterative steps. In such programs, various failures in the underlying hardware manifest as control-flow errors that affect the reliability of the computed results. Various techniques have been proposed in the past to detect and recover from such control-flow errors. Unfortunately, all these techniques need either additional hardware or modification of the hardware and are not portable across various platforms. To circumvent these limitations, recently we have developed a high-level control-flow checking approach using assertions (CCA). In CCA, branch-free intervals in a given high-level language program are identified and the entry and exit points of the intervals are fortified through pre-inserted assertions. In this paper we describe an implementation of CCA through a pre-processor that will automatically insert the necessary assertions into a high-level language program. Based on the implementation we study the fault detection capabilities of CCA with the help of fault injection experiments using FERRARI.

关键词： Simulation of CCA and DLA aggregates Switches signal processing Reliability Computing systems Computer engineering Data modeling Error analysis Error control coding Computer science

来源：评论

学校读者我要写书评

暂无评论

An adaptive algorithm for interference cancelling in array processing 6

An adaptive algorithm for interference cancelling in array p...

引用

Conference on advanced signal processing algorithms, architectures, and implementations VI

作者： Luk, FT Qiao, SZ RENSSELAER POLYTECH INST DEPT COMP SCITROYNY 12180

ISBN: (纸本)0819422347

In array processing, one technique for cancelling interference in the presence of colored noise is the ULLV decomposition of a pair of matrices. The factorization is stable and accurate, and is easy to update when a row is added to either one of the two matrices. In earlier work, we made the assumptions that both matrices must have at least as many rows as columns and that the matrix representing interference must have full column rank. In this paper, we relax the latter restriction and allow the interference matrix to be rank deficient. We present an algorithm for computing the decomposition and two techniques for updating it. The details on updating are quite different from those in the full rank case. © 1996 SPIE. All rights reserved.

关键词： ULLV decomposition matrix updating noise subspace tracking

来源：评论

学校读者我要写书评

暂无评论

Fast blind signal separation for multi-user interference rejection in smart antenna arrays

Fast blind signal separation for multi-user interference rej...

引用

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

作者： Sarajedini, A Chau, PM Univ. of California/San Diego (United States)

ISBN: (纸本)0819425842

Spread spectrum modulation techniques such as frequency-hopped code division multiple access (FH-CDMA) are an efficient way to allow multi-user transmission over a limited bandwidth. Recently, there has been a push to increase user capacity over the same bandwidth. In particular, smart antenna arrays have been studied for their capacity gain potential. In this regard, we propose the use of blind signal separation for recovery of signals received through an antenna array. To implement this technique requires the antenna array vectors to be stationary which does not hold in FH-CDMA, so we also propose a new method for frequency compensation. We present the theoretical details of the frequency compensation and compare its performance to no frequency compensation. We then present the blind signal separation algorithm applied to a complex antenna array matrix and complex signals with noise and show in simulation that the blind signal separation works.

关键词： blind signal separation frequency compensation frequency-hopped CDMA spread spectrum

来源：评论

学校读者我要写书评

暂无评论

NInFEA: an embedded framework for the real-time evaluation of fetal ECG extraction algorithms

引用

BIOMEDICAL ENGINEERING-BIOMEDIZINISCHE TECHNIK 2013年第1期58卷 13-26页

作者： Pani, Danilo Barabino, Gianluca Raffo, Luigi Univ Cagliari Dept Elect & Elect Engn DIEE I-09123 Cagliari Italy

Fetal electrocardiogram (ECG) extraction from non-invasive biopotential recordings is a long-standing research topic. Despite the significant number of algorithms presented in the scientific literature, it is difficult to find information about embedded hardware implementations able to provide real-time support for the required features, bridging the gap between theory and practice. This article presents the NInFEA (non-invasive fetal ECG analysis) tool, an embedded hardware/software framework based on the hybrid dual-core OMAP-L137 low-power processor for the real-time evaluation of fetal ECG extraction algorithms. The hybrid platform, including a digital signal processor (DSP) and a general-purpose processor (GPP), allows achieving the best performance compared with single-core architectures. The GPP provides a portable graphical user interface, whereas the DSP is extensively used for advanced signal processing tasks. As a case study, three state-of-the-art fetal ECG extraction algorithms have been ported onto NInFEA, along with some support routines needed to provide the additional information required by the clinicians and supported by the user interface. NInFEA can be regarded both as a reference design for similar applications and as a common embedded low-power testbed for real-time fetal ECG extraction algorithms.

关键词： biomedical signal processing DSP platforms non-invasive fetal ECG real-time processing

来源：评论

学校读者我要写书评

暂无评论

IMPLEMENTING THE VITERBI ALGORITHM ON GENERAL-PURPOSE PARALLEL COMPUTERS

IMPLEMENTING THE VITERBI ALGORITHM ON GENERAL-PURPOSE PARALL...

引用

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

作者： ALSTON, MD CHAU, PM CHEUNG, KM Univ. of California/San Diego (United States) Jet Propulsion Lab. (United States)

ISBN: (纸本)081940943X

The Viterbi algorithm (VA) for decoding convolutionally encoded data has historically been implemented on special-purpose digital electronic hardware. For short/moderate (K equals 3 to 9) constraint length codes, a primary design goal is to maximize the decoded bit rate while minimizing circuit area. In recent years, a number of special-purpose architectures based upon shuffle-exchange networks, cube-connected cycles, ring-based networks, systolic arrays, or programmable processors have been designed for efficient implementation of the VA at these and longer constraint lengths. However, at the same time, the performance:cost ratio of high- end general-purpose computing machines has been improving dramatically. Recognizing the substantial investment in time and resources required to design and build an ASIC-based decoder for long (K equals 10 to 15) constraint length codes, the feasibility of implementation of the VA as a background process on a readily available general-purpose parallel processing machine deserves exploration. We consider the limitations and benefits of a Viterbi decoder for long constraint length codes implemented in software on a general-purpose parallel processing machine.

关键词： Computing systems Parallel processing Binary data Telecommunications Computer programming Forward error correction Network architectures Parallel computing signal processing Very large scale integration

来源：评论

学校读者我要写书评

暂无评论

TIME-RECURSIVE COMPUTATION AND REAL-TIME PARALLEL architectures, WITH APPLICATION ON THE MODULATED LAPPED TRANSFORM 4

TIME-RECURSIVE COMPUTATION AND REAL-TIME PARALLEL ARCHITECTU...

引用

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

作者： FRANTZESKAKIS, E BARAS, JS LIU, KJR Univ. of Maryland/College Park (United States)

ISBN: (纸本)0819412767

In this paper, we establish an architectural framework for parallel time-recursive computation. We consider a class of linear operators that consists of the discrete time, time invariant, compactly supported, but otherwise arbitrary kernel functions. We specify the properties of the linear operators that can be implemented efficiently in a time-recursive way. Based on these properties, we develop a routine that produces a time-recursive architectural implementation for a given operator. This routine is instructive for the design of a CAD tool that will facilitate the architecture derivation. Using this background, we design an architecture for the Modulated Lapped Transform (commonly called Modified Discrete Cosine Transform), which has linear cost in operator counts.

关键词： Modulation Computer aided design Computer architecture Fourier transforms Convolution Digital filtering Very large scale integration Radar Video Video processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：