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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

421 篇 会议
19 篇 期刊文献
11 册 图书
6 篇 学位论文

馆藏范围

457 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

395 篇 工学
- 208 篇 电气工程
- 163 篇 计算机科学与技术...
- 159 篇 信息与通信工程
- 98 篇 软件工程
- 60 篇 电子科学与技术（可...
- 28 篇 仪器科学与技术
- 28 篇 控制科学与工程
- 13 篇 光学工程
- 10 篇 材料科学与工程（可...
- 8 篇 测绘科学与技术
- 4 篇 生物医学工程（可授...
- 3 篇 机械工程
- 3 篇 航空宇航科学与技...
- 2 篇 力学（可授工学、理...
- 2 篇 化学工程与技术
- 1 篇 动力工程及工程热...
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 交通运输工程
286 篇 理学
- 187 篇 数学
- 137 篇 物理学
- 49 篇 统计学（可授理学、...
- 4 篇 系统科学
- 2 篇 化学
- 2 篇 生物学
- 1 篇 地球物理学
62 篇 医学
- 61 篇 临床医学
- 3 篇 基础医学(可授医学...
4 篇 管理学
- 4 篇 管理科学与工程(可...
- 2 篇 工商管理

主题

172 篇 signal processin...
42 篇 time-frequency a...
36 篇 signal to noise ...
36 篇 fourier transfor...
36 篇 digital signal p...
32 篇 image processing
29 篇 interference (co...
27 篇 sensors
26 篇 signal detection
24 篇 array processing
23 篇 algorithm develo...
22 篇 matrices
22 篇 statistical anal...
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 篇 queens univ belf...
2 篇 univ. of illinoi...

作者

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 篇 boashash boualem
4 篇 luk franklin t.
4 篇 loughlin p
4 篇 qiao sz
3 篇 white langford b...
3 篇 shroff gautam m.

语言

454 篇 英文
3 篇 其他

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

共 457 条记录，以下是421-430 订阅

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

详细简洁

排序：

Application of canonical correlation analysis in detection in presence of spatially correlated noise

Application of canonical correlation analysis in detection i...

引用

advanced signal processing algorithms, architectures, and implementations II

作者： Chen, Wei G. Reilly, James P. Wong, Kon M. McMaster Univ. Hamilton Ontario Canada

ISBN: (纸本)0819406945

A new approach to the problem of detecting the number of signals in unknown colored noise environments is presented. Based on an assumption that the noise is correlated only over a limited spatial range, the principle of canonical correlation analysis is applied to the outputs of two spatially-separated arrays. The number of signals is determined by testing the significance of the sample canonical correlation coefficients. The new method is shown to work well in both white and unknown colored noise situations and does not require any subjective threshold setting. Instead, a set of threshold values are generated according to a specified or desired false alarm rate. Simulation results are included to illustrate the comparative performance of the proposed canonical correlation technique (CCT), versus the well-known AIC and MDL criteria, in colored noise. It is found that the performance of the AIC and MDL criteria degrade very rapidly as the degree of color in the noise increases. On the other hand, the performance of the CCT method is relatively insensitive with respect to variations in degree of color.

关键词： signal processing

来源：评论

学校读者我要写书评

暂无评论

Pipelining multiple singular value decomposition (SVDs) on a single processor array

Pipelining multiple singular value decomposition (SVDs) on a...

引用

advanced signal processing: algorithms, architectures, and implementations V

作者： Kota, Kishore Cavallaro, Joseph R. Rice Univ. Houston TX USA

ISBN: (纸本)0819416207

We present a new family of architectures for processor arrays to implement Jacobi SVD which allow systolic loading and unloading of input and result matrices. Unlike most of the previous SVD arrays in the literature, our architectures do not require special handling of external I/O and hence are closer to the traditional concept of systolic architectures. The boundary processors communicate with the host the same way any of the interior processors communicate with their neighbors. The arrays are surprisingly uniform and simple. The various architectures in the family represent different throughput-hardware tradeoffs corresponding to the degree to which the multiple sweeps have been unrolled and determine the number of independent SVDs which may be pipelined on the array. We achieved systolic loading by using the flexibility provided by the cyclic Jacobi method on the order in which pivot pairs may be chosen. The array operates on the matrix data even as it is being loaded. Once the pipeline is full, the ordering is very similar to odd-even ordering. Our ordering is equivalent to cyclic-by-rows ordering and hence the algorithm is guaranteed to converge. Our systolic loading scheme is very important in an I/O limited system, since it allows more communication to occur in parallel, where the communication includes the loading and unloading operations. The array with the highest throughput in our family of architectures, which implement one-sided Jacobi (either Hestenes' method or Eberlein and Park's method), is a linear array of processors with unidirectional links between neighbors. The architectures with lower throughput require fewer processors connected in a ring, allowing data to recirculate among the processors. The input matrix is loaded one column at a time from the left and the results stream out one column at a time from the right.

关键词： Pipeline processing systems

来源：评论

学校读者我要写书评

暂无评论

Generic High-Speed Design with Low-Area implementations of Statistical Operations Based on an FPGA Device 26

Generic High-Speed Design with Low-Area Implementations of S...

引用

26th International Symposium on Symbolic and Numeric algorithms for Scientific Computing, SYNASC 2024

作者： Chehaitly, Mouhamad Querol, Jorge Vummadisetty, Praveen Chatzinotas, Symeon University of Luxembourg SnT Luxembourg Luxembourg

ISBN: (纸本)9798331532833

Artificial Intelligence has emerged as a transformative technology, revolutionizing numerous industries by enabling advanced automation, predictive analytics, and decision-making capabilities. For that Artificial Intelligence overruns many domains like telecommunication, smart manufacturing industry, autonomous machines, Automated Disease Diagnosis in Medical Imaging, defense, and others. On the other hand, the hardware implementation of Artificial Intelligence comes with certain challenges and constraints, especially in a critical area, which leverages machine learning algorithms and real-time data analysis to optimize production processes and improve overall efficiency. Statistical operations play a crucial role in various machine learning algorithms to understand, process data, or make predictions to optimize models. So, in this work, we developed a high-speed and low-area design and implemented statistical operations for image or signal processing using an FPGA Device. To enhance the performance, we develop different hardware architectures based on different levels of parallelism to process the statistical operations to compute the Mean, Variance, and RMS (Root Mean Square). These generic architectures work in parallel/pipeline architectures with and without memory. The proposed architectures implement an FPGA target (Intel/Altera Agilex 7: AGMH039R47A2E1V) using Altera Quartus prime pro edition version 23.4 and achieve an ultra-high throughput with low-area consumption compared to the state-of-art methods. For 480×640 image size, the mean calculation architecture involves 1498 logic registers, 1912 slice LUT, and just 29kbits memory and it operates at a maximum frequency of 406.5MHz. Additionally, for an 8×8 image size, we need 33 clock cycles to achieve the mean calculation and 33+1 clock cycles to complete the variance calculation, compared to other approaches that require more than 64 clock cycles. © 2024 IEEE.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Computing the generalized singular value decomposition on the connection machine

Computing the generalized singular value decomposition on th...

引用

advanced signal-processing algorithms, architectures, and implementations

作者： Park, Haesun Ewerbring, L.Magnus Univ of Minnesota Minneapolis United States

A new algorithm for computing the generalized singular value decomposition that diagonalizes two matrices is introduced. First, two existing algorithms are studied, one due to Paige and the other to Hari and Veselic. The former requires only orthogonal plane transformations, resulting in two matrices with parallel rows. The latter employs nonsingular (not necessarily orthogonal) transformations to directly diagonalize the two data matrices. For many applications, it is preferable to be given both the diagonal matrices and the transformation matrices explicitly. Our algorithm has the advantages that the nonsingular transformation is readily available, computation of transformations is simple, convergence test is efficient in a parallel computing environment, and the condition of each nonsingular transformation can be controlled. We present implementation results, obtained on a Connection Machine 2, to compare our new algorithm with that of Paige.

关键词： signal processing

来源：评论

学校读者我要写书评

暂无评论

Transient detection in the presence of strong narrow band interference via Wigner-Ville spectrum

Transient detection in the presence of strong narrow band in...

引用

advanced signal processing algorithms, architectures, and implementations 1990

作者： Marinovich, Nenad M. Roytman, Leonid M. Department of Electrical Engineering City College of the City University of New York New YorkNY10031 United States

We consider the problem of detecting a known Gaussian random transient in the presence of a strong, known, random, Gaussian, narrowband interference. This can be regarded as a special case of the classical problem of detecting a known Gaussian random signal in known Gaussian colored noise. There exists a standard solution for such a problem, based on the classical optimum detector for random signals in noise. However, such a detector does not explicitly use the non-stationary character of the signal as a priori available information. Reformulation of the optimum detection in the time-frequency plane allows one to exploit this distinguishing signal feature and suppress the stationary interference and noise. This is accomplished here by use of the Wigner-Ville signal representation and an optimum signal/noise subspace decomposition that maximizes the transient signal to noise ratio. The new detection procedure eliminates the subspace where major part of the energy of random noise sample will fall while retaining almost all of the signal energy. In this fashion, a gain in the output signal to noise ratio is achieved as verified by simulations. © 1990 SPIE. All rights reserved.

关键词： signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

High-performance FFT implementation on the BOPS ManArray parallel DSP

High-performance FFT implementation on the BOPS ManArray par...

引用

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

作者： Pitsianis, Nikos P. Pechanek, Gerald BOPS Inc Chapel Hill United States

We present a high performance implementation of the FFT algorithm on the BOPS ManArray parallel DSP processor. The ManArray we consider for this application consists of an array controller and 2 to 4 fully interconnected processing elements. To expose the parallelism inherent to an FFT algorithm we use a factorization of the DFT matrix in Kronecker products, permutation and diagonal matrices. Our implementation utilizes the multiple levels of parallelism that are available on the ManArray. We use the special multiply complex instruction, that calculates the product of two complex 32-bit fixed point numbers in 2 cycles (pipelinable). Instruction level parallelism is exploited via the indirect Very Long Instruction Word (iVLIW). With an iVLIW, in the same cycle a complex number is read from memory, another complex number is written to memory, a complex multiplication starts and another finishes, two complex additions or subtractions are done and a complex number is exchanged with another processing element. Multiple local FFTs are executed in Single Instruction Multiple Data (SIMD) mode, and to avoid a costly data transposition we execute distributed FFTs in Synchronous Multiple Instructions Multiple Data (SMIMD) mode.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Kernel synthesis for generalized time-frequency distributions using the method of projections onto convex sets

Kernel synthesis for generalized time-frequency distribution...

引用

advanced signal-processing algorithms, architectures, and implementations

作者： Oh, Seho Marks II, R.J. Atlas, L.E. Pitton, J.W. Univ of Washington Seattle United States

The kernel in Cohen's generalized time-frequency representation (GTFR) requires is chosen in accordance to certain desired performance attributes. Properties of the kernel are typically expressed as constraints. We establish that many commonly used constraints are convex in the sense that all allowable kernels satisfying a given constraint form a convex set. Thus, for a given set of constraints, the kernel can be designed by alternately projecting among these sets. If there exists a nonempty intersection among the constraint sets, then the theory of projection onto convex sets (POCS) guarantees convergence to a point in the intersection. If the constraints can be partitioned into two sets, each with a nonempty intersection, the POCS guarantees convergence to a kernel that satisfies the inconsistent constraints with minimum mean square error.

关键词： signal processing

来源：评论

学校读者我要写书评

暂无评论

Transient detection in the presence of strong narrow band interference via Wigner-Ville spectrum

Transient detection in the presence of strong narrow band in...

引用

advanced signal-processing algorithms, architectures, and implementations

作者： Marinovich, Nenad M. Roytman, Leonid M. City Univ of New York New York United States

关键词： signal processing

来源：评论

学校读者我要写书评

暂无评论

Instantaneous frequency and kernel requirements for discrete time-frequency distributions

Instantaneous frequency and kernel requirements for discrete...

引用

advanced signal-processing algorithms, architectures, and implementations

作者： Jeong, Jechang Cunningham, Gregory S. Williams, William J. Univ of Michigan Ann Arbor United States

In this paper, we introduce a new definition for the instantaneous frequency of a discrete-time analytic signal. Unlike the existing definition which uses only two data samples around a particular time, this method utilizes all the data samples for estimating the instantaneous frequency. We prove that this quantity is identical to the average frequency evaluated at the particular time in the discrete-time TFD. This property is consistent with the analogous continuous-time property. We also derive requirements on the discrete-time kernel needed to satisfy this property. Using computer-generated signals and real data, performance comparisons are made between the proposed approach and the existing one.

关键词： signal processing

来源：评论

学校读者我要写书评

暂无评论

Translation, rotation and scaling invariant object and texture classification using polyspectra

Translation, rotation and scaling invariant object and textu...

引用

advanced signal-processing algorithms, architectures, and implementations

作者： Tsatsanis, Michail K. Giannakis, Georgios B. Univ of Virgina Charlottesville United States

The problem addressed in this paper is the detection and classification of deterministic objects and random textures in a noisy scene. An energy detector is developed in the cumulant domain, by exploiting the noise insensitivity of higher-order statistics. An efficient implementation of this detector is described, using matched filtering. Its performance is analyzed using asymptotic distributions in a binary hypothesis testing framework. Object and texture classifiers are derived using higher-order statistics. They are minimum distance classifiers in the cumulant domain, and can be efficiently implemented using a bank of matched filters. Further, they are robust to additive Gaussian noise and insensitive to object shifts. Extensions, which can handle object rotation and scaling are also discussed. An alternate texture classifier is derived from a ML viewpoint, that is more efficient at the expense of complexity. The application of these algorithms to texture modeling is shown and consistent parameter estimators are obtained. Simulations are shown for both the object and the texture classification problems.

关键词： Image processing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共46页 << < 37 38 39 40 41 42 43 44 45 46 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：