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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

233 篇 期刊文献
149 篇 会议
2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

374 篇 工学
- 298 篇 电气工程
- 177 篇 计算机科学与技术...
- 143 篇 信息与通信工程
- 21 篇 软件工程
- 17 篇 电子科学与技术（可...
- 13 篇 仪器科学与技术
- 10 篇 控制科学与工程
- 8 篇 机械工程
- 6 篇 交通运输工程
- 2 篇 测绘科学与技术
- 2 篇 生物医学工程（可授...
- 2 篇 网络空间安全
- 1 篇 力学（可授工学、理...
- 1 篇 光学工程
- 1 篇 石油与天然气工程
- 1 篇 环境科学与工程（可...
96 篇 理学
- 69 篇 数学
- 22 篇 物理学
- 5 篇 系统科学
- 3 篇 生物学
- 2 篇 化学
- 1 篇 地球物理学
44 篇 医学
- 44 篇 临床医学
- 4 篇 特种医学
5 篇 军事学
- 5 篇 军队指挥学
5 篇 管理学
- 4 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...
1 篇 文学
- 1 篇 新闻传播学

主题

384 篇 distributed sour...
47 篇 slepian-wolf cod...
26 篇 wyner-ziv coding
26 篇 wireless sensor ...
21 篇 source coding
20 篇 channel coding
20 篇 sensor networks
19 篇 side information
18 篇 ldpc codes
15 篇 network coding
14 篇 wireless sensor ...
13 篇 slepian-wolf the...
12 篇 ldpc
11 篇 distributed arit...
10 篇 arithmetic codin...
10 篇 compression
10 篇 entropy
9 篇 video coding
9 篇 decoding
9 篇 ceo problem

机构

11 篇 univ calif berke...
10 篇 univ strathclyde...
9 篇 texas a&m univ d...
9 篇 univ michigan de...
8 篇 univ waterloo de...
8 篇 stanford univ in...
8 篇 univ oklahoma sc...
6 篇 city univ hong k...
6 篇 cornell univ sch...
5 篇 iowa state univ ...
5 篇 boston univ dept...
5 篇 univ rochester d...
4 篇 princeton univ d...
4 篇 univ calif santa...
4 篇 northwest a&f un...
4 篇 univ southampton...
4 篇 texas a&m univ d...
4 篇 mcmaster univ de...
3 篇 technion israel ...
3 篇 natl univ def te...

作者

12 篇 cheng samuel
11 篇 stankovic vladim...
10 篇 girod bernd
10 篇 fang yong
9 篇 varodayan david
7 篇 simeone osvaldo
7 篇 cheung gene
7 篇 pradhan s. sande...
7 篇 lin yao-chung
6 篇 zhou junwei
6 篇 yang en-hui
6 篇 ramamoorthy adit...
6 篇 stankovic lina
6 篇 chen jun
5 篇 magli enrico
5 篇 cheung ngai-man
5 篇 ishwar prakash
5 篇 lahouti farshad
5 篇 wang shuang
5 篇 labeau fabrice

语言

370 篇 英文
9 篇 其他
5 篇 中文

检索条件"主题词=Distributed source coding"

共 384 条记录，以下是331-340 订阅

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

详细简洁

排序：

ADAPTIVE RATE CONTROL FORWYNER-ZIV VIDEO coding

ADAPTIVE RATE CONTROL FORWYNER-ZIV VIDEO CODING

引用

IEEE Visual Communications and Image Processing (VCIP)

作者： Esmaili, Ghazaleh Cosman, Pamela Univ Calif San Diego La Jolla CA 92093 USA

ISBN: (纸本)9781467344050;9781467344067

In Wyner-Ziv video coding architectures, the available bit budget to each GOP is shared between key frames and Wyner-Ziv frames. In this work, we first propose a model to express the relationship between quantization step size of key and WZ frames based on their motion activity. Then we apply this model to propose an adaptive algorithm adjusting the quantization step size of key and WZ frames to achieve and maintain a target bit rate. We evaluate the rate distortion performance of the proposed method and compare to a common method in the literature.

关键词： Wyner-Ziv video coding distributed source coding rate control

来源：评论

学校读者我要写书评

暂无评论

A Characterization of the Error Exponent for the Byzantine CEO Problem

A Characterization of the Error Exponent for the Byzantine C...

引用

46th Annual Allerton Conference on Communication, Control and Computing

作者： Kosut, Oliver Tong, Lang Cornell Univ Ithaca NY 14853 USA

ISBN: (纸本)9781424429257

The discrete CEO Problem is considered when the agents are under Byzantine attack. That is, a malicious intruder has captured an unknown subset of the agents and reprogrammed them to increase the probability of error. Two traitor models are considered, depending on whether the traitors are able to see honest agents' messages before choosing their own. If they can, bounds are given on the error exponent with respect to the sum-rate as a function of the fraction of agents that are traitors. The number of traitors is assumed to be known to the CEO, but not their identity. If they are not able to see the honest agents' messages, an exact but uncomputable characterization of the error exponent is given. It is shown that for a given sum-rate, the minimum achievable probability of error is within a factor of two of a quantity based on the traitors simulating a false distribution to generate messages they send to the CEO. This false distribution is chosen by the traitors to increase the probability of error as much as possible without revealing their identities to the CEO. Because this quantity is always within a constant factor of the probability of error, it gives the error exponent directly.

关键词： distributed source coding Byzantine Attack Sensor Fusion Network Security

来源：评论

学校读者我要写书评

暂无评论

A Backhaul Scheme for Uplink Cooperation among Base Stations

A Backhaul Scheme for Uplink Cooperation among Base Stations

引用

IEEE Globecom Workshops (GC Wkshps)

作者： Teng, Zi Cao, Wenwen Wu, Jun Tongji Univ Dept Comp Sci & Technol Shanghai 200092 Peoples R China

ISBN: (纸本)9781467349413;9781467349420

In this paper we design a backhaul scheme for uplink cooperation, which is based on distributed source coding (DSC). With this backhaul scheme, base stations cooperatively serve the cell edge users in order to improve their performance. In cooperative uplink, both cooperating BS and serving BS receive signal from cell edge users, the cooperating BS decodes cell edge users firstly, and sends the syndrome coded re-modulated signal to serving cell, the serving BS uses directly received signal as side information and combines syndrome coded signal to decode interference user jointly, then cancels the interference user signal. Our simulation shows that direct decoding without interference cancellation does not work when SINR drop to a certain threshold, at this time, interference cancellation with DSC can improve performance significantly, and the distributed source coding scheme reduces the backhaul overhead dramatically.

关键词： co-channel interference distributed source coding backhaul network serving base station cooperation base station

来源：评论

学校读者我要写书评

暂无评论

distributed Fronthaul Compression Design for Rateless Coded Multi-User Uplink Transmission in C-RAN

Distributed Fronthaul Compression Design for Rateless Coded ...

引用

Information Communication Technologies Conference (ICTC)

作者： Zhang, Yu Fan, Zhehao Meng, Limin Lu, Weidang Zhejiang Univ Technol Coll Informat Engn Hangzhou Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing Peoples R China

ISBN: (纸本)9781728167763

In this paper, we consider the multi-user uplink transmission in cloud radio access network (C-RAN), which consists of two users, two radio remote heads (RRHs), and the baseband processing unit (BBU) pool. The users adopt Raptor code and send the modulated signals to both RRHs continuously until receiving the acknowledge character (ACK) feedback from the BBU. A novel fronthaul compression scheme for RRH is proposed. Explicitly, both RRHs quantize the received signal to meet the fronthaul capacity constraint. One of the RRHs further compresses the quantized signal with low density parity check (LDPC) code. Then not only the resulted syndrome bits, additional quantization bits are also sent to the BBU according to the remaining fronthaul capacity, which can reduce the quantization noise at the BBU. We optimize the LDPC code based on extrinsic information transfer (EXIT) analysis. Simulation results show that optimized LDPC code has good compression performance compared with regular LDPC code, and the proposed fronthaul compression scheme outperforms the conventional scheme without DSC.

关键词： C-RAN distributed source coding degree profile optimization LDPC code

来源：评论

学校读者我要写书评

暂无评论

distributed Variable-Rate Quantized Compressed Sensing in Wireless Sensor Networks 17

Distributed Variable-Rate Quantized Compressed Sensing in Wi...

引用

17th IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

作者： Leinonen, Markus Codreanu, Marian Juntti, Markku Univ Oulu Ctr Wireless Commun POB 4500 Oulu 90014 Finland

ISBN: (纸本)9781509017492

This paper addresses distributed finite-rate quantized compressed sensing (QCS) acquisition of correlated sparse sources in wireless sensor networks. We propose a distributed variable-rate QCS compression method with complexity constrained encoding to minimize a weighted sum of the mean square error distortion of the signal reconstruction and the average encoding rate. The variable-rate coding is realized via entropy-constrained vector quantization, whereas the restrained encoding complexity is obtained via vector pre-quantization of CS measurements. We derive necessary optimality conditions for the system blocks for two-sensor case. Numerical results show that our proposed method efficiently exploits the signal correlation, and achieves superior distortion-rate compression performance.

关键词： Terms Compressed sensing distributed source coding sparse signals vector quantization entropy coding

来源：评论

学校读者我要写书评

暂无评论

The case for structured random codes in network communication theorems

The case for structured random codes in network communicatio...

引用

IEEE Information Theory Workshop

作者： Nazer, Bobak Gastpar, Michael Univ Calif Berkeley Dept EECS Berkeley Wireless Fdn Res Ctr Berkeley CA 94720 USA

ISBN: (纸本)9781424415632

In the Shannon-theoretic analysis of joint source-channel coding problems, achievability is usually established via a two-stage approach: The sources are compressed into bits' and these bits are reliably communicated across the noisy channels. Random coding arguments are the backbone of both stages of the proof. This strategy not only establishes the optimal performance for stationary ergodic point-to-point problems, but also for a number of simple network situations, such as independent sources that are communicated with respect to separate fidelity criteria across a multiple-access channel. Beyond such simple cases, for general networks, unstructured random coding arguments are not sufficient. This was first realized for source coding by Korner and Marton, who showed that for a distributed source coding problem where one only needs to recover a function of the sources random linear codes are necessary. The goal of this note is to extend this insight to pure channel coding as well as to joint source-channel coding problems, such as the problem of reliable computation over a multiple-access channel and a multi-access network with relays.

关键词： Drill bits multiple access distributed source coding random codes random coding Multiple Access Channel Network communication Combined source-channel coding Access Channels source coding Channel coding optimum performance relay

来源：评论

学校读者我要写书评

暂无评论

Joint source Channel Network coding Using QC LDPC codes 3

Joint Source Channel Network Coding Using QC LDPC codes

引用

3rd International Conference on Communications and Signal Processing (ICCSP)

作者： Jesy, P. Deepthi, P. P. Natl Inst Technol Calicut 673601 Kerala India

ISBN: (纸本)9781479933587

Motivated to develop a scheme that compresses, gives high throughput and adds robustness against channel noise, a new joint source channel network coding (JSCNC) using Quasi Cyclic Low Density Parity Check (QCLDPC) code is proposed for a sensor network with two source nodes communicating correlated information to multiple destination nodes. The source coding is performed by transmitting only half of the information bits of QCLDPC code and transmitting the parity bits as such, since the parity bits are usually uncorrelated compared to the corresponding information bits. The correlations in sensor network data are used effectively at the relay node to reconstruct the original information bits transmitted by the source nodes. Relay scheme used in our proposed work is a decode and forward relaying in which masking of information bits are done before network coding at the relay. This helps in low-error decoding at the destination.

关键词： distributed source coding joint network channel coding joint source channel coding network coding wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

The Byzantine CEO Problem

The Byzantine CEO Problem

引用

IEEE International Symposium on Information Theory

作者： Kosut, Oliver Tong, Lang Cornell Univ Sch Elect & Comp Engn Ithaca NY 14853 USA

ISBN: (纸本)9781424422562

The CEO Problem is considered when a subset of the agents are under Byzantine attack;that is, they have been taken over and reprogrammed by a malicious intruder. Inner and outer bounds are given for the error exponent with respect to the sum rate, as a function of the fraction of reprogrammed, or traitor, agents. The inner bound is proved by introducing a coding scheme that takes advantage of the fact that the set of honest (non-traitor) agents will report jointly typical information. The CEO looks for a group with the same size as the set of honest agents that appear to do so. Even if not all the agents in this group are honest, the fact that they all agree keeps the probability of error in check. The outer bound is given in two parts, based on two different possible attacks by the traitors. The first is a black hole attack, in which the traitors simply transmit no information at all. The second is one in which they fabricate false data such that the CEO cannot determine which of two possibilities is the truth.

关键词： Byzantine attack distributed source coding Network security Sensor fusion

来源：评论

学校读者我要写书评

暂无评论

Systematic Polar Codes for Joint source-Channel coding in Wireless Sensor Networks and the Internet of Things

Systematic Polar Codes for Joint Source-Channel Coding in Wi...

引用

14th International Conference on Mobile Systems and Pervasive Computing (MobiSPC) / 12th International Conference on Future Networks and Communications (FNC)

作者： Yaacoub, Charles Sarkis, Malak Holy Spirit Univ Kalsik USEK Dept Telecommun Fac Engn POB 446 Jounieh Lebanon NH USA

The Internet of Things (IoT) is becoming an increasingly growing topic of interest in the research community. Its requirements meet those of the next generation 5G mobile communication system which is expected to be an enabling technology for IoT, where networks of large numbers of sensors require massive connectivity demands. As polar codes have strongly entered into action within the standardization of 5G, this paper proposes and investigates the use of systematic polar codes for joint-source channel coding of correlated sources thus allowing, on one hand, the compression of the volume of data to be transmitted over the network, and on the other hand, the protection of this data from channel impairments. Results show that systematic polar codes can achieve a distributed compression with rates close to the theoretical bound, with better error rates obtained for larger blocks. However, stronger compression and shorter block lengths allow for a better robustness against transmission errors. (C) 2017 The Authors. Published by Elsevier B.V.

关键词： channel coding compression distributed source coding entropy internet of things systematic polar codes wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Hamming coding for Multiple sources

Hamming Coding for Multiple Sources

引用

2010 IEEE International Symposium on Information Theory

作者： Ma, Rick Cheng, Samuel Hong Kong Univ Sci & Technol Dept Math Hong Kong Hong Kong Peoples R China Okayama Univ Sch Elect & Comp Engn Tulsa OK 74135 USA

ISBN: (纸本)9781424469604

We introduce Hamming Codes for Multiple sources (HCMSs) as a potential solution of perfect Slepian-Wolf (SW) coding for arbitrary number of terminals. Moreover, we study the case with three sources in detail. We present the necessary conditions of a perfect SW code and show that there exists infinite number of HCMSs. Moreover, we show that for perfect SW code with sufficiently long code length, the compression rates of different sources can be trade-off flexibly.

关键词： Slepian-Wolf coding distributed source coding perfect code Hamming code

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共39页 << < 30 31 32 33 34 35 36 37 38 39 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：