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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

107 篇 期刊文献
69 篇 会议
2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

171 篇 工学
- 142 篇 电气工程
- 84 篇 信息与通信工程
- 64 篇 计算机科学与技术...
- 22 篇 电子科学与技术（可...
- 8 篇 交通运输工程
- 6 篇 机械工程
- 4 篇 仪器科学与技术
- 3 篇 软件工程
- 2 篇 控制科学与工程
- 1 篇 生物医学工程（可授...
27 篇 理学
- 23 篇 数学
- 4 篇 物理学
- 1 篇 生物学
4 篇 医学
- 4 篇 临床医学
- 1 篇 特种医学
2 篇 文学
- 1 篇 外国语言文学
- 1 篇 新闻传播学
2 篇 管理学
- 2 篇 管理科学与工程(可...
1 篇 法学
- 1 篇 社会学
1 篇 教育学
- 1 篇 教育学

主题

178 篇 decoding complex...
32 篇 decoding
13 篇 complexity theor...
12 篇 iterative decodi...
10 篇 error correction...
10 篇 diversity
10 篇 convolutional co...
9 篇 computational co...
8 篇 encoding complex...
8 篇 polar codes
8 篇 parity check cod...
8 篇 error exponent
7 篇 codes
7 篇 channel coding
6 篇 concatenated cod...
6 篇 turbo codes
6 篇 block codes
6 篇 ldpc codes
6 篇 maximum likeliho...
6 篇 mimo

机构

8 篇 indian inst sci ...
4 篇 nanyang technol ...
3 篇 nanjing univ sch...
2 篇 singapore univ t...
2 篇 univ southern ca...
2 篇 univ new s wales...
2 篇 guangdong univ t...
2 篇 singapore univ t...
2 篇 beijing inst tec...
2 篇 univ witwatersra...
2 篇 sun yat sen univ...
2 篇 russian acad sci...
2 篇 univ turku dept ...
2 篇 univ ulm dept te...
2 篇 technion israel ...
2 篇 osaka gakuin uni...
2 篇 ozyegin univ dep...
2 篇 department of el...
2 篇 koc univ dept el...
2 篇 lucent technol b...

作者

5 篇 guan yong liang
5 篇 pimentel cecilio
5 篇 rajan b. sundar
5 篇 souza richard de...
4 篇 jiang hua
4 篇 uchoa-filho bart...
3 篇 kuo c. -c. jay
3 篇 lee szu-wei
3 篇 mceliece rj
3 篇 aslam chaudhry a...
3 篇 hisojo miguel an...
3 篇 chen li
3 篇 benchimol isaac
3 篇 du sidan
3 篇 hari k. v. s.
3 篇 cai kui
3 篇 zyablov v
3 篇 deneire luc
3 篇 cheun kyungwhoon
3 篇 rajashekar raksh...

语言

171 篇 英文
4 篇 其他
2 篇 中文
1 篇 土耳其文

检索条件"主题词=decoding complexity"

共 178 条记录，以下是141-150 订阅

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

详细简洁

排序：

Iterative chase-2 algorithm using threshold for block turbo codes decoding design

Iterative chase-2 algorithm using threshold for block turbo ...

引用

IEEE International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications

作者： Tang, YS Lee, M Chonbuk Natl Univ Dept Informat & Commun Engn Inst Informat & Comm Chonju 561756 South Korea

ISBN: (纸本)0780391284

In this paper, we introduce an approach to get better performance of block turbo codes (BTCs). We use threshold to limit the search for the maximum-likelihood codeword. Consequently, by using chase-2 algorithm, Euclidean distance will be calculated from smaller group of candidate codeword, and we can calculate reliability and extrinsic information easier and faster. So a faster iterative decoding process is achieved to take these extra threshold calculations into chase-2 algorithm for BTCs. We evaluate the performance of this decoding process on additive white Gaussian noise (AWGN) channel. And decoding complexity reduces a lot over the standard iterative decoding methods. We also add this idea into the hardware design of BTCs decoder. It also shows good reduction for number of operations.

关键词： threshold chase-2 algorithm block turbo codes (BTCs) iterative decoding decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Low-complexity blind maximum-likelihood detection for SIMO systems with general constellations

Low-complexity blind maximum-likelihood detection for SIMO s...

引用

33rd IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Xu, Weiyu Stojnic, Mihailo Hassibi, Babak CALTECH Dept Elect Engn Pasadena CA 91125 USA

ISBN: (纸本)9781424414833

The demand for high data rate reliable communications poses great challenges to the next generation wireless systems in highly dynamic mobile environments. In this paper, we investigate the joint maximum-likelihood (ML) channel estimation and signal detection problem for single-input multiple-output (SIMO) wireless systems with general modulation constellations and propose an efficient sequential decoder for finding the exact joint ML solution. Unlike other known methods, the new decoder can even efficiently find the joint NIL solution under high spectral efficiency non-constant-modulus modulation constellations. In particular, the new algorithm does not need such preprocessing steps as Cholesky or QR decomposition in the traditional sphere decoders for joint ML channel estimation and data detection. The elimination of such preprocessing not only reduces the number of floating point computations, but also will potentially lead to smaller size and power consumption in VLSI implementations while providing better numerical stability.

关键词： blind ML detection decoding complexity SIMO maximum-likelihood sphere decoder

来源：评论

学校读者我要写书评

暂无评论

A Novel Full Density QSTBC Scheme With Low complexity

A Novel Full Density QSTBC Scheme With Low Complexity

引用

6th International Congress on Image and Signal Processing (CISP)

作者： Han Chong Zhang Xiaomin Chen Yu Northwestern Polytech Univ Coll Marine Xian 710072 Peoples R China Zhejiang Univ Coll City Hangzhou Zhejiang Peoples R China

ISBN: (纸本)9781479927630

In this paper, a new design criterion for quasi-orthogonal space time block codes is proposed for four transmit anntenas and four receivers MIMO communication system when it experiences the Rayleigh fading channel. Based on the design criterion, an improved design of QOSTBC(Quasi Orthogonal Space Time Block Code) for coherent channal interference is proposed that avoids repeated transmission of symbols by mapping symbols into another symbol domain which can maximize the euclidean distance between the symbols. Based on the optimal design of symbol structure, the proposed codes have lower decode complexity which performs close to the linear decoder. In the algorithm performance and BER analysis that the results are validated by Monte Carlo simulations. It is shown that the improved algorithm compared with other tranditional methods has higher coding/ diversity gain and lower complexity.

关键词： MIMO QOSTBC Optimal structure decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Digital Fountain Codes with Reduced Latency, complexity and Buffer Requirements for Wireless Communications 79

Digital Fountain Codes with Reduced Latency, Complexity and ...

引用

IEEE 79th Vehicular Technology Conference (VTC-Spring)

作者： Razavi, Rouzbeh Claussen, Holger Alcatel Lucent Bell Labs Dublin 15 Ireland

ISBN: (纸本)9781479944828

Digital Fountain Codes (DCFs) are proven to be very beneficial in providing reliable, yet flexible solutions in data communications over erasure wireless channels. Their randomness can additionally provide a strong protection against security and privacy risks. However, existing solutions based on DCFs suffer from increased packets, latency, increased decoding complexity, and require very large buffers both at the transmitter and receiver sides. This paper presents a practical solution to overcome most of these issues by exploiting the feedback path. Simulation results suggest significant up to 77% improvement in latency and up to 94% reduction in buffer requirements compared to the existing solutions.

关键词： Digital Fountain Codes Erasure Channels Latency Buffer requirements decoding complexity Security and Privacy

来源：评论

学校读者我要写书评

暂无评论

A Channel Coding Approach for Physical-Layer Authentication 8

A Channel Coding Approach for Physical-Layer Authentication

引用

8th International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Wu, Xiaofu Ling, Cong Nanjing Univ Posts & Telecommun Nanjing 210003 Jiangsu Peoples R China Imperial Coll London England

ISBN: (纸本)9781509028603

For physical-layer authentication, the authentication tags are often sent concurrently with messages without much bandwidth expansion. In this paper, we present a channel coding approach for physical-layer authentication. The generation of authentication tags can be formulated as an encoding process for an ensemble of codes, where the shared key between Alice and Bob is considered as the input and the message is used to specify a code from the ensemble of codes. Then, we show that the security of physical-layer authentication schemes can be analyzed through decoding and physical-layer authentication schemes can achieve some degree of information-theoretic security.

关键词： Physical-layer authentication channel coding decoding complexity computational security information theoretic security

来源：评论

学校读者我要写书评

暂无评论

Reliable Data Transmission Using IBRC and LT Codes over AWGN Channels

Reliable Data Transmission Using IBRC and LT Codes over AWGN...

引用

Globecom Workshops

作者： Lv, Sida Zhao, Zhifeng Zhang, Honggang Zhejiang Univ York Zhejiang Lab Cognit Radio & Green Commun Dept Informat Sci & Elect Engn Hangzhou 310027 Peoples R China

ISBN: (纸本)9781424488650

LT codes promise reliable transmissions of data over erasure channels. They also work satisfactorily over interference channels after cyclic redundancy check (CRC) is introduced into the transmission system. In this paper, we will propose a set of codes named improved binary repetition codes (IBRCs) derived from block repetition codes using cyclic shifts. With comparatively lower complexity, IBRCs serve as an inner channel codes concatenated after LT pre-coding to maintain the reliability of LT codes over interference channels without using additional CRC bits. We want to show that IBRC is capable of replacing the conventional schemes involving CRC at larger SNRs with the same performance but much lower complexity, while at lower SNRs, if we take the tradeoff between performance and complexity into consideration, IBRC challenges the conventional CRC schemes. We will give numerical results to demonstrate that the proposed solution is an effective scheme worth evaluating and bringing into practice.

关键词： Transmission reliability LT codes error detection error correction decoding complexity

来源：评论

学校读者我要写书评

暂无评论

BP-based Approximation Methods For Rateless Codes 24

BP-based Approximation Methods For Rateless Codes

引用

24th Signal Processing and Communication Application Conference (SIU)

作者： Albayrak, Cenk Turk, Kadir Karadeniz Tech Univ Elekt Elekt Muhendisligi Bolumu Trabzon Turkey

ISBN: (纸本)9781509016792

In this letter, belief propagation (BP) based approximation methods for low density parity check (LDPC) codes are adapted to the Luby transform (LT) soft decoder structure in order to reduce its computational complexity. The bit error rate (BER) performances of the algorithms over the binary input additive white Gaussian noise (BIAWGN) channel are obtained by both theoretically and simulations. For theoretical analysis, the Monte-Carlo density evolution (MC-DE) method is used. In addition, computational complexity analyzes of methods are presented. Results show that the computational complexity can be significantly decreased with a limited performance loss cost.

关键词： Rateless codes BP-based approximations decoding complexity

来源：评论

学校读者我要写书评

暂无评论

An evaluation of erasure decoding algorithms for Gabidulin codes

An evaluation of erasure decoding algorithms for Gabidulin c...

引用

International Telecommunications Symposium (ITS)

作者： Venturelli, Ricardo Bohaczuk Silva, Danilo Univ Fed Santa Catarina Dept Elect Engn BR-88040900 Florianopolis SC Brazil

ISBN: (纸本)9781479937431

Gabidulin codes are linear block codes over an extension field that can be seen as the analogs of Reed-Solomon codes for the rank metric. Important applications of Gabidulin codes include the areas of network coding and distributed storage, particularly for the problem of rank erasure correction. This paper studies the complexity of erasure decoding algorithms for Gabidulin codes with short-to-moderate (not asymptotically long) block lengths. The two fastest known algorithms are compared in detail (in terms of exact number of operations) and it is shown for which parameter values one algorithm is superior to the other.

关键词： Gabidulin codes Linearized polynomials Network coding Normal bases decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Joint Signal Alignment and Power Allocation for a Diagonalized AF MIMO Two-Way Relay Channel

Joint Signal Alignment and Power Allocation for a Diagonaliz...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Park, Heesun Chun, Joohwan Adve, Raviraj Korea Adv Inst Sci & Technol Dept Elect Engn Taejon 305701 South Korea Univ Toronto Dept Elect & Comp Engn Toronto ON Canada

ISBN: (纸本)9781424492688

This paper uses generalized singular value decomposition (GSVD) to reduce decoding complexity in an amplify-and-forward, multiple-input multiple-output, two-way relay channel (TWRC). The key is diagonalization of the effective channels at the source nodes;this formulation also simplifies the optimization problem of designing linear transceivers at each node to maximize the achievable sum rate (ASR). For the given diagonalized structure, we first align the entries of the diagonalized channels using a permutation followed by power allocation, provided in closed form. Simulation results demonstrate that the proposed GSVD-based relaying scheme, with the signal alignment and power allocation, significantly improves the ASR while retaining the diagonalized channel structure.

关键词： complexity theory decoding MIMO MIMO communication Peer to peer computing Relays Resource management Signal to noise ratio achievable sum rate amplify and forward amplify and forward communication decoding decoding complexity diagonalized AF MIMO two-way relay channel diagonalized channel structure generalized singular value decomposition joint signal alignment linear transceiver multiple-input multiple-output channel optimization problem permutation power allocation singular value decomposition source node wireless channels

来源：评论

学校读者我要写书评

暂无评论

Forward Error Correction with RaptorQ Code on Embedded Systems

Forward Error Correction with RaptorQ Code on Embedded Syste...

引用

54th IEEE International Midwest Symposium on Circuits and Systems (MWSCAS)

作者： Mladenov, T. Kim, K. Nooshabadi, S. Gwangju Inst Sci & Technol Dept Informat & Commun Kwangju 500712 South Korea Michigan Technol Univ Dept Elect & Comp Engn Houghton MI 49931 USA

ISBN: (纸本)9781612848570

Raptor code, a member of the rateless fountain codes family, has been a preferred technology for the forward error correction (FEC) at the application layer. It is used by the 3(rd) Generation Partnership Program (3GPP) Multimedia Broadcast/Multicast Service (MBMS) and Digital Video Broadcasting (DVB-H) standards for multimedia broadcast and content delivery. Currently, a next generation fountain code, called RaptorQ, is being proposed. It aims at reducing to a minimum the redundant FEC information, outperforming significantly Raptor code. The improved coding performance comes at the expense of increased encoding and decoding complexity. This paper compares the coding properties, the decoding performance and the energy efficiency of the two codes on embedded system. Furthermore, simulations are performed for a practical MBMS scenario. Finally, conclusions are drawn with respect to the applicability of the new code for realtime multimedia broadcasting and content delivery.

关键词： 3G mobile communication 3GPP 3rd Generation Partnership Program DVB-H decoding Hardware Radiation detectors Radio access networks RaptorQ code communication complexity content delivery decoding decoding complexity digital video broadcasting digital video broadcasting standard embedded system embedded systems encoding complexity energy efficiency error correction codes forward error correction forward error correction multicast communication multimedia broadcast/multicast service multimedia communication rateless fountain codes family

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共18页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：