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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,590 篇 会议
923 篇 期刊文献
8 篇 学位论文
3 册 图书

馆藏范围

5,524 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,650 篇 工学
- 1,194 篇 电气工程
- 963 篇 计算机科学与技术...
- 512 篇 信息与通信工程
- 171 篇 软件工程
- 100 篇 电子科学与技术（可...
- 66 篇 控制科学与工程
- 41 篇 仪器科学与技术
- 17 篇 交通运输工程
- 10 篇 机械工程
- 8 篇 测绘科学与技术
- 6 篇 光学工程
- 5 篇 网络空间安全
- 4 篇 力学（可授工学、理...
- 4 篇 生物医学工程（可授...
- 3 篇 材料科学与工程（可...
- 3 篇 航空宇航科学与技...
- 2 篇 石油与天然气工程
345 篇 理学
- 256 篇 数学
- 57 篇 物理学
- 21 篇 系统科学
- 6 篇 统计学（可授理学、...
- 5 篇 生物学
- 4 篇 地球物理学
271 篇 文学
- 271 篇 新闻传播学
114 篇 医学
- 111 篇 临床医学
- 9 篇 特种医学
59 篇 管理学
- 55 篇 管理科学与工程(可...
- 4 篇 图书情报与档案管...
9 篇 军事学
- 9 篇 军队指挥学
2 篇 教育学
- 2 篇 教育学
1 篇 农学

主题

5,524 篇 source coding
1,261 篇 decoding
640 篇 codes
602 篇 channel coding
417 篇 rate-distortion
387 篇 entropy
340 篇 random variables
291 篇 image coding
271 篇 data compression
230 篇 software
229 篇 training
223 篇 computational mo...
212 篇 semantics
203 篇 video coding
197 篇 encoding
191 篇 quantization
185 篇 distortion
184 篇 redundancy
182 篇 information theo...
181 篇 parity check cod...

机构

28 篇 department of el...
25 篇 department of el...
24 篇 department of el...
20 篇 school of electr...
19 篇 technion israel ...
19 篇 stanford univ de...
18 篇 univ calif berke...
17 篇 school of electr...
15 篇 princeton univ d...
15 篇 univ calif san d...
15 篇 department of el...
15 篇 department of el...
15 篇 queens univ dept...
15 篇 univ michigan de...
14 篇 georgia inst tec...
13 篇 department of el...
13 篇 department of el...
12 篇 ibm thomas j. wa...
12 篇 university of ca...
12 篇 department of el...

作者

46 篇 zixiang xiong
31 篇 k. ramchandran
26 篇 yang yang
25 篇 mikael skoglund
24 篇 en-hui yang
24 篇 m. effros
23 篇 s. sandeep pradh...
20 篇 tsachy weissman
19 篇 chang wen chen
18 篇 k. rose
18 篇 jun chen
18 篇 michelle effros
17 篇 yasutada oohama
16 篇 skoglund mikael
15 篇 chao tian
14 篇 k. zeger
14 篇 b. girod
13 篇 s.s. pradhan
13 篇 xiaolin wu
13 篇 pradhan s. sande...

语言

5,471 篇 英文
44 篇 其他
8 篇 中文
1 篇 俄文

检索条件"主题词=Source coding"

共 5524 条记录，以下是381-390 订阅

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

详细简洁

排序：

Tradeoff between source coding and spreading in a multicarrier DS-CDMA system operating over multipath fading channels with narrow-band interference

Tradeoff between source coding and spreading in a multicarri...

引用

MILCOM, Military Communications Conference

作者： R. Annavajjala P.C. Cosman L.B. Milstein Department of Electrical and Computer Engineering University of California San Diego La Jolla CA USA

For a fixed total bandwidth expansion factor, and for a fixed channel code rate, we consider the problem of optimal bandwidth allocation between the source coder and the spread-spectrum unit for a multicarrier direct-sequence CDMA system operating over a frequency-selective fading channel with narrowband interference. Assuming a Gaussian source with the optimum scalar quantizer and a binary convolutional code with soft-decision decoding, we obtain both a lower and an upper bound on the end-to-end average source distortion. The optimal bandwidth allocation is then numerically computed by minimizing upper and lower bounds on the average distortion. We show that the upper bound based cost function is a convex function of the source code rate, and the optimal allocation depends on the system and the channel conditions, such as the total number of active users, the number of carriers, and the average jammer-to-signal power ratio.

关键词： source coding Multiaccess communication Narrowband Interference Channel allocation Upper bound Bandwidth Spread spectrum communication Frequency-selective fading channels Convolutional codes

来源：评论

学校读者我要写书评

暂无评论

On vector Gaussian multiterminal source coding

On vector Gaussian multiterminal source coding

引用

IEEE (first ITW conference of the year) Information Theory Workshop (ITW)

作者： Jia Wang Jun Chen Department of Electronic Engineering Shanghai Jiao Tong University Shanghai China Department of Electrical and Computer Engineering McMaster University Hamilton ON Canada

We derive a lower bound on each supporting hyperplane of the rate region of the vector Gaussian multiterminal source coding problem by coupling it with the CEO problem through a limiting argument. The tightness of thi... 详细信息

关键词： Vectors source coding Conferences Covariance matrix Couplings Limiting

来源：评论

学校读者我要写书评

暂无评论

Distributed source coding in dense sensor networks

Distributed source coding in dense sensor networks

引用

Data Compression Conference (DCC)

作者： A. Kashyap L.A. Lastras-Montano C. Xia Zhen Liu Department of ECE. UIUC Urbana-Champaign IL USA IBM Thomas J. Watson Research Center Yorktown Heights NY USA IBM Thomas J. Watson Research Center Hawthorne NY USA

We study the problem of the reconstruction of a Gaussian field defined in [0,1] using N sensors deployed at regular intervals. The goal is to quantify the total data rate required for the reconstruction of the field with a given mean square distortion. We consider a class of two-stage mechanisms which (a) send information to allow the reconstruction of the sensor's samples within sufficient accuracy, and then (b) use these reconstructions to estimate the entire field. To implement the first stage, the heavy correlation between the sensor samples suggests the use of distributed coding schemes to reduce the total rate. Our main contribution is to demonstrate the existence of a distributed block coding scheme that achieves, for a given fidelity criterion for the sensor's measurements, a total information rate that is within a constant, independent of N, of the minimum information rate required by an encoder that has access to all the sensor measurements simultaneously. The constant in general depends on the autocorrelation function of the field and the desired distortion criterion for the sensor samples.

关键词： source coding Intelligent networks Wireless sensor networks Mechanical sensors Sensor phenomena and characterization Distortion measurement Information rates Sensor systems Upper bound Sensor fusion

来源：评论

学校读者我要写书评

暂无评论

On the redundancy of lossy source coding

On the redundancy of lossy source coding

引用

IEEE International Symposium on Information Theory

作者： Zhen Zhang En-hui Yang V.K. Wei Commun Science Institute Department of EE systems University of Southern California Los Angeles CA USA Department of Math Nankai University Tianjin China Department Infor Engineering Chinese University of Hong Kong Hong Kong China

The redundancy of a source code is the difference between its expected performance and the optimum performance theoretically attainable (OPTA). In an analysis of the redundancy problem of source coding the aim is to investigate the trade-off between the minimum redundancy over a class of codes having a common parameter (such as block length) and the common parameter. We assume that the common parameter associated with the codes considered is block length. We refer to the minimum redundancy over the class of all codes having block length n and some specified type as the nth-order redundancy. In lossless source coding, the OPTA is the Shannon entropy and there exists extensive literature studying the nth-order redundancy. Before our work, nontrivial lower bounds are still unknown to either the n-th order rate redundancy or the n-th order distortion redundancy. The aim of this paper is to answer the question of whether Pilc's (1968) lower bound is true. We derive a closed formula for the nth-order distortion redundancy and prove the formula for the upper and lower bounds of the nth-order rate redundancy.

关键词： source coding Block codes Statistics Entropy Rate-distortion Rate distortion theory Production

来源：评论

学校读者我要写书评

暂无评论

Gaussian secure source coding and Wyner's Common Information

Gaussian secure source coding and Wyner's Common Information

引用

IEEE International Symposium on Information Theory

作者： Sanket Satpathy Paul Cuff Dept. of Electrical Engineering Princeton University Princeton USA

We study secure source-coding with causal disclosure, under the Gaussian distribution. The optimality of Gaussian auxiliary random variables is shown in various scenarios. We explicitly characterize the tradeoff between the rates of communication and secret key. This tradeoff is the result of a mutual information optimization under Markov constraints. As a corollary, we deduce a general formula for Wyner's Common Information in the Gaussian setting.

关键词： Random variables source coding Markov processes Gold Optimization Mutual information

来源：评论

学校读者我要写书评

暂无评论

Cascade source coding with side information at first two nodes

Cascade source coding with side information at first two nod...

引用

IEEE (first ITW conference of the year) Information Theory Workshop (ITW)

作者： Haim H. Permuter Tsachy Weissman Ben-Gurion University of the Negev Beersheba Israel University of Stanford Stanford CA USA

ISBN: (纸本)9781424463725

We consider the cascade rate-distortion problem where side information is known to the source encoder and to the first user but not to the second user. We characterize the rate-distortion region for this problem. For the quadratic Gaussian case we show that it is enough to consider jointly Gaussian distributions; a fact that leads to an explicit solution.

关键词： source coding Switches Rate-distortion Decoding Gaussian distribution Information analysis

来源：评论

学校读者我要写书评

暂无评论

Renyi to Renyi - source coding under Siege

Renyi to Renyi - Source Coding under Siege

引用

IEEE International Symposium on Information Theory

作者： Michael B. Baer Electronics for Imaging Foster CA USA

ISBN: (纸本)142440505X

A novel lossless source coding paradigm applies to problems of unreliable lossless channels with low bit rates, in which a vital message needs to be transmitted prior to termination of communications. This paradigm can be applied to Alfred Renyi's secondhand account of an ancient siege in which a spy was sent to scout the enemy but was captured. After escaping, the spy returned to his base in no condition to speak and unable to write. His commander asked him questions that he could answer by nodding or shaking his head, and the fortress was defended with this information. Renyi told this story with reference to prefix coding, but maximizing probability of survival in the siege scenario is distinct from yet related to the traditional source coding objective of minimizing expected codeword length. Rather than finding a code minimizing expected codeword length Xi n i=1 p(i)l(i), the siege problem involves maximizing Xi n i=1 p(i)thetas l(i) for a known thetas isin (0,1). When there are no restrictions on codewords, this problem can be solved using a known generalization of Huffman coding. The optimal solution has coding bounds which are functions of Renyi entropy; in addition to known bounds, new bounds are derived here. The alphabetically constrained version of this problem has applications in search trees and diagnostic testing. A novel dynamic programming algorithm - based upon the oldest known algorithm for the traditional alphabetic problem - optimizes this problem in O(n 3 ) time and O(n 2 ) space, whereas two novel approximation algorithms can find a suboptimal solution faster: one in linear time, the other in O(n log n). coding bounds for the alphabetic version of this problem are also presented

关键词： source coding Entropy Approximation algorithms Propagation losses Bit rate Huffman coding Dynamic programming Heuristic algorithms Cities and towns Head

来源：评论

学校读者我要写书评

暂无评论

Secure source coding with a public helper

Secure source coding with a public helper

引用

IEEE International Symposium on Information Theory

作者： Kittipong Kittichokechai Yeow-Khiang Chia Tobias J. Oechtering Mikael Skoglund Tsachy Weissman School of Electrical Engineering and the ACCESS Linnaeus Center KTH Royal Institute of Technology Sweden Modulation and Coding Dept. Institute for Infocomm Research Singapore Electrical Engineering Department Stanford University USA

ISBN: (纸本)9781479904440

We consider secure multi-terminal source coding problems in the presence of a public helper. Two main scenarios are studied: 1) source coding with a helper where the coded side information from the helper is eavesdropped by an external eavesdropper, 2) triangular source coding with a helper where the helper is considered as a public terminal. We are interested in how the helper can support the source transmission subject to a constraint on the amount of information leaked due to its public nature. We characterize the tradeoff between transmission rate, incurred distortion, and information leakage rate at the helper/eavesdropper in the form of a rate-distortion-leakage region for various classes of problems.

关键词： source coding Decoding Loss measurement Distortion measurement Markov processes Indexes

来源：评论

学校读者我要写书评

暂无评论

Design of trellis codes for source coding with side information at the decoder

Design of trellis codes for source coding with side informat...

引用

Data Compression Conference (DCC)

作者： Xin Wang M.T. Orchard Department of Electrical Engineering Princeton University Princeton NJ USA

ISBN: (纸本)0769510310

The problem of source coding with side information at the decoder arises in many practical scenarios. Although this problem has been well characterized in information theory, particularly by the work of Wyner and Ziv (1976), there is still lack of successful algorithms for it. In this paper, we use trellis codes to approach the theoretical limit. An embedded trellis code structure is proposed, and its properties are examined. Using this structure, we can achieve the granular gain at the encoder as well as the coding gain at the decoder. Simulation results show that the proposed scheme outperforms the algorithms reported in the literature. It is also indicated that the performance of the proposed algorithm can approach the information-theoretic limit at high rate as the trellis complexity increases.

关键词： Convolutional codes source coding Decoding Rate-distortion Distortion measurement Satellite broadcasting AWGN Signal to noise ratio Information theory Probability density function

来源：评论

学校读者我要写书评

暂无评论

Formalization of the variable-length source coding theorem: Direct part

Formalization of the variable-length source coding theorem: ...

引用

International Symposium on Information Theory and Its Applications, ISITA

作者： Ryosuke Obi Manabu Hagiwara Reynald Affeldt Course of Mathematics and Informatics Chiba University Research Institute for Secure Systems National Institute of Advanced Industrial Science and Technology

Modern mathematical proofs are becoming so big that they cause a problem of trust. Formal verification using proof-assistants has recently emerged as a solution to ensure the correctness of big proofs. Before being able to verify formally big proofs one must build substantial libraries of formal definitions and formal theorems. In this paper, we explain how we contribute to an existing formalization of information theory by extending it with a foundational theorem; namely, the variable-length source coding theorem.

关键词： source coding Educational institutions Libraries Computer science Concrete

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 35 36 37 38 39 40 41 42 43 44 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：