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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

130 篇 会议
126 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

231 篇 工学
- 127 篇 电气工程
- 104 篇 计算机科学与技术...
- 63 篇 信息与通信工程
- 34 篇 电子科学与技术（可...
- 19 篇 控制科学与工程
- 8 篇 软件工程
- 7 篇 仪器科学与技术
- 5 篇 机械工程
- 5 篇 生物医学工程（可授...
- 3 篇 光学工程
- 3 篇 材料科学与工程（可...
- 2 篇 生物工程
- 1 篇 地质资源与地质工...
- 1 篇 交通运输工程
- 1 篇 环境科学与工程（可...
- 1 篇 城乡规划学
58 篇 理学
- 46 篇 数学
- 5 篇 物理学
- 3 篇 生物学
- 2 篇 系统科学
- 1 篇 化学
- 1 篇 地理学
- 1 篇 地球物理学
18 篇 管理学
- 18 篇 管理科学与工程(可...
6 篇 文学
- 5 篇 新闻传播学
- 1 篇 外国语言文学
4 篇 医学
- 3 篇 基础医学(可授医学...
- 2 篇 临床医学
3 篇 军事学
- 3 篇 军队指挥学
1 篇 教育学
- 1 篇 教育学
1 篇 农学

主题

260 篇 decoding algorit...
73 篇 decoding
40 篇 codes
20 篇 decoders
16 篇 reed-solomon cod...
15 篇 low density pari...
13 篇 algorithms
11 篇 belief propagati...
11 篇 channel coding
10 篇 ldpc
10 篇 complexity class...
9 篇 parity check cod...
9 篇 block codes
9 篇 ldpc codes
9 篇 encoding
8 篇 polar code
8 篇 error correction...
8 篇 iterative decodi...
8 篇 linear codes
7 篇 computational co...

机构

3 篇 huawei technol c...
3 篇 xidian univ stat...
2 篇 inria
2 篇 mcgill univ dept...
2 篇 chinese acad sci...
2 篇 aalborg univ dep...
2 篇 xian univ posts ...
2 篇 univ jaume 1 dep...
2 篇 ras inst syst an...
2 篇 ecole technol su...
2 篇 san diego state ...
2 篇 natl taiwan univ...
2 篇 lehigh univ dept...
2 篇 i shou univ dept...
2 篇 univ connecticut...
2 篇 natl taiwan univ...
2 篇 yantai univ inst...
2 篇 xian univ posts ...
2 篇 univ elect sci &...
1 篇 michigan state u...

作者

3 篇 tang nianqi
3 篇 ruano diego
3 篇 hernando fernand...
3 篇 chung kl
3 篇 babu j. chinna
2 篇 yan zhiyuan
2 篇 fawzi omar
2 篇 lin yk
2 篇 chao hao
2 篇 lin tsung-ching
2 篇 lv yansong
2 篇 han yunghsiang s...
2 篇 yang zhanlei
2 篇 grospellier anto...
2 篇 jung hyunwoo
2 篇 jia xue
2 篇 leverrier anthon...
2 篇 xiong chenrong
2 篇 stevens p
2 篇 lee cy

语言

239 篇 英文
13 篇 其他
7 篇 中文

检索条件"主题词=Decoding algorithm"

共 260 条记录，以下是181-190 订阅

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

详细简洁

排序：

On a Construction of Universal Network Code using LDPC Matrices

On a Construction of Universal Network Code using LDPC Matri...

引用

IEEE International Symposium on Information Theory

作者： Miyake, Shigeki Muramatsu, Jun Nippon Telegraph & Tel Corp Network Innovat Labs 1-1 Hikarinooka Yokosuka Kanagawa Japan

ISBN: (纸本)9781467325790

An LDPC matrix is used as a local encoding kernel at each link to construct a universal code to address network coding problems. It is also shown that at each terminal node the global encoding kernel that constructs a decoder becomes an LDPC matrix. This provides the perspective that decoding complexity can be reduced to a linear order of a block length by using an efficient decoding algorithm such as the sum-product algorithm.

关键词： universal coding Sum-product algorithm decoding algorithm decoders Perspective end node Codes

来源：评论

学校读者我要写书评

暂无评论

Representation of solutions in genetic VLSI placement algorithms 12

Representation of solutions in genetic VLSI placement algori...

引用

Proceedings of IEEE East West Design and Test Symposium ( EWDTS 2014)

作者： Zaporozhets, D. U. Zaruba, D. V. Kureichik, V. V. Southern Fed Univ Coll Automat & Comp Sci Rostov Na Donu Russia

ISBN: (纸本)9781479976300

The VLSI placement problem is presented in this article. A mechanism of representation of solutions for further genetic algorithm implementation is described. The proposed encoding algorithm is based on a placement tree and reverse Polish notation. The decoding algorithm is implemented in two stages: twinning of elements in macroblocks and calculation of real coordinates of elements. Experimental results show time-response characteristics of the proposed coding and decoding mechanisms. The time complexity of the encoding algorithm is represented by O(n) whereas the time complexity of the decoding algorithm is represented by O(n log n), where n is the number of elements.

关键词： VLSI computational complexity genetic algorithms integrated circuit design trees (mathematics) VLSI placement problem decoding algorithm encoding algorithm genetic algorithm implementation placement tree reverse Polish notation time complexity time-response characteristics algorithm design and analysis Biological cells decoding Educational institutions Encoding Genetic algorithms Very large scale integration Very large scale integration complexity classes Genetic algorithm (GA) decoding algorithm algorithm design and analysis cytology integrated circuit design Educational institutions decoding RESPONSE CHARACTERISTICS

来源：评论

学校读者我要写书评

暂无评论

Special property of Multiple-Trellis-Coded-Modulation utilized for its decoding

Special property of Multiple-Trellis-Coded-Modulation utiliz...

引用

The 4th International Conference on Wireless Communications, Networking and Mobile Computing(第四届IEEE无线通信、网络技术及移动计算国际会议)

作者： Cheng Yang Weixia Zou Zheng Zhou Yabin Ye Key Lab of Universal Wireless Communications Ministry of Education China Wireless Network Lab Bei Create-Net Italy Italy

Channel coding always plays an important role in communication systems. decoding complexity is one factor which needs to be considered in its implementation. In this paper the decoding algorithm for MTCM is studied. Viterbi decoding algorithm for MTCM contains much more computations per trellis state transition. A most applicable decoding scheme for MTCM is proposed, which can achieve reduced computational complexity. The BER performance can approach that of the maximum likelihood decoding algorithm quickly by increasing the value of one parameter of MTCM.

关键词： MTCM decoding algorithm BER performance decoding complezity

来源：评论

学校读者我要写书评

暂无评论

Hardware architecture design of CABAC codec for H.264/AVC

Hardware architecture design of CABAC codec for H.264/AVC

引用

International Symposium on VLSI Design, Automation and Test

作者： Li, Lingfeng Song, Yang Ikenaga, Takeshi Goto, Satoshi Waseda Univ Grad Sch Informat Prod & Syst Tokyo Japan

ISBN: (纸本)9781424405824

This paper presents a hardware architecture for Context-Based Adaptive Binary Arithmetic Coding (CABAC) codec in H.264/AVC main profile. The similarities between encoding algorithm and decoding algorithm are explored to fulfill hardware reuse. Meanwhile, dynamic pipeline scheme is adopted to speedup the throughput. The characteristics of CABAC algorithm are utilized to reduce pipeline latency. Proposed codec design is implemented under TSMC 0. IS [uri technology. Results show that the equivalent gate counts is 33.2k when the maximum frequency is 230MHz. It is estimated that the proposed CABAC codec can process the input binary symbol at 135Mb/s for encoding and 90Mb/s for decoding.

关键词： CABAC codecs hardware architecture Building design maximum frequency decoding algorithm coding decoding

来源：评论

学校读者我要写书评

暂无评论

Reduced Complexity Belief Propagation Decoders for Polar Codes

Reduced Complexity Belief Propagation Decoders for Polar Cod...

引用

IEEE International Workshop on Signal Processing Systems (SiPS)

作者： Lin, Jun Xiong, Chenrong Yan, Zhiyuan Lehigh Univ Dept Elect & Comp Engn Bethlehem PA 18015 USA

ISBN: (纸本)9781467396042

Polar codes are newly discovered capacity-achieving codes, which have attracted lots of research efforts. Polar codes can be efficiently decoded by the low-complexity successive cancelation (SC) algorithm and the SC list (SCL) decoding algorithm. The belief propagation (BP) decoding algorithm not only is an alternative to the SC and SCL decoders, but also provides soft outputs that are necessary for joint detection and decoding. Both the BP decoder and the soft cancelation (SCAN) decoder were proposed for polar codes to output soft information about the coded bits. In this paper, first a belief propagation decoding algorithm, called reduced complexity soft cancelation (RCSC) decoding algorithm, is proposed. Let N denote the block length. Our RCSC decoding algorithm needs to store only 5N - 3 log-likelihood ratios (LLRs), significantly less than 4N 2 N 2 + and N(log(2) N +1) LLRs needed by the BP and SCAN decoders, respectively, when N 64. Besides, compared to the SCAN decoding algorithm, our RCSC decoding algorithm eliminates unnecessary additions over the real field. Then the simplified SC (SSC) principle is applied to our RCSC decoding algorithm, and the resulting SSC-aided RCSC (S-RCSC) decoding algorithm further reduces the computational complexity. Finally, based on the S-RCSC decoding algorithm, we propose a corresponding memory efficient decoder architecture, which has better error performance than existing architectures. Besides, our decoder architecture consumes less energy on updating LLRs.

关键词： Polar code decoding algorithm decoders Belief propagation error performance Scandium

来源：评论

学校读者我要写书评

暂无评论

LEARNING HOW LONG TO WAIT : ADAPTIVELY-CONSTRAINED MONOTONIC MULTIHEAD ATTENTION FOR STREAMING ASR

LEARNING HOW LONG TO WAIT : ADAPTIVELY-CONSTRAINED MONOTONIC...

引用

IEEE Automatic Speech Recognition and Understanding Workshop (ASRU)

作者： Song, Jaeyun Shim, Hajin Yang, Eunho Korea Adv Inst Sci & Technol Daejeon South Korea AITRICS Seoul South Korea

ISBN: (纸本)9781665437394

Monotonic Multihead Attention, which allows multiple heads to learn their own alignments per head, shows great performance on simultaneous machine translation and streaming speech recognition. However, it causes high latency waiting for the slowest head. Some recent advances such as Head-Synchronous Beam Search decoding and its learnable version Mutually-Constrained Monotonic Multihead Attention, try to address this issue by restricting the difference in times of chosen frames among multi-heads to a fixed waiting time threshold. In this paper, we hypothesis that the optimal threshold for high performance with low latency depends on the input sequence, and propose an adaptive algorithm that learns how long to wait depending on input tokens by introducing a threshold prediction module. We evaluate our approach on two benchmark datasets for online Automatic Speech Recognition task and demonstrate that our method reduces the latency together with even improving the recognition accuracy.

关键词： online speech recognition Transformer decoding algorithm Monotonic Multihead Attention Head-Synchronous Beam Search decoding

来源：评论

学校读者我要写书评

暂无评论

Extended LT decoder based on Extra ripples 25

Extended LT decoder based on Extra ripples

引用

25th Iranian Conference on Electrical Engineering (ICEE)

作者： Ebrahimzadeh, F. Attari, M. Ahmadian Tavakoli, H. KN Toosi Univ Technol Dept Elect Engn Tehran Iran Univ Guilan Dept Engn Rasht Iran

ISBN: (纸本)9781509059638

The ripple that was introduced to the decoder of LT codes plays a key role in the decoding process. Even Luby's degree distributions are defined so that this ripple maintains a reasonable size. For low block length which have many application in wireless, LT codes doesn't work properly so in this paper to extend the decodability of the LT codes for low block lengths, extra ripples are introduced to the decoder. Retaining the LT decoder's simplicity, it is possible to regenerate the main ripple and extend the decoding by means of these extra ripples. As the simulation and analytical results based on recursion of probability distributions show, lower error probabilities can be achieved. For the new decoder even the operational complexity is not increased that much due to the structure of LT codes. Even lower complexities in term of XOR operations can be achieved as the complexity of LT codes is mainly related to the number of edges in the decoding graph.

关键词： decoding algorithm Fountain Codes LT Codes Probability of decoding Failure Ripple

来源：评论

学校读者我要写书评

暂无评论

Left-to-Right Tree-to-String decoding with Prediction 12

Left-to-Right Tree-to-String Decoding with Prediction

引用

Conference on Empirical Methods in Natural Language Processing

作者： Yang Feng Yang Liu Qun Liu Trevor Cohn Department of Computer Science The University of Sheffield Sheffield UK State Key Laboratory on Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology Department of Computer Sci. and Tech. Tsinghua University Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781622765034

decoding algorithms for syntax based machine translation suffer from high computational complexity, a consequence of intersecting a language model with a context free grammar. Left-to-right decoding, which generates the target string in order, can improve decoding efficiency by simplifying the language model evaluation. This paper presents a novel left to right decoding algorithm for tree-to-string translation, using a bottom-up parsing strategy and dynamic future cost estimation for each partial translation. Our method outperforms previously published tree-to-string decoders, including a competing left-to-right method.

关键词： modelling languages decoding decoding algorithm machine translation syntax context-free grammars

来源：评论

学校读者我要写书评

暂无评论

Nonlinear sparse-graph codes for lossy compression of discrete nonredundant sources

Nonlinear sparse-graph codes for lossy compression of discre...

引用

IEEE Information Theory Workshop

作者： Gupta, Ankit Verdu, Sergio Princeton Univ Dept Elect Engn Princeton NJ 08540 USA

We propose a scheme to implement lossy data compression for discrete equiprobable sources using block codes based on sparse matrices. We prove asymptotic optimality of the codes for a Hamming distortion criterion. We ... 详细信息

ISBN: (纸本)9781424415632

关键词： lossy compression Sparse matrix optimum performance Block codes Codes discrete element decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Tawa Pukllay Proof: New Method for Solving Arithmetic Operations with The Inca Yupana Using Pattern Recognition and Parallelism

Tawa Pukllay Proof: New Method for Solving Arithmetic Operat...

引用

International Conference on Frontiers of Artificial Intelligence and Machine Learning (FAIML)

作者： Prem, Dhavit Guzman-Jimenez, Rosario Sotomayor, Fernando Saldivar, Alvaro Univ Lima ULIMA Syst Engn Lima Peru Univ Nacl Mayor San Marcos UNMSM Assoc Yupanki Lima Lima Peru Univ Lima ULIMA Fac Engn Lima Peru Univ Nacl Ingn UNI Postgrad Sch Lima Peru Univ Lima ULIMA Business Management Sci & Pedag Res Assoc Yupanki Lima Lima Peru

ISBN: (数字)9781665473644

ISBN: (纸本)9781665473644

Yupana is an Inca device used for arithmetic operations. This article describes a new arithmetical system: Tawa Pukllay (TP), where arithmetic operations do not require mental calculations: no carries, no borrows, no memorization of multiplication tables, nor trial and error procedures for divisions. Instead, user recognizes patterns and makes predefined movements to perform the four basic arithmetic operations very quickly;moreover, the result of the operation can be reached by multiple paths and in parallel, allowing each user to create his own strategies. This paper proves with mathematical rigor that TP produces correct numerical results.

关键词： inca mathematics tawa pukllay yupana pattern recognition parallel computation decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共26页 << < 15 16 17 18 19 20 21 22 23 24 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：