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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

369 篇 会议
80 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

230 篇 工学
- 108 篇 信息与通信工程
- 78 篇 计算机科学与技术...
- 65 篇 软件工程
- 58 篇 电子科学与技术（可...
- 28 篇 电气工程
- 25 篇 机械工程
- 23 篇 控制科学与工程
- 22 篇 仪器科学与技术
- 16 篇 生物医学工程（可授...
- 15 篇 生物工程
- 14 篇 光学工程
- 14 篇 交通运输工程
- 9 篇 航空宇航科学与技...
- 6 篇 化学工程与技术
- 4 篇 动力工程及工程热...
- 4 篇 土木工程
- 3 篇 力学（可授工学、理...
105 篇 理学
- 60 篇 数学
- 32 篇 统计学（可授理学、...
- 27 篇 物理学
- 14 篇 生物学
- 14 篇 系统科学
- 7 篇 化学
- 3 篇 大气科学
- 3 篇 地球物理学
26 篇 管理学
- 13 篇 管理科学与工程(可...
- 13 篇 图书情报与档案管...
13 篇 医学
- 9 篇 基础医学(可授医学...
- 7 篇 临床医学
- 4 篇 公共卫生与预防医...
3 篇 法学
3 篇 农学
3 篇 军事学
1 篇 文学

主题

59 篇 signal processin...
47 篇 image processing
38 篇 mimo
22 篇 signal to noise ...
19 篇 decoding
18 篇 digital communic...
16 篇 fading
16 篇 robustness
14 篇 interference
14 篇 feature extracti...
12 篇 image segmentati...
12 篇 wireless communi...
12 篇 cognitive radio
12 篇 correlation
11 篇 transmitting ant...
11 篇 bit error rate
11 篇 image coding
10 篇 throughput
10 篇 cameras
10 篇 optimization

机构

18 篇 joint research i...
17 篇 school of inform...
13 篇 joint research i...
10 篇 institute for di...
9 篇 signal and image...
9 篇 institute of dig...
8 篇 center for signa...
7 篇 joint research i...
7 篇 college of infor...
7 篇 joint research i...
6 篇 joint research i...
6 篇 joint research i...
5 篇 institute for di...
5 篇 institute for di...
4 篇 department of ma...
4 篇 institute of dig...
4 篇 joint research i...
4 篇 medical image an...
4 篇 school of engine...
4 篇 institute for di...

作者

50 篇 harald haas
35 篇 cheng-xiang wang
22 篇 wang cheng-xiang
16 篇 john thompson
14 篇 john s. thompson
14 篇 david i. laurens...
13 篇 marco di renzo
13 篇 sinan sinanovic
11 篇 xiang cheng
10 篇 haas harald
10 篇 laurenson david ...
9 篇 norbert goertz
9 篇 cheng xiang
9 篇 yuan dongfeng
8 篇 gunther auer
8 篇 majdi mansouri
8 篇 dongfeng yuan
7 篇 mansour hajji
7 篇 xuemin hong
7 篇 xiaohu ge

语言

435 篇 英文
9 篇 中文
5 篇 其他
1 篇 阿拉伯文

检索条件"机构=Joint Research Institute in Signal and Image Processing"

共 449 条记录，以下是241-250 订阅

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

详细简洁

排序：

A Geometry-Based Stochastic Model for Wideband MIMO Mobile-to-Mobile Channels

A Geometry-Based Stochastic Model for Wideband MIMO Mobile-t...

引用

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

作者： Xiang Cheng Cheng-Xiang Wang David I. Laurenson Joint Research Institute of Signal and Image Processing Heriot-Watt University Edinburgh UK Joint Research Institute of Signal and Image Processing University of Edinburgh Edinburgh UK

In this paper, based on the tapped delay line (TDL) structure, we propose a geometry-based stochastic model (GBSM) for wideband multiple-input multiple-output (MIMO) mobile-to-mobile (M2M) Ricean fading channels. The proposed wideband model is the first GBSM that has the ability to study the impact of the vehicular traffic density (VTD) on channel statistics for different time delays, i.e., for every tap in our model. From the proposed model, the space-time (ST) correlation function (CF) and the corresponding space-Doppler (SD) power spectral density (PSD) are derived. Excellent agreement is achieved between the theoretical Doppler PSDs and measured data, demonstrating the utility of the proposed model.

关键词： Stochastic processes Solid modeling Wideband MIMO Statistics Fading Scattering Delay effects Bandwidth signal processing

来源：评论

学校读者我要写书评

暂无评论

Asymptotic trapping set analysis of regular Protograph-based LDPC convolutional code ensembles

Asymptotic trapping set analysis of regular Protograph-based...

引用

Information Theory and Applications Workshop, ITA 2009

作者： Mitchell, David G.M. Pusane, Ali E. Costello Jr., Daniel J. Institute for Digital Communications Joint Research Institute for Signal and Image Processing University of Edinburgh United Kingdom Dept. of Electrical Engineering University of Notre Dame Notre Dame IN United States

ISBN: (纸本)9781424439904

1 has been suggested that "near-codewords" may be a significant factor affecting decoding failures of LDPC codes over the AWGN channel. A near-codeword is a sequence that satisfies almost all of the check equations. These near-codewords can be associated with so-called 'trapping sets' that exist in the Tanner graph of a code. In this paper, we analyse the trapping sets of protograph-based LDPC convolutional codes. LDPC convolutional codes have been shown to be capable of achieving the same capacity-approaching performance as LDPC block codes with iterative message-passing decoding. Further, it has been shown that some ensembles of LDPC convolutional codes are asymptotically good, in the sense that the average free distance grows linearly with constraint length. Here, asymptotic methods are used to calculate a lower bound on the trapping set growth rates for several ensembles of regular asymptotically good protograph-based LDPC convolutional codes. This provides us with an estimate of where the error floor will occur for these codes under iterative message-passing decoding. © 2009 IEEE.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Practical compress-and-forward cooperation for the classical relay network

Practical compress-and-forward cooperation for the classical...

引用

17th European signal processing Conference, EUSIPCO 2009

作者： Jiang, Jing Thompson, John S. Grant, Peter M. Goertz, Norbert Institute for Digital Communication Joint Reasearch Institute for Signal and Image Processing School of Engineering Edinburgh United Kingdom Institute of Communications and Radio-Frequency Engineering Vienna University of Technology Vienna Austria

This paper proposes a practical compress-and-forward cooperation scheme with vector coding at the relay node for a three-terminal classical relay network. We discuss the framework of the relay receiver and analyse two practical vector coding algorithms for the cooperation, nearest neighbour quantization and lattice vector quantization. The error rate performance of the compress-and-forward cooperation and some other protocols under different SNRs is investigated. The impact of the quantization rate at the relay node is also characterised. It is shown that for a quantization rate larger than 2 bits/sample, the vector coding whether employing nearest neighbour quantization or lattice vector quantization, outerforms both the decode-and-forward protocol and scalar coding. © EURASIP, 2009.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

Parsimonious dictionary learning

Parsimonious dictionary learning

引用

International Conference on Acoustics, Speech, and signal processing (ICASSP)

作者： Mehrdad Yaghoobi Thomas Blumensath Michael E. Davies Institute of Digital Communications Joint Research Institute of Signal and Image Processing University of Edinburgh UK

Sparse modeling of signals has recently received a lot of attention. Often, a linear under-determined generative model for the signals of interest is proposed and a sparsity constraint imposed on the representation. When the generative model is not given, choosing an appropriate generative model is important, so that the given class of signals has approximate sparse representations. In this paper we introduce a new scheme for dictionary learning and impose an additional constraint to reduce the dictionary size. Small dictionaries are desired for coding applications and more likely to ldquoworkrdquo with suboptimal algorithms such as Basis Pursuit. Another benefit of small dictionaries is their faster implementation, e.g. a reduced number of multiplication/addition in each matrix vector multiplication, which is the bottleneck in sparse approximation algorithms.

关键词： Dictionaries Sparse matrices signal generators signal processing image coding Digital communication image processing Pursuit algorithms Approximation algorithms Costs

来源：评论

学校读者我要写书评

暂无评论

Compressible dictionary learning for fast sparse approximations

Compressible dictionary learning for fast sparse approximati...

引用

IEEE/SP Workshop on Statistical signal processing (SSP)

作者： Mehrdad Yaghoobi Mike E. Davies Institute of Digital Communications Joint Research Institute of Signal and Image Processing University of Edinburgh UK

By solving a linear inverse problem under a sparsity constraint, one can successfully recover the coefficients, if there exists such a sparse approximation for the proposed class of signals. In this framework the dictionary can be adapted to a given set of signals using dictionary learning methods. The learned dictionary often does not have useful structures for a fast implementation, i.e. fast matrix-vector multiplication. This prevents such a dictionary being used for the real applications or large scale problems. The structure can be induced on the dictionary throughout the learning progress. Examples of such structures are shift-invariance and being multi-scale. These dictionaries can be efficiently implemented using a filter bank. In this paper a well-known structure, called compressibility, is adapted to be used in the dictionary learning problem. As a result, the complexity of the implementation of a compressible dictionary can be reduced by wisely choosing a generative model. By some simulations, it has been shown that the learned dictionary provides sparser approximations, while it does not increase the computational complexity of the algorithms, with respect to the pre-designed fast structured dictionaries.

关键词： Dictionaries image coding signal processing Sparse matrices signal processing algorithms Digital communication image processing Inverse problems Learning systems Large-scale systems

来源：评论

学校读者我要写书评

暂无评论

A simple, efficient and near optimal algorithm for compressed sensing

A simple, efficient and near optimal algorithm for compresse...

引用

International Conference on Acoustics, Speech, and signal processing (ICASSP)

作者： T. Blumensath M. E. Davies IDCOM & Joint Research Institute of Signal and Image Processing University of Edinburgh Edinburgh UK

When sampling signals below the Nyquist rate, efficient and accurate reconstruction is nevertheless possible, whenever the sampling system is well behaved and the signal is well approximated by a sparse vector. This statement has been formalised in the recently developed theory of compressed sensing, which developed conditions on the sampling system and proved the performance of several efficient algorithms for signal reconstruction under these conditions. In this paper, we prove that a very simple and efficient algorithm, known as Iterative Hard Thresholding, has near optimal performance guarantees rivalling those derived for other state of the art approaches.

关键词： Compressed sensing Iterative algorithms signal processing Hilbert space image sampling signal sampling image processing image reconstruction Sampling methods signal reconstruction

来源：评论

学校读者我要写书评

暂无评论

On the performance of trellis coded spatial modulation

On the performance of trellis coded spatial modulation

引用

International ITG Workshop on Smart Antennas, WSA 2009

作者： Mesleh, Raed Stefan, Irina Haas, Harald Grant, Peter M. Research 1 Campus Ring 1 Jacobs University Bremen Bremen28759 Germany Joint Research Institute for Signal and Image Processing Institute for Digital Communications University of Edinburgh EdinburghEH9 3JL United Kingdom

Trellis coded modulation (TCM) is a well known scheme that applies mapping by set partitioning. The key idea is to group the constellation symbols into sets with each set having the maximum free distance between its symbols. In this paper, a similar approach is applied to antenna constellation points of spatial modulation (SM) in order to enhance its performance in correlated channel conditions. In SM, multiple antennas exist at the transmitter side, but only one of them is active at any particular time instant. The incoming data bits determine the active transmit antenna and the signal constellation point transmitted from it. At the receiver side, the active antenna index and the transmitted symbol are estimated and used together to decode the transmitted information bits. The locations of the transmit antennas are considered as spatial constellation points, and TCM is applied to enhance the bit error ratio (BER) performance of bits encoded into the physical location of an antenna within an antenna array. TCM partitions the entire set of transmit antennas into sub-sets such that the spacing between antennas within a particular sub-set is maximized. The performance of TCSM is analyzed in this paper and compared to the performance of SM and coded V-BLAST (vertical Bell Labs layered spacetime) applying optimum sphere decoder algorithm. It is shown that under the same spectral efficiency, TCSM performs nearly the same as SM and V-BLAST in idealistic channel conditions. However, a significant enhancement is reported in the presence of realistic channels performance such as Rician fading and spatial correlation (SC).

关键词： Modulation

来源：评论

学校读者我要写书评

暂无评论

Hidden Markov models for packet-level errors in bursty digital wireless channels

Hidden Markov models for packet-level errors in bursty digit...

引用

Antennas and Propagation Conference, LAPC, Loughborough

作者： Omar S. Salih Cheng-Xiang Wang David I. Laurenson Yejun He Joint Research Institute for Signal and Image Processing Heriot-Watt University Edinburgh UK Joint Research Institute for Signal and Image Processing University of Edinburgh Edinburgh UK College of Information Engineering Shenzhen University Shenzhen China

ISBN: (纸本)9781424427208

Packet-level generative models are designed to be employed for evaluating and designing high layer wireless communications protocols. The significance of these models arises from their ability to replace the entire physical communication layer, hence reducing the time and complexity of wireless system simulations. In this paper, an enhanced general packet radio service (EGPRS) transmission system is utilized to obtain reference bursty packet error sequences. We then propose a new hidden Markov model with two processes to generate packet error sequences of any desired length. The attained burst error statistics demonstrate a satisfactory performance compared to those of reference packet error sequences.

关键词： Hidden Markov models Antennas and propagation

来源：评论

学校读者我要写书评

暂无评论

Information Content Analysis and Clustering for signal Anomaly Detection

Information Content Analysis and Clustering for Signal Anoma...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Mostafa Afgani Harald Haas Institute of Digital Communications Joint Research Institute of Signal and Image Processing University of Edinburgh Edinburgh UK

An information theoretic approach to detecting unusual events in radio signals is presented. Anomalies are detected through a measure of the events' information content. Clustering is utilised to reduce false-positives while allowing a lower discrimination threshold to be used for improved anomaly detection. Experiments with a real wireless local area network test signal shows that it is possible to achieve 100% detection rates while maintaining very low false discovery rate of 1%.

关键词： Information analysis signal analysis signal detection Wireless LAN Interference Event detection signal processing Cognitive radio Bluetooth Wireless communication

来源：评论

学校读者我要写书评

暂无评论

Star-Node Identification in Self-Organising Wireless Networks

Star-Node Identification in Self-Organising Wireless Network...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Zubin Bharucha Sinan Sinanovic Harald Haas Institute of Digital Communications Joint Research Institute of Signal and Image Processing University of Edinburgh Edinburgh UK

ISBN: (纸本)9781424425143

Self-configuring, hierarchical, ad hoc, wireless networks are fast becoming the focus of research for spectral efficiency and energy efficiency reasons. Such networks can be considered as graphs where a node represents a transceiving unit and an edge represents a communication link between two nodes. In order to probabilistically analyse connectedness issues in such graphs, the concept of the star-node is introduced here, where a star-node is a node whose path loss to multiple nodes in its vicinity falls below a given threshold, i.e., it is capable of sustaining "healthy" communication links to multiple neighbours. Star-nodes are important in the context of ad hoc and sensor networks since nodes in a self-configuring network must be able to identify their neighbours, i.e., those nodes with which viable communication links can be established. The probability of finding such star-nodes is analytically derived for a uniform user distribution in a circular scenario. The theory is tested against Monte Carlo simulations and a very good match has been found.

关键词： Wireless networks Probability Digital communication signal processing image processing Focusing Energy efficiency Context Testing Boosting

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共45页 << < 21 22 23 24 25 26 27 28 29 30 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：