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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

43 篇 期刊文献
30 篇 会议

馆藏范围

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

日期分布

学科分类号

73 篇 工学
- 61 篇 电气工程
- 39 篇 信息与通信工程
- 21 篇 计算机科学与技术...
- 11 篇 电子科学与技术（可...
- 6 篇 控制科学与工程
- 3 篇 仪器科学与技术
- 2 篇 软件工程
- 1 篇 机械工程
- 1 篇 光学工程
- 1 篇 交通运输工程
- 1 篇 航空宇航科学与技...
10 篇 理学
- 6 篇 物理学
- 4 篇 数学
1 篇 医学
- 1 篇 临床医学
1 篇 管理学
- 1 篇 管理科学与工程(可...

主题

73 篇 non-binary ldpc ...
17 篇 iterative decodi...
7 篇 majority-logic d...
6 篇 decoding
4 篇 complexity theor...
4 篇 gf(q)
3 篇 reliability
3 篇 computational co...
3 篇 graph expansion
3 篇 belief propagati...
3 篇 extended min-sum...
3 篇 symbol flipping ...
3 篇 bit-reliability
3 篇 communications
3 篇 space communicat...
3 篇 reliability-base...
3 篇 stochastic decod...
2 篇 error correction...
2 篇 hamming distance
2 篇 error correction...

机构

7 篇 beihang univ sch...
3 篇 xidian univ sch ...
3 篇 nanjing univ sch...
3 篇 tokyo inst techn...
2 篇 huaqiao univ xia...
2 篇 univ coimbra dep...
2 篇 german aerosp ct...
2 篇 beijing inst tra...
2 篇 china acad space...
2 篇 univ arizona dep...
2 篇 natl chiao tung ...
2 篇 tokyo inst techn...
2 篇 xilinx res labs ...
2 篇 mcgill univ dept...
2 篇 xidian univ stat...
2 篇 collaborat innov...
1 篇 kth royal inst t...
1 篇 monash univ ecse...
1 篇 singapore univ t...
1 篇 alcatel lucent b...

作者

8 篇 kasai kenta
8 篇 huang qin
5 篇 wang zulin
4 篇 andrade joao
4 篇 falcao gabriel
4 篇 declercq david
4 篇 sakaniwa kohichi
4 篇 silva vitor
3 篇 viterbo emanuele
3 篇 liva gianluigi
3 篇 mu jianjun
3 篇 zhang mu
3 篇 song liyuan
3 篇 lin jun
3 篇 paolini enrico
3 篇 hong yi
3 篇 bai baoming
3 篇 zhao zhanzhan
3 篇 wang zhongfeng
3 篇 jiao xiaopeng

语言

71 篇 英文
1 篇 其他
1 篇 中文

检索条件"主题词=Non-binary LDPC codes"

共 73 条记录，以下是21-30 订阅

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

详细简洁

排序：

Puncturing Schemes for Rate-Compatible non-binary ldpc codes

Puncturing Schemes for Rate-Compatible Non-binary LDPC Codes

引用

IEEE International Conference on Electronics, Communications and Control (ICECC)

作者： Zhang, Bing Su, He-Guang Xia, Shu-Tao Tsinghua Univ Grad Sch Shenzhen Shenzhen 518055 Peoples R China

ISBN: (纸本)9781457703218

Finding good puncturing patterns for rate-compatible non-binary ldpc codes are considered over additive white Gaussian noise (AWGN) channels in this paper. We first study several popular puncturing schemes for binary ldpc codes and generalize them to non-binary ldpc codes, where the effects of short cycles in Tanner graph are rarely investigated. By carefully studying the impacts of short cycles when puncturing, we put forward a novel puncturing scheme for rate-compatible non-binary ldpc codes. Simulation results show that the proposed puncturing scheme is superior to the above known ones for rate-compatible non-binary ldpc codes over AWGN channels at certain cases.

关键词： rate-compatible non-binary ldpc codes Tanner graph puncturing

来源：评论

学校读者我要写书评

暂无评论

Low-Complexity Probability Generation Algorithm for Stochastic Decoding of non-binary ldpc codes

Low-Complexity Probability Generation Algorithm for Stochast...

引用

6th International ICST Conference on Communications and Networking in China (CHINACOM)

作者： He, Guanghua Bai, Baoming Xidian Univ State Key Lab ISN Xian 710071 Peoples R China

ISBN: (纸本)9781457701016

non-binary ldpc codes offer higher performances than their binary counterpart but suffer from highest decoding complexity. A solution to reduce the decoding complexity is the use of stochastic decoding algorithm, but the computational complexity of probability generation in the first step is very high. In this paper, we propose a simple method to fast generate the probability especially in high-order modulation schemes. Simulation results show that the proposed algorithm causes negligible performance degradation with reduction in computational complexity for stochastic decoding of non-binary ldpc codes, which gives some advantages in hardware implementation of the decoders.

关键词： non-binary ldpc codes stochastic decoding demodulations probability approximations decoder

来源：评论

学校读者我要写书评

暂无评论

A Cycle-based Rate-compatible Puncturing Technique for non-binary ldpc codes 11

A Cycle-based Rate-compatible Puncturing Technique for Non-b...

引用

11th International Conference on Signal Processing and Communications (SPCOM)

作者： Deka, Kuntal Rajesh, A. Bora, P. K. Indian Inst Informat Technol Guwahati Gauhati Assam India Indian Inst Technol Guwahati Gauhati Assam India

ISBN: (纸本)9781509017461

This paper presents a cycle-based rate-compatible puncturing technique for non-binary (NB) low-density parity-check (ldpc) codes. The proposed puncturing technique is based on the connectivity of the short non-binary (NB) cycles present in the Tanner graph. The connectivity of a cycle is measured by the extrinsic message degree (EMD). The short cycles with low values of EMD degrade the performance of iterative decoders significantly. The proposed technique selects the variable nodes for puncturing by reckoning their involvements in the short NB cycles with a low EMD. Simulations in different contexts are performed to check the efficiency of the proposed technique.

关键词： non-binary ldpc codes puncturing grouping algorithm cycle EMD

来源：评论

学校读者我要写书评

暂无评论

Low Error-Floor Majority-Logic Decoding Based Algorithm for non-binary ldpc codes

Low Error-Floor Majority-Logic Decoding Based Algorithm for ...

引用

IEEE International Conference on Communications (ICC)

作者： Song, Liyuan Zhang, Mu Huang, Qin Wang, Zulin Beihang Univ Sch Elect & Informat Engn Beijing 100191 Peoples R China

ISBN: (纸本)9781467364324

The traditional majority-logic decoding (MLgD) based algorithms suffer error-floors for decoding non-binary ldpc codes with small column weights. This paper presents a bit-reliability based MLgD (BRB-MLgD) algorithm with low error-floors for non-binary ldpc codes. The proposed algorithm is carried out based on the binary representations of nonbinary symbols. The reliability update along each edge of the Tanner graph of a non-binary ldpc code is in terms of bits rather than symbols. Thus, its computational complexity and memory consumption are less than those of the existing MLgD based algorithms. Simulation results indicate that the proposed algorithm can significantly reduce error-floors with small performance degradation in the waterfall region.

关键词： non-binary ldpc codes majority-logic decoding bit-reliability error-floor

来源：评论

学校读者我要写书评

暂无评论

A Novel Truncation Rule for the EMS Decoding of non-binary ldpc codes 12

A Novel Truncation Rule for the EMS Decoding of Non-binary L...

引用

12th International Conference on Signal Processing and Communications (SPCOM)

作者： Deka, Kuntal Rajesh, A. Bora, P. K. Indian Inst Technol Goa Farmagudi India Indian Inst Technol Guwahati Gauhati India

ISBN: (纸本)9781538638217

This paper presents a novel truncation rule for the extended min-sum (EMS) decoding of non-binary low-density parity-check (NB-ldpc) codes. The conventional NB-ldpc decoders involve vector-messages of length equal to the field size q. The complexity of these decoders increases significantly as q increases. In the EMS algorithm, the vector-messages are truncated by discarding the less-likely symbols. In this paper, we propose a truncation rule so that the lengths of the vector-messages are reduced to the so-far best limit without compromising on the error correction capability. We devise a proximity matrix which helps to identify the essential components of a vector-message for truncation. The proposed truncation rule has been applied to several NB-ldpc codes of different field sizes. Simulation results for these codes show that the proposed rule can achieve the maximum truncation with negligible performance loss.

关键词： non-binary ldpc codes min-sum algorithm EMS algorithm truncation rule

来源：评论

学校读者我要写书评

暂无评论

Set Min-Sum Decoding Algorithm for non-binary ldpc codes

Set Min-Sum Decoding Algorithm for Non-Binary LDPC Codes

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Song, Liyuan Huang, Qin Wang, Zulin Beihang Univ Sch Elect & Informat Engn Beijing Peoples R China Collaborat Innovat Ctr Geospatial Technol 129 Luoyu Rd Wuhan 430079 Peoples R China

ISBN: (纸本)9781509018062

This paper reduces the complexity of decoding non-binary low-density parity-check (ldpc) codes by set partition. In the check node update, the input vectors are partitioned into several sets such that different elements in the virtual matrix enjoy various computational strategies. As a result, the proposed algorithm achieves high computational efficiency by setting strategies according to the correct probability of these elements. Simulation results indicate that it significantly decreases the complexity of check node update with negligible performance loss.

关键词： non-binary ldpc codes check node update correct probability distribution set partition

来源：评论

学校读者我要写书评

暂无评论

FOURIER DOMAIN DECODING ALGORITHM OF non-binary ldpc codes FOR PARALLEL IMPLEMENTATION

FOURIER DOMAIN DECODING ALGORITHM OF NON-BINARY LDPC CODES F...

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Kasai, Kenta Sakaniwa, Koichi Tokyo Inst Technol Tokyo Japan

ISBN: (纸本)9781457705397

For decoding non-binary low-density parity-check (ldpc) codes, logarithm-domain sum-product (Log-SP) algorithms were proposed for reducing quantization effects of SP algorithm in conjunction with FFT. Since FFT is not applicable in the logarithm domain, the computations required at check nodes in the Log-SP algorithms are computationally intensive. What is worse, check nodes usually have higher degree than variable nodes. As a result, most of the time for decoding is used for check node computations, which leads to a bottleneck effect. In this paper, we propose a Log-SP algorithm in the Fourier domain. With this algorithm, the role of variable nodes and check nodes are switched. The intensive computations are spread over lower-degree variable nodes, which can be efficiently calculated in parallel. Furthermore, we develop a fast calculation method for the estimated bits and syndromes in the Fourier domain.

关键词： non-binary ldpc codes parallel implementation Galois field iterative decoding

来源：评论

学校读者我要写书评

暂无评论

Coset Probability Based Majority-logic Decoding for non-binary ldpc codes

Coset Probability Based Majority-logic Decoding for Non-bina...

引用

IEEE Information Theory Workshop (ITW)

作者： Wijekoon, V. B. Liu, Shuiyin Viterbo, Emanuele Hong, Yi Micheloni, Rino Marelli, Alessia Monash Univ Clayton Vic Australia Holmes Inst Melbourne Vic Australia Microsemi Corp Milan Italy

ISBN: (纸本)9781538669006

This paper presents a majority-logic decoding (MLgD) algorithm for non-binary ldpc codes based on a novel expansion of the Tanner graph. The expansion introduced converts the Q-ary graph into a binary one, which makes the new MLgD algorithm more attractive for hardware implementations. Proposed algorithm performs significantly better than the existing MLgD algorithms in the waterfall region, and it shows a much lower error-floor as well. Algorithm only requires integer additions, comparisons, finite field operations and some binary operations. Thus, it offers an effective trade-off between performance and complexity in decoding non-binary ldpc codes.

关键词： non-binary ldpc codes Majority-logic decoding Graph expansion

来源：评论

学校读者我要写书评

暂无评论

On the Performance of Moderate-Length non-binary ldpc codes for Space Communications

On the Performance of Moderate-Length Non-Binary LDPC Codes ...

引用

5th Advanced Satellite Multimedia Systems Conference / 11th Signal Processing for Space Communications Workshop (ASMS/SPSC)

作者： Costantini, Laura Matuz, Balazs Liva, Gianluigi Paolini, Enrico Chiani, Marco Univ Bologna DEIS WiLAB Via Venezia 52 I-47521 Cesena FC Italy German Aerosp Ctr DLR Inst Commun & Nav D-82234 Wessling Germany

ISBN: (纸本)9781424468331

In this paper, an overview of recent achievements in the design and decoding of non-binary low-density paritycheck (ldpc) codes is provided. non-binary constructions based on ultra-sparse matrices are compared with binary low-density parity-check codes and turbo codes from satellite communication standards, to show that larger coding gains ( outperforming the binary competitors by at least 0.3 dB) can be achieved on the AWGN channel, especially in the moderate/short block regimes. Thanks to this excellent performance, non-binary ldpc codes represent an appealing solution for space communications. Index Terms-Belief propagation, non-binary ldpc codes, space communications, satellite communications.

关键词： Belief propagation non-binary ldpc codes space communications satellite communications

来源：评论

学校读者我要写书评

暂无评论

binary Diversity for non-binary ldpc codes over the Rayleigh Channel

Binary Diversity for Non-Binary LDPC Codes over the Rayleigh...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Gorgoglione, Matteo Savin, Valentin Declercq, David CEA LETI Grenoble France

ISBN: (纸本)9781467304375;9781467304368

In this paper we analyze the performance of several bit-interleaving strategies applied to non-binary Low-Density Parity-Check (ldpc) codes over the Rayleigh fading channel. The technique of bit-interleaving used over fading channel introduces diversity which could provide important gains in terms of frame error probability and detection. This paper demonstrates the importance of the way of implementing the bit-interleaving, and proposes a design of an optimized bit-interleaver inspired from the Progressive Edge Growth algorithm. This optimization algorithm depends on the topological structure of a given ldpc code and can also be applied to any degree distribution and code realization. In particular, we focus on non-binary ldpc codes based on graph with constant symbol-node connection d(v) = 2. These regular (2, dc)-NB-ldpc codes demonstrate best performance, thanks to their large girths and improved decoding thresholds growing with the order of Finite Field. Simulations show excellent results of the proposed interleaving technique compared to the random interleaver as well as to the system without interleaver.

关键词： non-binary ldpc codes bit-interleaver Rayleigh fading channel Tanner Graph

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共8页 << < 1 2 3 4 5 6 7 8 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：