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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是241-250 订阅

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

详细简洁

排序：

source coding with side information using list decoding

Source coding with side information using list decoding

引用

IEEE International Symposium on Information Theory

作者： Mortuza Ali Margreta Kuijper Department Electrical and Electronic Engineering University of Melbourne VIC Australia

Existing literature on source coding with side information (SCSI) uses channel codes like LDPC codes and turbo codes and assumes classical unique decoding. In this paper, in contrast to classical decoding, we have taken the list decoding approach and show that the theoretical limit of SCSI can then be achieved. We argue that, as opposed to channel coding, the correct sequence from the list produced by the list decoder can effectively be recovered in case of SCSI with a few CRC bits. The CRC bits, which allow the decoder to identify the correct sequence, incur negligible overhead for large block length. More importantly, these CRC bits are not subject to noise since we are dealing with a virtual noisy channel rather than a real noisy channel. Finally, we present a guideline for designing constructive SCSI schemes using Reed Solomon code, BCH code, and Reed-Muller code, which are the known list-decodable codes.

关键词： source coding Decoding Turbo codes Cyclic redundancy check Entropy Australia Parity check codes Channel coding Guidelines Reed-Solomon codes

来源：评论

学校读者我要写书评

暂无评论

source coding in the presence of exploration-exploitation tradeoff

Source coding in the presence of exploration-exploitation tr...

引用

IEEE International Symposium on Information Theory

作者： Emrah Akyol Urbashi Mitra Ertem Tuncel Kenneth Rose University of Southern California Los Angeles CA US Dep. of Electrical Eng. USC CA US Dep. of Electrical Eng. UC Riverside CA US Dep. of Electrical-Computer Eng. UCSB CA US

Exploration versus exploitation in a sensor field with a mobile agent is examined in the context of source coding. The encoder is the low complexity data gathering agent. The decoder is a high complexity fusion center. The encoder first sends a coarse description of the random field, then transmits a refined description of a region of interest, i.e., a subset of the correlated sources in the first stage and so on. The main source coding challenge is that the receiver wants to refine a subset of the correlated sources that is unknown to the encoder a priori. The conventional approach of scalable coding via conditional codebook encoding (CCE) requires a codebook that is exponential in size with respect to the number of sources and also the number of refinement stages. This paper studies an alternative approach, using random binning (RB), in lieu of CCE. The universality of RB plays a key role, as the encoder does not know a priori which sources the decoder wants to refine. It is shown that RB does not introduce any loss and can effectively replace CCE while providing significant storage reduction in terms of the number of codewords stored. Achievable rate regions are derived for the single and the multi-terminal encoding settings.

关键词： Decoding Distortion measurement Markov processes source coding Receivers

来源：评论

学校读者我要写书评

暂无评论

source coding and transmission of signals over time-varying channels with side information

Source coding and transmission of signals over time-varying ...

引用

IEEE International Symposium on Information Theory

作者： M. Khansari M. Vetterli Department of EECs University of California Berkeley CA USA

We look at the problem of transmitting information over time-varying channels with side information, where for time-varying channels the statistics of the channel change with time and by channel side information we mean the current state of the channel. We show that when this side information is available at both the transmitter and the receiver, then for the power-constrained channel, the power allocation policy that achieves minimum end-to-end distortion is not necessarily the same as the one required for maximum transmission rate.

关键词： source coding Time-varying channels Transmitters Channel capacity Statistics Fading Signal to noise ratio Interference Interleaved codes AWGN channels

来源：评论

学校读者我要写书评

暂无评论

source coding Rate Allocation in Orthogonal Compress-and-Forward Relay Networks

Source Coding Rate Allocation in Orthogonal Compress-and-For...

引用

IEEE International Conference on Communications (ICC)

作者： G. Zeitler J. Brehmer G. Bauch J. Widmer Institute of Communications Engineering Technische Universität München Germany Associate Institute of Signal Processing Technische Universität München Germany DOCOMO Euro-Laboratories Universität der Bundeswehr Munich Germany DoCoMo Conimunications Laboratories Europe GmbH Germany

The source coding rate allocation problem for the orthogonal multiple-access relay channel with M users and compress-and-forward at the relay is addressed. In case of Gaussian codebooks at the sources and Gaussian channels, we show that the sum-rate-optimal assignment of source coding rate at the relay is given by waterfilling. For general modulation alphabets at the sources and finite-alphabet discrete memoryless channels, the source coding rate allocation problem is formulated using the information bottleneck method, based on which we appropriately modify a standard cutting-plane algorithm to numerically compute an optimal source coding rate vector at the relay.

关键词： source coding Relays Frequency Modulation coding Gaussian channels Memoryless systems Decoding Communications Society Signal Processing Society Laboratories

来源：评论

学校读者我要写书评

暂无评论

source coding and transmission under common knowledge constraints

Source coding and transmission under common knowledge constr...

引用

Information Theory and Applications Workshop, ITA

作者： Yossef Steinberg Department of Electrical Engineering Technion-Israel Institute of Technology Haifa Israel

This work studies problems of source coding under the requirement that the encoder can produce an exact copy of the compressed source constructed by the decoder. This requirement, termed here as a common knowledge constraint, is satisfied automatically in rate-distortion theory for single sources. However, in the common formulation of problems of lossy source coding with side information at the decoder (the Wyner-Ziv problem), distributed source coding, and joint source-channel coding for networks, the destination can exploit the information it receives in a manner that cannot be exactly reproduced at the sender side. Some applications, like the transmission of sensitive medical information, may require that both sides - the sender and the receiver - will share a common version of the compressed data, for the purpose of future discussions or consulting. The purpose of this work is to study the implications of common knowledge constraints on the achievable rates in scenarios of lossy source coding. A single letter characterization of the rate distortion function is developed, for the problem of source coding with side information at the decoder, under a common knowledge constraint. Implications of this constraint on problems of joint source channel coding for the degraded broadcast channel are studied. Specifically, it is shown that in this setup, a scheme based on separation achieves optimal distortions.

关键词： Rate-distortion Decoding source coding Distortion measurement Encoding Joints Random variables

来源：评论

学校读者我要写书评

暂无评论

source coding for dependent sources

Source coding for dependent sources

引用

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

作者： M. Langberg M. Effros The Open University of Israel California Institute of Technology

In this work, we address the capacity region of multi-source multi-terminal network communication problems, and study the change in capacity when one moves form independent to dependent source information. Specifically, we ask whether the trade off between capacity and source independence is of continuous nature. We tie the question at hand to that of edge removal which has seen recent interest.

关键词： Random variables Xenon Network coding Vectors Conferences source coding

来源：评论

学校读者我要写书评

暂无评论

source coding for general penalties

Source coding for general penalties

引用

IEEE International Symposium on Information Theory

作者： M. Baer Information Systems Laboratory University of Stanford Stanford CA USA

来源：评论

学校读者我要写书评

暂无评论

source coding with feed-forward

Source coding with feed-forward

引用

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

作者： R. Venkataramanan S.S. Pradhan Dept. of EECS Univ. of Michigan Ann Arbor Michigan Department of EECS University of Michigan Ann Arbor MI USA

In this work, we consider a source coding model with feedforward. We analyze a system with a noiseless feedforward link where the decoder has knowledge of all previous source samples while reconstructing the present sample. The rate-distortion function for an arbitrary source with feedforward is derived in terms of directed information, a variant of mutual information. The special cases of discrete memoryless sources and Gaussian sources with feedforward are further examined. We also derive a random coding error exponent which is used to bound the probability of decoding error for a source code (with feedforward) of finite block length. The results are then extended to feedforward with an arbitrary delay larger than the block length.

关键词： source coding Feedforward systems Decoding Rate-distortion Acoustic noise Signal processing Delay estimation Electronic mail Mutual information Delay effects

来源：评论

学校读者我要写书评

暂无评论

source coding with side information at the decoder revisited

Source coding with side information at the decoder revisited

引用

IEEE International Symposium on Information Theory

作者： Tomohiko Uyematsu Tetsunao Matsuta Dept. of Communications and Computer Engineering Tokyo Institute of Technology Tokyo Japan

ISBN: (纸本)9781467377058

A source coding system with side information at the decoder is a typical multiterminal source coding system where output sequences of two sources are independently encoded, but a decoder recovers only one output sequence from two codewords. Since Wyner, Ahlswede and Körner independently investigated this system, we call it as the WAK coding system. This paper investigates the ε-achievable rate region of the WAK coding system which allows the probability of error within a fixed tolerance ε(∈ (0, 1)), and clarifies the ε-achievable rate region for correlated general sources in terms of the smooth max-entropy and the smooth max Rényi divergence. To this end, we show a new one-shot converse theorem for the WAK coding system, and a one-shot covering lemma which is a refined version of Warsi's result. Then, combining these results, we clarify the ε-achievable rate region of the WAK coding system.

关键词： Zinc Decoding Random variables Manganese source coding Probability distribution

来源：评论

学校读者我要写书评

暂无评论

source coding with composite side information at the decoder

Source coding with composite side information at the decoder

引用

IEEE Convention of the Electrical and ELectronic Engineers in Israel

作者： Anatoly Khina Uri Erez Department of EE-Systems Tel Aviv University Israel

We consider a source-coding scenario in which composite side information is available at the decoder, viz. part of it is known non-causally, whereas the other part is available only causally - by this combining the treatment of Wyner and Ziv with that of Weissman and El Gamal. We then consider the joint source-channel coding problem of transmitting a source with composite side information at the decoder over a channel with composite side information at the encoder. We show that the separation principle between source coding with composite side information and its dual channel problem holds, thus extending the result of Merhav and Shamai to the case of composite side informations. These results provide a unified framework for treating the causal side information case, the non-causal stateinformation case, as well as a mixture of the two.

关键词： Decoding source coding Channel coding Entropy Upper bound Indexes

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：