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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

46 篇 会议
27 篇 期刊文献
3 篇 学位论文

馆藏范围

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

日期分布

学科分类号

71 篇 工学
- 46 篇 电气工程
- 35 篇 计算机科学与技术...
- 31 篇 信息与通信工程
- 10 篇 电子科学与技术（可...
- 6 篇 控制科学与工程
- 4 篇 仪器科学与技术
- 1 篇 光学工程
- 1 篇 材料科学与工程（可...
- 1 篇 交通运输工程
- 1 篇 软件工程
18 篇 理学
- 12 篇 数学
- 2 篇 物理学
- 2 篇 系统科学
- 2 篇 统计学（可授理学、...
1 篇 文学
- 1 篇 新闻传播学
1 篇 医学
- 1 篇 临床医学
1 篇 军事学
- 1 篇 军队指挥学
1 篇 管理学
- 1 篇 管理科学与工程(可...

主题

76 篇 linear block cod...
18 篇 block codes
13 篇 linear codes
11 篇 decoding
7 篇 codes
5 篇 iterative decodi...
5 篇 maximum likeliho...
4 篇 computational co...
4 篇 error correction...
4 篇 parity check cod...
4 篇 binary codes
4 篇 complexity theor...
4 篇 channel coding
3 篇 hamming distance
3 篇 error correction
3 篇 a* algorithm
3 篇 code length
3 篇 interactive enco...
3 篇 soft decoding of...
3 篇 low density pari...

机构

2 篇 waseda univ sch ...
2 篇 univ illinois co...
2 篇 coding and crypt...
2 篇 brno university ...
2 篇 natl taiwan univ...
2 篇 univ electrocomm...
2 篇 tokyo city univ ...
2 篇 waseda univ wase...
2 篇 natl taiwan univ...
1 篇 univ bridgeport ...
1 篇 univ colorado de...
1 篇 osaka univ grad ...
1 篇 informat engn un...
1 篇 shiraz univ sch ...
1 篇 tech univ eindho...
1 篇 pla univ sci & t...
1 篇 heriot watt univ...
1 篇 waseda univ medi...
1 篇 sound technology...
1 篇 michigan state u...

作者

4 篇 kasami t
4 篇 fujiwara t
3 篇 hirasawa shigeic...
3 篇 yagi hideki
3 篇 chang chia-fu
3 篇 lin mao-chao
2 篇 li yonghui
2 篇 meng jin
2 篇 jin ming
2 篇 gu bin
2 篇 mahmoud ahmadian...
2 篇 zhang yan
2 篇 yasser karimian
2 篇 vucetic branka
2 篇 wang junming
2 篇 niinomi toshihir...
2 篇 yue chentao
2 篇 shirvanimoghadda...
1 篇 kotter r
1 篇 hefele alexander

语言

74 篇 英文
1 篇 其他
1 篇 中文

检索条件"主题词=Linear Block Code"

共 76 条记录，以下是41-50 订阅

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

详细简洁

排序：

Performance Analysis of Various FEC-coded OFDM Communication Systems 3

Performance Analysis of Various FEC-coded OFDM Communication...

引用

3rd Asia-Pacific Conference on Communications Technology and Computer Science (ACCTCS)

作者： Wu, Beiyan Heriot Watt Univ Edinburgh Midlothian Scotland

ISBN: (纸本)9798350310801

Orthogonal Frequency Division Multiplexing (OFDM) is used to encode digital data at multiple carrier frequencies and has evolved into a very common broadband digital communication scheme. All its subcarriers are orthogonal to each other, reducing the interference among subcarriers. Additionally, inter-symbol interference (ISI) can be reduced by using the Cyclic Prefix (CP). However, the intrablock OFDM symbol still degrades the performance. Bit Error Rate (BER) can be used to analyze OFDM performance. The efficiency of the OFDM system increases as the BER value decreases. The performance of the errors can be enhanced by using forward error correction. This study covers the performance of OFDM with linear block code, Convolutional code, Cyclic block code, Turbo code, and LDPC across the whole SNR range. There has also been a discussion of the difference between coded and uncoded OFDM. The outcome demonstrates that Cyclic block code is superior to linear block code in complex situations., LDPC code performs better when increasing the data rate than Convolutional code, and with more code generator polynomials, Turbo code shows less BER value in comparison with Convolutional code.

关键词： OFDM BER Convolutional code Cyclic block code Turbo code LDPC linear block code

来源：评论

学校读者我要写书评

暂无评论

Fast algorithm for Blind Deinterleaving of a block Interleaver using binary and non-binary block codes in a telecommunication system 12

Fast algorithm for Blind Deinterleaving of a Block Interleav...

引用

12th IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)

作者： Gogia, Rahul Lall, Brejesh Joshi, S. D. Indian Inst Technol Bharti Sch Telecommun & Management New Delhi 110016 India Indian Inst Technol Dept Elect Engn New Delhi 110016 India

ISBN: (纸本)9781538681343

Interleavers were made a part of the digital communication to tackle the presence of burst errors due to a noisy channel or incorrect viterbi decoding by performing a rearrangement of the bits by using an interleaving array of size N-r x N-c where N-r is the number of rows, also called interleaver depth and N-c is the number of columns of the array. A typical audio and video broadcasting system consisting of a linear block code (LBC) and a block interleaver is presented and a method to deinterleave the received sequence without any knowledge of the blocks used on the transmitter side i.e. in a blind setting is discussed. There is hardly any existing literature that solves this problem completely. The proposed algorithm calculates N-r and codeword length by using rank deficiency while N-c is calculated by using cyclic convolution to complete the analysis that is conducted on different LBCs with varying frame structure formats.

关键词： viterbi decoding block interleaver linear block code digital communication burst error interleaving array blind setting rank deficiency cyclic correlation

来源：评论

学校读者我要写书评

暂无评论

On Design of Doubly-Generalized LDPC codes Based on Multi-Type Information Functions

On Design of Doubly-Generalized LDPC Codes Based on Multi-Ty...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Paolini, Enrico Chiani, Marco Fossorier, Marc P. C. Univ Bologna DEIS WiLAB Via Venezia 52 I-47521 Cesena Fc Cesena Italy CNRS ETIS ENSEA UCP UMR 8051 F-95014 Cergy Pontoise France

ISBN: (纸本)9781424456383

Ensemble design of low-density parity-check (LDPC) codes and their generalizations is usually performed via numerical optimization techniques, such as differential evolution, in which a threshold analysis tool is always necessary. Threshold analysis of unstructured doubly-generalized LDPC (D-GLDPC) code ensembles over the binary erasure channel (BEC) can be performed via extrinsic information transfer (EXIT) chart, exploiting the information functions and split information functions of the check and variable component codes, respectively. In this paper, multi-type information functions of linear block codes are introduced as an extension of the concept of information functions, when the bit positions are assumed to be associated with different types. It is shown how multi-type information functions (together with their split counterparts) can be exploited within an EXIT analysis approach to perform threshold analysis over the BEC of multi-edge type D-GLDPC code ensembles. The proposed technique for threshold analysis captures D-GLDPC codes based on protographs as a special case.

关键词： D-GLDPC code EXIT analysis EXIT chart binary erasure channel block codes extrinsic information transfer linear block code linear codes low-density parity-check code multitype information function parity check codes threshold analysis unstructured doubly-g

来源：评论

学校读者我要写书评

暂无评论

Comparison of BER analysis in OFDM using linear and cyclic block codes for different Digital Modulation Techniques 2

Comparison of BER analysis in OFDM using linear and cyclic b...

引用

2nd International Conference on Computational Intelligence & Communication Technology (CICT)

作者： Manhas, Pratima Soni, M. K. Manav Rachna Int Univ FET ECE Fbd India Manav Rachna Int Univ FET Fbd India

ISBN: (纸本)9781509002108

Orthogonal frequency division multiplexing (OFDM) is a type of digital modulation technique which is used in wireless communication systems. It is an efficient multicarrier modulation technique, in which large bandwidth is divided into parallel narrow bands each of which is modulated by different subcarriers. All the subcarriers are orthogonal to each other and hence it reduces the interference among various subcarriers. But OFDM suffers from high peak to average power ratio(PAPR), high complexity in design. The performance parameter of OFDM can be measured in terms of Bit error rate (BER). Lower the BER value, higher is the efficiency of OFDM system. Various methods are used to enhance the BER performance. Channel coding is the one way of enhancing the BER. This paper discusses the performance of OFDM using linear & cyclic block coding for different digital modulation techniques. Bit error rate (BER) is used to measure the performance of OFDM systems.

关键词： Bit error rate (BER) linear block code Cyclic block code orthogonal channel coding

来源：评论

学校读者我要写书评

暂无评论

Adaptive Cut Generation for Improved linear Programming Decoding of Binary linear codes

Adaptive Cut Generation for Improved Linear Programming Deco...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Zhang, Xiaojie Siegel, Paul H. Univ Calif San Diego La Jolla CA 92093 USA

ISBN: (纸本)9781457705953

linear programming (LP) decoding approximates optimal maximum-likelihood (ML) decoding of a linear block code by relaxing the equivalent ML integer programming (IP) problem into a more easily solved LP problem. The LP problem is defined by a set of linear inequalities derived from the constraints represented by the rows of a parity-check matrix of the code. Adaptive linear programming (ALP) decoding significantly reduces the complexity of LP decoding by iteratively and adaptively adding necessary constraints in a sequence of smaller LP problems. Adaptive introduction of constraints derived from certain additional redundant parity check (RPC) constraints can further improve ALP performance. In this paper, we propose a new and effective algorithm to identify RPCs that produce linear constraints, referred to as "cuts," that can eliminate non-ML solutions generated by the ALP decoder, often significantly improving the decoder error-rate performance. The cut-finding algorithm is based upon a specific transformation of an initial parity-check matrix of the linear block code. Simulation results for several low-density parity-check codes demonstrate that the modified ALP decoding algorithm significantly narrows the performance gap between LP decoding and ML decoding.

关键词： ALP decoding Iterative decoding LP decoding linear code linear matrix inequalities linear programming Maximum likelihood decoding RPC constraint adaptive codes adaptive cut generation adaptive linear programming decoding binary linear code block codes cut-finding algorithm decoder error-rate performance equivalent ML IP problem equivalent ML integer programming problem integer programming iterative decoding linear block code linear codes linear inequality linear programming linear programming decoding low-density parity-check matrix code maximum likelihood decoding optimal ML decoding optimal maximum-likelihood decoding parity check codes redundant parity check constraint

来源：评论

学校读者我要写书评

暂无评论

MODERATE COMPLEXITY TURBO DEcodeR FOR NEAR-OPTIMUM DECODING OF PRODUCT codeS 95

MODERATE COMPLEXITY TURBO DECODER FOR NEAR-OPTIMUM DECODING ...

引用

IEEE 95th Vehicular Technology Conference: (VTC-Spring)

作者： Yellapu, Ganesh Bharat Elect Ltd Cent Res Lab Bangalore Karnataka India

ISBN: (数字)9781665482431

ISBN: (纸本)9781665482431

The Chase-Pyndiah algorithm which is a soft-input/soft-output algorithm is revisited for decoding turbo product codes (TPC). In general, soft-output computation of the algorithm involves a huge amount of compare and save operations. In this paper, a hybrid approach is considered for the soft output computation which reduces the amount of these operations to a moderate level comparing to the original algorithm. For the Hamming code TPCs (32, 26, 4)(2) and (64, 57, 4)(2), the Chase-Pyndiah algorithm with hybrid approach for the soft output computation has shown no degradation in coding gain when compared to the original algorithm while reducing the algorithm's complexity.

关键词： coding gain linear block code Chase algorithm SISO decoding turbo product code

来源：评论

学校读者我要写书评

暂无评论

Low-Density linear IED Schemes for Lossless Source Coding with Decoder Only Side Information

Low-Density Linear IED Schemes for Lossless Source Coding wi...

引用

46th Annual Allerton Conference on Communication, Control and Computing

作者： Meng, Jin Yang, En-hui He, Da-ke Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada Res MotionSlipStream Waterloo ON N2L 5Z5 Canada

ISBN: (纸本)9781424429257

In this paper we investigate the performance of linear interactive encoding and decoding (EED) for lossless source coding with decoder only side information. Assume that the source alphabet X is a finite field and that the side information alphabet is finite. It is shown that there exist universal linear EED schemes which are asymptotically optimal for any stationary, ergodic source-side information pair. Our analysis of low-density IED schemes further reveals that as long as epsilon(n)p(n)* = Omega(log n/n), where epsilon(n) and p(n)* are real numbers, one can always construct a sequence of universal linear IED schemes {I-n} such that the average density of the parity check matrices associated with I-n is concentrated around (|X| - 1)p(n)*, and the resulting symbol error probability is upper bounded by epsilon(n) + o(epsilon(n)).

关键词： Interactive Encoding and Decoding linear block code Low Density Parity Check Matrix Slepian-Wolf Coding

来源：评论

学校读者我要写书评

暂无评论

On Computing the Weight Distribution of Non-Binary LDPC codes Using the Probabilistic Algorithm

On Computing the Weight Distribution of Non-Binary LDPC Code...

引用

International Symposium on Information Theory and its Applications (ISITA)

作者： Hirotomo, Masanori Tsurumi, Jun'ichi Morii, Masakatu Saga Univ Grad Sch Sci & Engn Saga 8408502 Japan Kobe Univ Grad Sch Engn Kobe Hyogo 6578501 Japan

ISBN: (纸本)9784885522925

Non-binary low-density parity-check (LDPC) codes are linear block codes defined by the sparse parity-check matrix over finite fields. The weight distribution is a significant factor to evaluate error floors of LDPC codes. In this paper, we propose a probabilistic method for estimating the low part of the weight distribution of non-binary LDPC codes. Using the proposed method, we can estimate the low part of the weight distribution with small failure probability.

关键词： Australia block codes Complexity theory Educational institutions Parity check codes Probabilistic logic Vectors block codes Probabilistic logic parity check codes low density parity check codes Complexity theory Educational institutions PART WEIGHT failure probability linear block code check matrix

来源：评论

学校读者我要写书评

暂无评论

Construction of minimal tail-biting trellises

Construction of minimal tail-biting trellises

引用

IEEE Information Theory Workshop

作者： Kotter, R Vardy, A Univ Illinois Coordinated Sci Lab Urbana IL 61801 USA

ISBN: (纸本)0780344081

The subject of tail-biting trellis representation of block codes has attracted a lot of interest recently. One of the major open problems in this area is how to construct a minimal tail-biting trellis for a given linear code. Herein, we present a solution to this problem. Given a linear block code C, we show how to construct a linear tail-biting trellis for C that minimizes the product of vertex-space sizes among all possible linear tail-biting trellises for C. Our methods are based on the new concept of the characteristic matrix for a linear block code. The complexity of the resulting construction is O(n(2)) for a code of length n.

关键词： tail biting TRELLIS characteristic matrix linear block code block codes code length codes less-favoured region linear block linear codes

来源：评论

学校读者我要写书评

暂无评论

The Kronecker Space-Time MIMO Network code

The Kronecker Space-Time MIMO Network Code

引用

5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)

作者： Vazquez-Castro, M. A. Univ Autonoma Barcelona Dept Telecommun & Syst Engn E-08193 Barcelona Spain

ISBN: (纸本)9781479911776

We build upon [1] for the case of error-prone wireless access networks and transmission over finite fields. Our focus is the derivation of the network code naturally provided by the wireless topology when using packet-level channel coding. The topology is assumed to be an LxL Multiple Input Multiple Output (MIMO) and transmission units are q-ary row vectors. Our results include the following. First, our model algebraically decouples the effect of the network topology (occurring on the encoding spatial domain) from the effect of the packet-level channel coding (occurring on the time encoding domain). Second, the model algebraically matches space and time encoding domains with the network code coefficients provided by the physical layer, which are formalized as a natural space-time erasure channel. Third, the model yields an algebraic interpretation of network coding for unicast and multicast as weighted projections onto lower-dimensional subspaces. Finally, we analytically derive the space-time q-ary repetition code that the MIMO topology and the channel coding introduce. The Kronecker product is shown to be the natural way to express the encoding functions.

关键词： Network coding MIMO topology linear block code

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：