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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Reducing complexity with Less than Minimum Delay Space-Time Lattice Codes

Reducing Complexity with Less than Minimum Delay Space-Time ...

引用

IEEE Information Theory Workshop (ITW)

作者： Vehkalahti, Roope Hollanti, Camilla Univ Turku Dept Math FI-20014 Turku Finland

ISBN: (纸本)9781457704376

Recently, several papers have been concentrating on reducing the decoding complexity of high-rate space-time codes. While the research has led to some impressive reductions in decoding complexity, the geometric methods so far used appear to have faced some fundamental limits. In this paper, we study what happens if we let go of the assumption of full diversity and study the possibility of reducing the complexity, while holding on to a high code rate, by reducing the length of codes. We will develop some tools that can be used to measure the changes we will encounter when reducing the code length. We will also study the achievable diversity-multiplexing gain trade-off (DMT) of codes with less than minimum delay (LMD) and discuss some code constructions.

关键词： complexity theory decoding Delay Encoding Lattices Receiving antennas Signal to noise ratio code length reduction decoding decoding complexity diversity-multiplexing gain trade-off minimum delay space-time codes space-time lattice codes

来源：评论

学校读者我要写书评

暂无评论

Minimal Trellis for Systematic Recursive Convolutional Encoders

Minimal Trellis for Systematic Recursive Convolutional Encod...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Pimentel, Cecilio Souza, Richard Demo Uchoa-Filho, Bartolomeu F. Benchimol, Isaac Univ Fed Pernambuco DES CODEC Recife PE Brazil UTFPR CPGEI Curitiba Parana Brazil Univ Fed Santa Catarina GPqCom EEL CTC Florianopolis SC Brazil IFAM CMDI Manaus Amazonas Brazil

ISBN: (纸本)9781457705953

We consider high-rate systematic recursive convolutional encoders to be adopted as constituent encoders in turbo schemes. It has been shown by Douillard and Berrou that the construction of high-rate turbo codes by means of high-rate constituent encoders offers several advantages over the typical construction based on the puncturing of rate-1/2 constituent encoders. To reduce the decoding complexity associated with high-rate codes, we adopt the "minimal" trellis representation of convolutional codes introduced by McEliece and Lin. While in the literature this trellis has been obtained for nonrecursive nonsystematic generator matrices, we herein introduce the construction of the "minimal" trellis for a systematic recursive convolutional encoding matrix. We also derive expressions for the arithmetic decoding complexity when the max-log-MAP algorithm is applied over the conventional and the "minimal" trellises. Examples are provided, which show that significant savings in decoding complexity are obtained, while keeping the same error performance of conventional schemes, when the minimal trellis is used. Finally, a code search is conducted and examples are provided which indicate that a refinement in terms of decoding complexity-error performance trade-off is obtained.

关键词： complexity theory Convolutional codes decoding Matrix decomposition Systematics Turbo codes arithmetic decoding complexity communication complexity complexity-error performance convolutional codes decoding decoding complexity high-rate turbo code matrix algebra max-log-MAP algorithm maximum likelihood estimation minimal trellis nonrecursive nonsystematic generator matrix recursive estimation systematic recursive convolutional encoder trellis codes turbo codes

来源：评论

学校读者我要写书评

暂无评论

On LP decoding of Polar Codes

On LP Decoding of Polar Codes

引用

IEEE Information Theory Workshop (ITW)

作者： Goela, Naveen Korada, Satish Babu Gastpar, Michael Univ Calif Berkeley Dept EECS Wireless Fdn Ctr Berkeley CA 94720 USA Stanford Univ Dept Elect Engn Stanford CA USA Delft Univ Technol Delft Netherlands

ISBN: (纸本)9781424482641

Polar codes are the first codes to provably achieve capacity on the symmetric binary-input discrete memoryless channel (B-DMC) with low encoding and decoding complexity. The parity check matrix of polar codes is high-density and we show that linear program (LP) decoding fails on the fundamental polytope of the parity check matrix. The recursive structure of the code permits a sparse factor graph representation. We define a new polytope based on the fundamental polytope of the sparse graph representation. This new polytope P is defined in a space of dimension O(N logN) where N is the block length. We prove that the projection of P in the original space is tighter than the fundamental polytope based on the parity check matrix. The LP decoder over P obtains the ML-certificate property. In the case of the binary erasure channel (BEC), the new LP decoder is equivalent to the belief propagation (BP) decoder operating on the sparse factor graph representation, and hence achieves capacity. Simulation results of SC (successive cancelation) decoding, LP decoding over tightened polytopes, and (ML) maximum likelihood decoding are provided. For channels other than the BEC, we discuss why LP decoding over P with a linear objective function is insufficient.

关键词： belief propagation decoder binary codes binary erasure channel computational complexity decoding complexity encoding complexity graph theory linear program decoding linear programming maximum likelihood decoding maximum likelihood decoding parity check codes parity check matrix polar codes sparse factor graph representation successive cancellation decoding symmetric binary-input discrete memoryless channel

来源：评论

学校读者我要写书评

暂无评论

Improving LT decoding for Real-Time Applications 79

Improving LT Decoding for Real-Time Applications

引用

IEEE 79th Vehicular Technology Conference (VTC-Spring)

作者： Razavi, Rouzbeh Alcatel Lucent Bell Labs Solna Sweden

ISBN: (纸本)9781479944828

Luby Transform (LT) codes are shown to perform very well over erasure wireless channels. However, LT codes require the number of input symbols to be sufficiently high or otherwise the coding overhead becomes significant. With large number of input symbols, the packets latency and decoding complexity as well as buffer requirement may increase. Given that Gaussian elimination is computationally intensive, this paper proposes to additionally consider higher order encoded symbols during the decoding procedure. The results show up to 47% overhead reduction when degree-2 symbols are as well contributing in the decoding procedure. The proposed method is very straightforward and requires no change to the encoder and minimal modification of the decoder.

关键词： Digital Fountain Codes LT decoding Erasure Channels Latency Buffer requirements decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Simplified Successive-Cancellation List decoding of Non-Binary Polar Codes with Rate-1 Node

Simplified Successive-Cancellation List Decoding of Non-Bina...

引用

IEEE Wireless Communications and Networking Conference (IEEE WCNC)

作者： Feng, Baoping Liu, Rongke Sun, He Beihang Univ Sch Elect & Informat Engn Beijing Peoples R China

ISBN: (纸本)9781728131061

In this paper, one of the constituent codes, Rate-1 node, is used to simplify Successive-Cancellation List (SCL) decoding of non-binary polar codes for reducing the decoding complexity. First, we derive the Logarithmic Likelihood Ratio based (LLR-based) path metric of non-binary polar codes in SCL decoding. Then we propose that the path metric only depends on the LLR value at the top of Rate-1 node tree, which avoids traversing a complete decoding tree in non-binary SCL decoding. Finally, we design a novel reliability metric, which is used to select the unreliable symbols from the LLRs at the top of Rate-1 node tree. By the proposed metric, we select the unreliable symbols to generate the candidate paths, which avoids splitting paths for all symbols of Rate-1 node in the conventional SCL decoding. Simulation results show that the proposed non-binary SCL decoding reduces significantly the computation and time complexity without the performance loss.

关键词： Non-binary polar codes SCL decoding reliability metric Rate-1 node decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Motion compensation complexity model for decoder-friendly H.264 system design

Motion compensation complexity model for decoder-friendly H....

引用

9th IEEE Workshop on Multimedia Signal Processing

作者： Lee, Szu-Wei Kuo, C. -C. Jay Univ So Calif Ming Hsieh Dept Elect Engn Los Angeles CA 90089 USA Univ Southern Calif Signal & Image Proc Inst Los Angeles CA 90089 USA

ISBN: (纸本)9781424412730

An improved motion compensation decoding complexity model is proposed and its application to H.264/AVC decoding complexity reduction is examined in this work. This complexity model considers a rich set of inter prediction modes of H.264 as well as the relationship between motion vectors and frame sizes, which turn out to be highly related to the cache management efficiency. An H.264 encoder equipped with the complexity model can estimate the decoding complexity and choose the best inter prediction mode to meet the decoding complexity constraint of the target receiver platform. The performance of the proposed complexity model and its application to video decoding complexity reduction are demonstrated experimentally.

关键词： H.264/AVC motion compensation decoding complexity rate-distortion optimization (RDO)

来源：评论

学校读者我要写书评

暂无评论

A Two Phase Successive Cancellation Decoder Architecture for Polar Codes

A Two Phase Successive Cancellation Decoder Architecture for...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Pamuk, Alptekin Arikan, Erdal Bilkent Univ Dept Elect & Elect Engn TR-06800 Ankara Turkey

ISBN: (纸本)9781479904464

We propose a two-phase successive cancellation (TPSC) decoder architecture for polar codes that exploits the array-code property of polar codes by breaking the decoding of a length-N polar code into a series of length-root N decoding cycles. Each decoding cycle consists of two phases: a first phase for decoding along the columns and a second phase for decoding along the rows of the code array. The reduced decoder size makes it more affordable to implement the core decoder logic using distributed memory elements consisting of flip-flops (FFs), as opposed to slower random access memory (RAM), leading to a speed up in clock frequency. To minimize the circuit complexity, a single decoder unit is used in both phases with minor modifications. The re-use of the same decoder module makes it necessary to recall certain internal decoder state variables between decoding cycles. Instead of storing the decoder state variables in RAM, the decoder discards them and calculates them again when needed. Overall, the decoder has O(root N) circuit complexity excluding RAM, and a latency of approximately 2.5N. A RAM of size O(N) is needed for storing the channel log-likelihood variables and the decoder decision variables. As an example of the proposed method, a length N = 2(14) bit polar code is implemented in an FPGA and the synthesis results are compared with a previously reported FPGA implementation. The results show that the proposed architecture has lower complexity, lower memory utilization with higher throughput, and a clock frequency that is less sensitive to code length.

关键词： Error correcting codes polar codes successive cancellation decoding decoding complexity

来源：评论

学校读者我要写书评

暂无评论

The Optimized Scheme for FPGA-based LDPC codes using Particle Swarm Optimization 10

The Optimized Scheme for FPGA-based LDPC codes using Particl...

引用

10th International Conference on Information and Communication Technology Convergence (ICTC) - ICT Convergence Leading the Autonomous Future

作者： Noh, Dong-Hee Jeong, Sung-Hwan Choi, JuHwan KETI Software Convergence Cluster Jeonju South Korea

ISBN: (纸本)9781728108933

This paper proposes the enhanced BP decoding scheme of Low-density parity-check (LDPC) codes scheme using Particle Swarm Optimization (PSO) algorithm. New approaches to this paper describe the BP decoding scheme using PSO algorithm. Its scheme can optimize the degree distribution pairs of check and variable node over rician channel. Therefore, proposed scheme can improve the throughput performance for wireless sensor networks over the industrial environment such as military or agriculture application.

关键词： LDPC BP decoding decoding complexity PSO algorithm Wireless Sensor Network

来源：评论

学校读者我要写书评

暂无评论

New Quasi-Orthogonal Differential Detection for Differential Space-Time Modulation

New Quasi-Orthogonal Differential Detection for Differential...

引用

International Conference on Information Networking (ICOIN)

作者： Kim, Hojun Jung, Taejin Chonnam Natl Univ Elect Comp Engn Kwangju South Korea

ISBN: (纸本)9781479936892

In this paper, we propose a new complex pair-wise differential detection for quasi-orthogonal differential space-time modulation (QO-DSTM) using four transmit antennas. Since the new detection allows independent joint ML detection of two complex symbol pairs, the decoding complexity is the same as or lower than conventional differential detection. Furthermore, the new detection exhibits better performance than the conventional complex pair-wise detection despite identical decoding complexity. Although the error performance of new detection is lower than that of improved differential detection (IDD), the loss is acceptable considering the decoding complexity.

关键词： Differential space-time modulation differential detection decoding complexity quasi-orthogonal design

来源：评论

学校读者我要写书评

暂无评论

Modulation Diversity for Spatial Modulation Using Complex Interleaved Orthogonal Design

Modulation Diversity for Spatial Modulation Using Complex In...

引用

IEEE Region 10 Conference (TENCON) - Sustainable Development through Humanitarian Technology

作者： Rajashekar, Rakshith Hari, K. V. S. Indian Inst Sci Dept Elect Commun Engn Bangalore 560012 Karnataka India

ISBN: (纸本)9781467348232;9781467348225

In this paper, we propose modulation diversity techniques for Spatial Modulation (SM) system using Complex Interleaved Orthogonal Design (CIOD). Specifically, we show that the standard SM scheme can achieve a transmit diversity order of two by using the CIOD meant for two transmit antenna system without incurring any additional system complexity or bandwidth requirement. Furthermore, we propose a low-complexity maximum likelihood detector for our CIOD based SM schemes by exploiting the structure of the CIOD. We show with our simulation results that the proposed schemes offer transmit diversity order of two and give a better symbol error rate performance than the conventional SM scheme.

关键词： Spatial modulation space-time block code complex interleaved orthogonal design diversity decoding complexity

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：