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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

1,258 篇 会议
8 篇 期刊文献

馆藏范围

1,266 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

534 篇 工学
- 399 篇 电气工程
- 289 篇 信息与通信工程
- 135 篇 计算机科学与技术...
- 75 篇 机械工程
- 66 篇 测绘科学与技术
- 47 篇 软件工程
- 25 篇 电子科学与技术（可...
- 13 篇 控制科学与工程
- 9 篇 仪器科学与技术
- 3 篇 力学（可授工学、理...
- 3 篇 光学工程
- 3 篇 生物医学工程（可授...
- 2 篇 动力工程及工程热...
- 2 篇 化学工程与技术
- 2 篇 交通运输工程
- 2 篇 航空宇航科学与技...
- 1 篇 生物工程
73 篇 理学
- 60 篇 数学
- 30 篇 统计学（可授理学、...
- 12 篇 物理学
- 5 篇 系统科学
- 4 篇 地球物理学
- 2 篇 化学
- 2 篇 生物学
42 篇 医学
- 42 篇 临床医学
- 2 篇 基础医学(可授医学...
- 2 篇 药学(可授医学、理...
2 篇 教育学
- 2 篇 教育学
2 篇 管理学
- 1 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...

主题

342 篇 array signal pro...
247 篇 signal processin...
189 篇 sensor arrays
139 篇 estimation
135 篇 signal processin...
111 篇 signal to noise ...
105 篇 conferences
92 篇 arrays
92 篇 direction-of-arr...
72 篇 vectors
71 篇 interference
69 篇 covariance matri...
65 篇 direction of arr...
61 篇 antenna arrays
50 篇 covariance matri...
50 篇 radar
48 篇 wireless sensor ...
47 篇 robustness
46 篇 simulation
45 篇 sensors

机构

11 篇 department of el...
10 篇 temple univ dept...
7 篇 xidian univ natl...
6 篇 school of inform...
6 篇 school of inform...
6 篇 mit lincoln labo...
5 篇 tech univ darmst...
5 篇 communication sy...
5 篇 mit lincoln lab ...
5 篇 center for advan...
5 篇 national laborat...
5 篇 communications r...
4 篇 univ alabama dep...
4 篇 natl univ def te...
4 篇 school of electr...
4 篇 university of el...
4 篇 college of infor...
4 篇 school of electr...
4 篇 mit lincoln lab ...
4 篇 city univ hong k...

作者

13 篇 marius pesavento
12 篇 yimin d. zhang
11 篇 zhang yimin d.
10 篇 wei liu
9 篇 liu wei
8 篇 bin liao
7 篇 visa koivunen
7 篇 martin haardt
7 篇 a.b. gershman
7 篇 lei huang
7 篇 guisheng liao
6 篇 pesavento marius
6 篇 piya pal
6 篇 liao guisheng
5 篇 nehorai arye
5 篇 walter kellerman...
5 篇 qiang li
5 篇 p. p. vaidyanath...
5 篇 koivunen visa
5 篇 abdelhak m. zoub...

语言

1,266 篇 英文

检索条件"任意字段=2008 IEEE Sensor Array and Multichannel Signal Processing Workshop"

共 1266 条记录，以下是1181-1190 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Stochastic partial update LMS algorithm for adaptive arrays

Stochastic partial update LMS algorithm for adaptive arrays

引用

1st ieee sensor array and multichannel signal processing workshop (SAM 2000)

作者： Godavarti, M Hero, AO Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA

ISBN: (纸本)0780363396

Partial updating of LMS filter coefficients is an effective method for reducing the computational load and the power consumption in adaptive filter implementations. Several algorithms have been proposed in the literature based on partial updating. Unfortunately, it has been observed that these algorithms don't have good convergence properties in practice. In particular, there generally exist signals for which these algorithms stagnate or diverge. In this paper, we propose a new algorithm, called the Stochastic Partial Update LMS (SPU-LMS) algorithm which attempts to remedy some of the drawbacks of existing algorithms. The SPU-LMS algorithm differs from the existing algorithms in that the subsets to be updated are chosen in a random manner at each iteration. We derive conditions for filter stability, convergence rate, and steady state error for the proposed algorithm under an independent snapshots assumption in the context of adaptive beamforming for antenna arrays. We verify the analysis via computer simulations and illustrate the advantages of the new algorithm through examples.

关键词： Adaptive arrays Adaptive filters array signal processing Computer errors Convergence Energy consumption Least squares approximation Stability Steady-state Stochastic processes

来源：评论

学校读者我要写书评

暂无评论

Denoising multisensor data

Denoising multisensor data

引用

1st ieee sensor array and multichannel signal processing workshop (SAM 2000)

作者： Rao, AM Jones, DL Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA

ISBN: (纸本)0780363396

Multisensor array processing of noisy measurements has received considerable attention in many areas of signal processing. Thr,optimal processing techniques developed so far usually assume the signal and noise processes are at least wide-sense-stationary, yet a need exists for efficient, effective methods for processing nonstationary signals. While wavelets have proven to be useful tools in dealing with certain nonstationary signals, the way in which wavelets are to be used in the multisensor setting has only recently been considered. In this work we show how multisensor denoising can be carried out in perturbed, narrowband arrays even in the absence of the signal source's direction of arrival. We show that our proposed blind estimator can be implemented efficiently and robustly employing only wavelet and discrete Fourier transforms while entailing only a small loss in performance.

关键词： array processing

来源：评论

学校读者我要写书评

暂无评论

Approximate Maximum Likelihood DOA estimation in multiplicative noise environments

Approximate Maximum Likelihood DOA estimation in multiplicat...

引用

1st ieee sensor array and multichannel signal processing workshop (SAM 2000)

作者： Besson, O Vincent, F Stoica, P Gershman, AB ENSICA Dept Avion & Syst Toulouse France

ISBN: (纸本)0780363396

We consider the problem of localizing a source by means of a uniform linear array of sensors when the received signal is corrupted by multiplicative noise. Since the exact Maximum Likelihood (ML) estimator is computationally intensive, two approximate solutions are proposed, originating from the analysis of the high and low signal to Noise Ratio (SNR) cases, respectively. First, starting with the no additive noise case, a very simple approximate ML (AML(1)) estimator is derived. A theoretical expression for its asymptotic variance in the presence of additive noise is derived. It shows that the AML1 estimator has a performance close to the Cramer-Rao bound (CRB) for moderate to high SNR. Next, the low SNR case is considered and the corresponding AML(2) solution is derived. It is shown that the approximate ML criterion can be concentrated with respect to (w.r.t.) both the multiplicative and additive noise powers, leaving out a 2-D minimization problem instead of a 4-D problem required by the exact ML. Numerical results illustrate the performance of the estimators and confirm the validity of the theoretical analysis.

关键词： Additive noise Direction of arrival estimation Integrated circuit modeling Integrated circuit noise Maximum likelihood estimation Parameter estimation Scattering sensor arrays signal to noise ratio Working environment noise

来源：评论

学校读者我要写书评

暂无评论

Subband STAP processing, the fifth generation

Subband STAP processing, the fifth generation

引用

1st ieee sensor array and multichannel signal processing workshop (SAM 2000)

作者： Steinhardt, AO Pulsone, NB DARPA Tact Technol Off Arlington VA 22203 USA

ISBN: (纸本)0780363396

Adaptive array processing has moved through several stages of evolution. First there was spatial only adaptation, using gradient based algorithms. Second was true space-time adaptivity using time-taps on multiple channels. Third came more rapid convergence, using sample matrix inversion strategies. Fourth came dimensionally large system solutions, which focused opt the need for reduced DOF such as beamspace, eigenspace, MUSIC, ESPRIT, BASS-ALE, etc. This paper argues that sue are on the threshold of the fifth generation of STAP;mainly STAP in the subband domain. Subband STAP, is an elegant and computationally efficient solution to the need for increasing bandwidth in radar and sonar processing as well as mobile communications. We begin by motivating the need for wider bandwidths, from a SAR imaging perspective. Next, we show that the computational burden of wideband STAP is untenable for existing and emerging military requirements. Having motivated a compelling need we then propose Subband STAP as a solution, motivated from an active sensor perspective. We describe Subband STAP as an extension of the familiar STAP 3D datacube (range, angle, Doppler) to a 4D hypercube (subband range, angle, subband Doppler, subband frequency). Subbanding allows us to overcome challenging wideband effects such as Doppler-frequency coupling, high-resolution range migration, target self-nulling channel decorrelation, and dispersion. We describe the challenges of Subband STAP interference rejection and subband recombination with artifacts.

关键词： array signal processing Bandwidth Hypercubes Military computing Mobile communication Multiple signal classification Radar imaging Radar polarimetry Sonar Wideband

来源：评论

学校读者我要写书评

暂无评论

Intrinsic Cramer-Rao bounds and subspace estimation accuracy

Intrinsic Cramer-Rao bounds and subspace estimation accuracy

引用

1st ieee sensor array and multichannel signal processing workshop (SAM 2000)

作者： Smith, ST MIT Lincoln Lab Lexington MA 02420 USA

ISBN: (纸本)0780363396

signal processing estimation problems are traditionally posed for a set of given, if unknown, parameters, such as angle and/or Doppler. Nevertheless, there are estimation problems on manifolds where no set of intrinsic coordinates exist. One example encountered frequently is the problem of estimating a particular subspace. The set of subspaces, called the Grassmann manifold, has no fixed coordinate system associated with it. This paper addresses the problem of applying classical Cramer-Rao analysis to determine the fundamental bounds of estimation accuracy on arbitrary manifolds. Coordinate-free versions of the Cramer-Rao bound are derived to accomplish this. These bounds are then applied to the specific problem of estimating the subspace given an independent collection of data snapshots. The foot-mean-square-error of the standard method of estimating subspaces using the singular value decomposition is compared to the intrinsic Cramer-Rao bound by varying both the SNR of the unknown subspace and the sample support. It will be seen that this SVD-based method yields accuracies very close to Cramer-Rao bound, establishing that the principal invariant subspace provides an excellent estimator of an unknown subspace, a conclusion that would not in general be possible without coordinate-free Cramer-Rao bounds.

关键词： Contracts Covariance matrix Equations Interference Laboratories Military computing signal processing Singular value decomposition Symmetric matrices Yield estimation

来源：评论

学校读者我要写书评

暂无评论

Multi-rate Adaptive Beamforming (MRABF)

Multi-rate Adaptive Beamforming (MRABF)

引用

1st ieee sensor array and multichannel signal processing workshop (SAM 2000)

作者： Cox, H ORINCON Corp Arlington VA 22203 USA

ISBN: (纸本)0780363396

An important trend in underwater acoustics is the use of large arrays with many elements and small resolution cells in an effort to detect weak signals. Frequently, the background noise is dominated by multiple moving surface ships that act like discrete interferers. These interferers may move through many spatial resolution cells in the time required to obtain sufficient "snapshots" for covariance matrix estimation. The non-stationarity of the background limits the performance of adaptive algorithms. Reduced degree-of-freedom approaches that can track and rapidly null interferers before they move too far are of great interest. The paper presents a new class of algorithms in which a low-rank, dynamically changing interference sub-space is estimated and tracked using a short-term average. An orthogonal projection is then applied to the data to null components in the interference sub-space. A second stage of adaptive beamforming that uses a longer averaging time is then applied to the projected data. Unlike most sub-space approaches that work for strong signals, there is no requirement that the signal be contained in the interference sub-space. It is shown how multiple interferers moving rapidly across beams can be tracked and nulled to reveal the presence of a weak target not visible with conventional, adaptive, or usual sub-space methods. The effectiveness of multi-rate adaptive beamforming is illustrated by examples. It is shown that moving interferers are effectively nulled to allow detection of weak signals when other methods including MVDR, conventional, and signal subspace fail.

关键词： Acoustic signal detection array signal processing Background noise Interference Marine vehicles signal detection signal resolution Spatial resolution Underwater acoustics Underwater tracking

来源：评论

学校读者我要写书评

暂无评论

Space-time modulated codes for memory channels: Capacity and information rates, zero-forcing decision feedback equalizer

Space-time modulated codes for memory channels: Capacity and...

引用

1st ieee sensor array and multichannel signal processing workshop (SAM 2000)

作者： Xia, XG Wang, GY Fan, PY Univ Delaware Dept Elect & Comp Engn Newark DE 19716 USA

ISBN: (纸本)0780363396

Modulated codes (MC) are error correction codes (ECC) defined on the complex field. In this paper, we study space-time MC for memory channels. Similar to MC for single antenna systems, the space-time MC can be also naturally combined with a multiple antenna system with ISI. We derive some lower bounds on the capacities C and the information rates I-i.i.d. Of the MC coded systems. As a property of space-time MC, it is shown that, for an N transmit and N receive antenna channel with memory and AWGN, there exist MC with arbitrary rates r, 0 < r < 1, such that the MC coded systems have larger information rates I-i.i.d. than the original system does at relatively low channel SNR. In this paper, we also propose an MC coded sere-forcing decision feedback equalizer (ZF-DFE).

关键词： AWGN Channel capacity Decision feedback equalizers Error correction codes Information rates Intersymbol interference Memoryless systems Modulation coding Receiving antennas signal processing

来源：评论

学校读者我要写书评

暂无评论

Design tradeoffs in a hardware implementation of the K-means clustering algorithm

Design tradeoffs in a hardware implementation of the K-means...

引用

1st ieee sensor array and multichannel signal processing workshop (SAM 2000)

作者： Leeser, M Theiler, J Estlick, M Szymanski, JJ Northeastern Univ Dept Elect & Comp Engn Boston MA 02115 USA

ISBN: (纸本)0780363396

Hyperspectral imagery provides exquisitely detailed information, but poses a serious challenge to the image analyst Massive quantities of data must be reduced in a way that identifies useful features, Pixel clustering algorithms provide one approach: each pixel is assigned to a class based on the spectral similarity of that pixel to other members of the class. An image where each pixel is represented by its class provides a single picture (not hundreds of channels) for the analyst to interpret, Opportunities for fine-grain parallelism in this computationally intensive calculation motivate the consideration of specialized hardware. We are developing an FPGA-based implementation of the k-means clustering algorithm, because FPGAs can provide considerable speedup yet are sufficiently flexible to permit the testing of variants and tradeoffs. Assigning pixels to classes requires a definition of spectral similarity. The standard choice is the Euclidean distance (sum of the squared differences between the pixel and the cluster center taken on a coordinate by coordinate basis). We consider two alternative distances: the Manhattan (sum of the absolute coordinate differences) and the Mar (maximum of the absolute differences). The Euclidean distance is optimal in the sense of minimizing within-class variance, but requires computing many squares. The Manhattan and Max distances eliminate this squaring, and furthermore reduce the number of bits needed to store intermediate calculations. We conducted two sets of experiments to assess the tradeoff between quality of clustering and efficiency of hardware implementation. The first considered an idealized setup for assessing mis-classification rates and their effect on within-class variance. The second evaluated within-class variance for real 224-channel AVIRIS data sets. Both experiments confirmed that the highest quality clusters are achieved using the Euclidean metric, and quantified the difference. In comparing the faster, alterna

关键词： Clustering algorithms Concurrent computing Euclidean distance Hardware Hyperspectral imaging Hyperspectral sensors Image analysis Information analysis Parallel processing Pixel

来源：评论

学校读者我要写书评

暂无评论

The properties of adaptive algorithms with time varying weights

The properties of adaptive algorithms with time varying weig...

引用

sensor array and multichannel signal processing workshop

作者： M. Zatman MIT Lincoln Laboratories Lexington MA USA

Most adaptive array processing schemes assume that the interference is 'wide sense stationary'. However, in practice this assumption is often violated. For example there may be motion of either the array and/or the interference during the processing interval. The asymptotic performance of two adaptive beamforming algorithms which compensate for this type of changing interference scenario are analyzed in this paper.

关键词： Adaptive algorithm Interference array signal processing Covariance matrix Performance analysis Algorithm design and analysis signal to noise ratio Adaptive arrays Vectors Laboratories

来源：评论

学校读者我要写书评

暂无评论

Improved array self calibration with large sensor position errors for closely spaced sources

Improved array self calibration with large sensor position e...

引用

sensor array and multichannel signal processing workshop

作者： B.P. Flanagan K.L. Bell MITRE Corporation Reston VA USA Department of Appl. and Engineering Statistics George Mason University Fairfax VA USA

Self-calibration algorithms estimate both source directions-of-arrival (DOAs) and perturbed array response vector parameters, such as sensor locations. Calibration errors are usually assumed to be small and a first order approximation to the perturbed array response vector is often used to simplify the estimation procedure. We improve on a previously presented technique that eliminates the small error assumption. The improved technique has better performance for closely spaced sources for both small and large calibration errors.

关键词： sensor arrays Calibration Phased arrays Direction of arrival estimation Covariance matrix sensor phenomena and characterization Mutual coupling Matrix decomposition array signal processing Multiple signal classification

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共127页 << < 115 116 117 118 119 120 121 122 123 124 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：