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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

392 篇 会议
16 篇 期刊文献
8 册 图书
4 篇 学位论文

馆藏范围

420 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

366 篇 工学
- 192 篇 电气工程
- 148 篇 计算机科学与技术...
- 147 篇 信息与通信工程
- 93 篇 软件工程
- 55 篇 电子科学与技术（可...
- 28 篇 仪器科学与技术
- 28 篇 控制科学与工程
- 13 篇 光学工程
- 9 篇 材料科学与工程（可...
- 8 篇 测绘科学与技术
- 4 篇 生物医学工程（可授...
- 3 篇 机械工程
- 3 篇 航空宇航科学与技...
- 2 篇 力学（可授工学、理...
- 2 篇 化学工程与技术
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 交通运输工程
- 1 篇 船舶与海洋工程
- 1 篇 生物工程
271 篇 理学
- 178 篇 数学
- 129 篇 物理学
- 46 篇 统计学（可授理学、...
- 2 篇 化学
- 2 篇 生物学
- 2 篇 系统科学
- 1 篇 地球物理学
60 篇 医学
- 59 篇 临床医学
- 3 篇 基础医学(可授医学...
3 篇 管理学
- 3 篇 管理科学与工程(可...

主题

171 篇 signal processin...
42 篇 time-frequency a...
36 篇 fourier transfor...
35 篇 signal to noise ...
34 篇 digital signal p...
31 篇 image processing
28 篇 interference (co...
26 篇 sensors
25 篇 signal detection
23 篇 algorithm develo...
22 篇 matrices
21 篇 statistical anal...
20 篇 array processing
18 篇 signal analyzers
16 篇 radar
16 篇 electronic filte...
15 篇 data modeling
14 篇 frequency modula...
14 篇 very large scale...
14 篇 digital filterin...

机构

7 篇 cuny ny 10021 us...
7 篇 univ. of califor...
5 篇 us dept def ft g...
5 篇 queensland univ....
5 篇 mcmaster univ.
4 篇 univ. of souther...
4 篇 univ windsor vls...
4 篇 univ pittsburgh ...
4 篇 univ of michigan...
4 篇 michigan state u...
3 篇 villanova univ c...
3 篇 iowa state univ.
3 篇 univ. of minneso...
3 篇 univ calif los a...
3 篇 rutgers univ.
3 篇 univ. of michiga...
3 篇 drexel univ dept...
2 篇 the pennsylvania...
2 篇 univ. of illinoi...
2 篇 univ of washingt...

作者

13 篇 cohen l
7 篇 williams wj
7 篇 yao k
6 篇 franklin t luk
5 篇 williams william...
5 篇 nelson dj
5 篇 amin mg
5 篇 chau pm
5 篇 cohen leon
5 篇 boashash b
5 篇 parhi kk
5 篇 jullien ga
4 篇 amin moeness g.
4 篇 lorenzelli f
4 篇 luk franklin t.
4 篇 loughlin p
4 篇 qiao sz
3 篇 white langford b...
3 篇 shroff gautam m.
3 篇 nickel robert m.

语言

416 篇 英文
3 篇 其他
1 篇 中文

检索条件"任意字段=Advanced Signal Processing Algorithms, Architectures, and Implementations XVI"

共 420 条记录，以下是261-270 订阅

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

详细简洁

排序：

CORDIC processor architectures

CORDIC processor architectures

引用

advanced signal processing algorithms, architectures, and implementations II

作者： Boehme, Johann F. Timmermann, D. Hahn, H. Hosticka, Bedrich J. Ruhr Univ. Bochum Bochum Federal Republic of Germany

ISBN: (纸本)0819406945

As CORDIC algorithms receive more and more attention in elementary function evaluation and signal processing applications, the problem of their VLSI realization has attracted considerable interest. In this work we review the CORDIC fundamentals covering algorithm, architecture, and implementation issues. Various aspects of the CORDIC algorithm are investigated such as efficient scale factor compensation, redundant and non-redundant addition schemes, and convergence domain. Several CORDIC processor architectures and implementation examples are discussed.

关键词： 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

来源：评论

学校读者我要写书评

暂无评论

Separating desired image and signal invariant components from extraneous variations 6

Separating desired image and signal invariant components fro...

引用

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

作者： Williams, WJ Zalubas, EJ Hero, A UNIV MICHIGAN DEPT ELECT ENGN & COMP SCIANN ARBORMI 48109

ISBN: (纸本)0819422347

Images and signals can be characterized by representations invariant to time shifts, spatial shifts, frequency shifts, and scale changes as the situation dictates. Advances in time-frequency analysis and scale transform techniques have made this possible. The next step is to distinguish between invariant forms representing different classes of image or signal. Unfortunately, additional factors such as noise contamination and `style' differences complicate this. A ready example is found in text, where letters and words may vary in size and position within the image segment being examined. Examples of complicating variations include font used, corruption during fax transmission, and printer characteristics. The solution advanced in this paper is to cast the desired invariants into separate subspaces for each extraneous factor or group of factors. The first goal is to have minimal overlap between these subspaces and the second goal is to be able to identify each subspace accurately. Concepts borrowed from high-resolution spectral analysis, but adapted uniquely to this problem have been found to be useful in this context. Once the pertinent subspace is identified, the recognition of a particular invariant form within this subspace is relatively simple using well-known singular value decomposition techniques.

关键词： scale transform Mellin transform wordspotting singular value decomposition character recognition time-frequency

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Approach to the joint optimization of video communications and video signal processing

Approach to the joint optimization of video communications a...

引用

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

作者： Pearlman, WA Medley, MJ Suter, BW Rensselaer Polytech Inst Ctr Next Generat Video Res Troy NY 12180 USA

ISBN: (纸本)0819441880

Compressed video bitstreams require protection from channel errors in a wireless channel. The three-dimensional (3-D) SPIHT coder has proved its efficiency and its real-time capability in compression of video. A forward-error-correcting (FEC) channel (RCPC) code combined with a single ARQ (automatic-repeat-request) proved to be an effective means for protecting the bitstream. In this paper, the need for ARQ is eliminated by making the 3-D SPIHT bitstream more robust and resistant to channel errors. Packetization of the bitstream and the reorganization of these packets to achieve scalability in bit rate and/or resolution in addition to robustness is demonstrated and combined with channel coding to not only protect the integrity of the packets, but also allow detection of packet decoding failures, so that only the cleanly recovered packets are reconstructed. In extensive comparative tests, the reconstructed video is shown to be superior to that of MPEG-2, with the margin of superiority growing substantially as the channel becomes noisier.

关键词： video compression video transmission robust source coding error resilient transmission combined source-channel coding 3-D wavelet transform embedded wavelet coding

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共42页 << < 23 24 25 26 27 28 29 30 31 32 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：