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

International Joint Conference on Neural Networks

作者： Hadi, Ahmed S. Univ Baghdad Al Khawarizmi Coll Engn Informat & Commun Engn Dept Baghdad Iraq

ISBN: (纸本)9781424418206

In this paper the linear block code decoder is constructed by neural network. The neural network will be adapted for a single-bit error. Each layer of a neural network will simulate a linear block code decoder stage. The syndrome generator, the error detection, and the error correction stages of the linear block code decoder will be simulated by the proposed neural network.

关键词： linear block code Neural Network Syndrome Error detection Error Correction

来源：评论

学校读者我要写书评

暂无评论

AVERAGE COMPLEXITY EVALUATION OF AN MLD ALGORITHM USING THE TRELLIS STRUCTURE FOR A linear block code

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 1995年第9期E78A卷 1209-1214页

作者： NAGANO, H FUJIWARA, T KASAMI, T Osaka Univ Toyonaka-shi Japan

This letter is concerned with the evaluation of the average computational complexity of the maximum likelihood decoding of a linear block code using its trellis diagram. Each section of the L-section minimal trellis diagram for a linear block code consists of parallel components which are structurally identical subgraphs without cross connection between them. A parallel component is also known to be decomposed into subgraphs, and a decoding algorithm by using the structure of the subgraphs of parallel components was proposed, and an upper bound on the worst case computational complexity was derived. In this letter, the average computational complexity of the decoding algorithm is evaluated by computer simulation. We evaluated the average numbers of additions and comparisons performed in the decoding algorithm for example codes, (64,45) extended and permuted binary primitive BCH code, the third order Reed-Muller (64,42) code and its (64,40) subcode. It is shown that the average numbers are much smaller than those for the worst case, and hence the decoding algorithm is efficient when the number of sections, L, is small, say 4 or 8, for the example codes. Especially, for the (64,45) extended binary primitive BCH code with L = 4, the average numbers of additions and comparisons in the decoding: algorithm for finding the survivor's metric of each state after finding the smallest metric among parallel branches are about 1/50 and 17/100 of those in the conventional exhaustive search, respectively. The number of additions and comparisons by the conventional search for all the example codes is smallest when L is 4. As a result, the decoding algorithm with L = 4 gives the smallest number of operations among those decoding methods considered here.

关键词： MAXIMUM LIKELIHOOD DECODING linear block code BCH code REED-MULLER code L-SECTION MINIMAL TRELLIS DIAGRAM

来源：评论

学校读者我要写书评

暂无评论

Performance of linear block code with Subcarrier Multiplexing System on a Multimode Fiber using Low Frequency Passbands 1

Performance of Linear Block Code with Subcarrier Multiplexin...

引用

1st International ECTI-Northern-Section Conference on Electrical, Electronics, Computer and Telecommunications Engineering (ECTI-NCON)

作者： Patmanee, Jaruwat Pinthong, Chairat Kanprachar, Surachet Naresuan Univ Dept Elect & Comp Engn Fac Engn Phitsanulok Thailand

ISBN: (纸本)9781538635520

Multimode fibers have been shown to not just be able to convey signal at their 3-dB modal bandwidth, which is limited to approximately 200 to 500 MHz-km, but also at the frequency higher than the 3-dB modal bandwidth. At this higher frequency, the magnitude response of the multimode fiber has been analyzed showing that it contains many possible passbands with an average attenuation depending on the number of modes in the fiber. In this work, the passbands at low frequency region;that is, the frequency that is located next to the 3-dB modal bandwidth of the fiber are utilized as sub-channels in transmitting a combined high data rate signal over a multimode fiber. Subcarrier multiplexing technique is used to send a high data rate signal over different low data rate signals. Additionally, a linear block code is adopted in order to overcome the degradation caused by the effect of null in the magnitude response of the fiber. The performance of the system in terms of bit-error-rate is analyzed and the simulated results are given. It is shown that with a (7, 4) linear block code, the average biterr-or-rate (BER) of lower than 10-8 with a total data rate of 392 Mbps can be obtained. With a total data rate twice the 3-dB modal bandwidth of the fiber, the obtained BER is significantly improved compared to the case of without coding.

关键词： Multimode fibers Subcarrier Multiplexing linear block code bit-error-rate

来源：评论

学校读者我要写书评

暂无评论

The Method to Recognize linear block code Based on the Distribution of code Weight

The Method to Recognize Linear Block Code Based on the Distr...

引用

10th International Conference on Communication Software and Networks (ICCSN)

作者： Wang Lei Ge Yizhou Zhao Fucai Wang Yong Sci & Technol Commun Informat Secur Control Lab Jiaxing Peoples R China Natl Univ Def Technol Key Lab Elect Restrict Hefei Anhui Peoples R China

The definition and matrix description of linear cyclic code is introduced in this paper first. Then the distribution of code weight is analyzed. The distance of code weight distribution is defined according to distance of vectors. The theoretic probability of code weight of random sequence is ratiocinated. The method to estimate code weight distribution of actual sequence is established. The code length and start are estimated by the distance between the code weight distribution and the check matrix and generation matrix are estimated by Gauss Elimination. The results of simulating experiment to different length code show that this method can recognize code with middle and short code length effectively when BER is 10(-3).

关键词： distribution of code weight linear block code code length generation matrix

来源：评论

学校读者我要写书评

暂无评论

Distinction of self-synchronous scrambled linear blockcodes based on multi-fractal spectrum

引用

Journal of Systems Engineering and Electronics 2016年第5期27卷 968-978页

作者： xinhao li min zhang shu'nan han quan yuan electronic engineering institute Hefei 230037China key laboratory of anhui electronic restricting technique Hefei 230037China

This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linear block code share the propertyof linear correlation, the existing linear correlation-basedidentification method is invalid for this case. This drawback can becircumvented by introducing a novel multi-fractal spectrum-basedmethod. Simulation results show that the new method has highrobustness and under the same conditions of bit error, the lowerthe code rate, the higher the recognition rate. Thus, the methodhas significant potential for future application in engineering.

关键词： linear block code self-synchronous scrambled code,multi-fractal spectrum statistical physics algorithm.

来源：评论

学校读者我要写书评

暂无评论

G-projectable and Δ-projectable binary linear block codes

引用

DESIGNS codeS AND CRYPTOGRAPHY 2007年第1期45卷 51-64页

作者： Esmaeili, Morteza Hivadi, Morteza Isfahan Univ Technol Dept Math Sci Esfahan Iran

The binary [24,12,8] Golay code has projection O onto the quaternary [6,3,4] hexacode [9] and the [32,16,8] Reed-Muller code has projection E onto the quaternary self-dual [8,4,4] code [6]. Projection E was extended to projection G in [8]. In this paper we introduce a projection, to be called projection Delta that covers projections O, E and G. We characterise G-projectable self-dual codes and Delta-projectable codes. Explicit methods for constructing codes having G and Delta projections are given and several so constructed codes that have best known optimal parameters are introduced.

关键词： linear block code projection on F-4 G-projection Lambda-projection

来源：评论

学校读者我要写书评

暂无评论

On the DS2 Bound for Forney's Generalized Decoding Using Non-Binary linear block codes

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2018年第8期E101A卷 1223-1234页

作者： Niinomi, Toshihiro Yagi, Hideki Hirasawa, Shigeichi Tokyo City Univ Faulty Knowledge Engn Dept Comp Sci Tokyo 1588557 Japan Univ Electrocommun Dept Comp & Network Engn Chofu Tokyo 1828585 Japan Waseda Univ Sch Sci & Engn Tokyo 1698555 Japan Waseda Univ Tokyo 1698555 Japan Waseda Univ Waseda Res Inst Sci & Engn Tokyo 1698555 Japan

Recently, Hof et al. extended the type-2 Duman and Salehi (DS2) bound to generalized decoding, which was introduced by Forney, with decision criterion FR. From this bound, they derived two significant bounds. One is the Shulman-Feder bound for generalized decoding (GD) with the binary-input output-symmetric channel. The other is an upper bound for an ensemble of linear block codes, by applying the average complete weight distribution directly to the DS2 bound for GD. For the Shulman-Feder bound for GD, the authors derived a condition under which an upper bound is minimized at an intermediate step and show that this condition yields a new bound which is tighter than Hof et al.'s bound. In this paper, we first extend this result for non-binary linear block codes used over a class of symmetric channels called the regular channel. Next, we derive a new tighter bound for an ensemble of linear block codes, which is based on the average weight distribution.

关键词： decision feedback generalized decoding linear block code DS2 bound Shulman-Feder bound

来源：评论

学校读者我要写书评

暂无评论

Statistical BER Analysis of Wireline Links With Non-Binary linear block codes Subject to DFE Error Propagation

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS 2020年第1期67卷 284-297页

作者： Yang, Ming Shahramian, Shayan Shakiba, Hossein Wong, Henry Krotnev, Peter Carusone, Anthony Chan Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 3G4 Canada Huawei Technol Canada Ottawa ON K2K 3J1 Canada

This paper presents a statistical model to accurately estimate post-FEC BER for high-speed wireline links using standard linear block codes, such as the RS(544,514,15) KP4 and RS(528,514,7) KR4 codes. A hierarchical approach is adopted to analyze the propagation of PAM-symbol and FEC-symbol errors through a two-layer Markov model. A series of techniques including state aggregation, time aggregation, state reduction, and dynamic programming are introduced making the time complexity to compute post-FEC BER below 10(-15) reasonable. Error bounds associated with each method are found. The efficiency of the proposed model allows it to handle a larger state space, more DFE taps, and more sophisticated linear block codes than prior work. A 4-PAM 60 Gb/s wireline transceiver fabricated in a 7 nm FinFET technology is used as a test vehicle to validate this model. Measured data with two different channels reveals that the statistical model can properly predict the post-FEC error floor with standard FEC codes. While this paper demonstrates the method for capturing DFE error propagation, the method is general and can be applied to model other communication systems having memory effects. Moreover, our proposed model can be easily extended to higher-level PAM schemes and other advanced equalizer architectures to assist in making architectural choices for wireline transceivers.

关键词： Decision feedback equalizers Forward error correction Markov processes Computational modeling Estimation block codes Standards BER estimation burst error decision feedback equalization (DFE) dynamic programming error propagation forward error correction (FEC) linear block code Markov model pulse amplitude modulation (PAM) state aggregation time aggregation wireline channel

来源：评论

学校读者我要写书评

暂无评论

Decision Feedback Scheme with Criterion LR plus Th for the Ensemble of linear block codes

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2020年第1期E103A卷 334-345页

In decision feedback scheme, Forney's decision criterion (Forney's rule: FR) is optimal in the sense that the Neyman-Pearson's lemma is satisfied. Another prominent criterion called LR+Th was proposed by Hashimoto. Although LR+Th is suboptimal, its error exponent is shown to be asymptotically equivalent to that of FR by random coding arguments. In this paper, applying the technique of the DS2 bound, we derive an upper bound for the error probability of LR+Th for the ensemble of linear block codes. Then we can observe the new bound from two significant points of view. First, since the DS2 type bound can be expressed by the average weight distribution whose code length is finite, we can compare the error probability of FR with that of LR+Th for the fixed-length code. Second, the new bound elucidates the relation between the random coding exponents of block codes and those of linear block codes.

关键词： decision feedback generalized decoding linear block code DS2 bound Shulman-Feder bound LR plus Th

来源：评论

学校读者我要写书评

暂无评论

INFORMATION-BIT, INFORMATION-SYMBOL, AND DEcodeD-SYMBOL ERROR RATES FOR linear block-codeS

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1988年第5期36卷 613-617页

作者： TORRIERI, D Department of the Army Survivability Management Office SLCSM Adelphi MD USA

There are two types of bounded-distance decoders for linear block codes: erasing decoders that discard uncorrectable received words, and reproducing decoders that reproduce uncorrectable received words. Exact expressions for the information-symbol and decoded-symbol error rates are derived for both types. Necessary and sufficient conditions are derived for the quality of the information-symbol and decoded symbol error rates, It is formally proved that these two error rates are equal for cyclic codes with either erasing or reproducing decoders. For reproducing decoders, two approximations to the information-bit error rate and their applicability are examined.

关键词： Quality Information decoders linear block linear block code cyclic codes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：