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

3rd International Conference on Instrumentation & Measurement, Computer, Communication and Control (IMCCC)

作者： Chen Rui Yang Jing Hu Rong-gui Huang Shu-guang Inst Elect Engn Dept Network Hefei Peoples R China

ISBN: (纸本)9780769551227

LSTM-RNN has been succeeded in applying in offline handwritten recognition. The paper used two-dimensional LSTM-RNN to recognize text-based CAPTCHA. Aiming at the problem that traditional decoding algorithm cannot obtain satisfactory results. The paper proposed a novel decoding algorithm based on the multi-population genetic algorithm. The experimental results showed that the novel decoding algorithm for the LSTM-RNN can improve the recognition rate of merged-type CAPTCHA.

关键词： Network Security CAPTCHA recognition decoding algorithm Recurrent Neural Network

来源：评论

学校读者我要写书评

暂无评论

Based on TSIP protocol GPS data decoding algorithm

Based on TSIP protocol GPS data decoding algorithm

引用

4th International Conference on Manufacturing Science and Engineering (ICMSE 2013)

作者： Sui, Shou Gang Liu, Cun Gen Gao, Huan Bing School of Information and Electric Engineering Shandong Jianzhu University 250101 China

ISBN: (纸本)9783037857243

TSIP protocol is another code of GPS data which is different from NMEA0183. TSIP protocol supports 9600 baud rate or higher. TSIP protocol is duplex system, and in this protocol we can quickly obtain GPS information by using the special order instead of passively waiting. In this paper, the algorithm of GPS data based on TSIP protocol is proposed, and the advantages and disadvantages of TSIP is analyzed.

关键词： TSIP GPS decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

A Reduced Latency List decoding algorithm for Polar Codes

A Reduced Latency List Decoding Algorithm for Polar Codes

引用

IEEE Workshop on Signal Processing Systems (SiPS)

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

ISBN: (纸本)9781479965885

The cyclic redundancy check (CRC) aided successive cancelation list (SCL) decoding algorithm has better error performance than the successive cancelation (SC) decoding algorithm for short or moderate polar codes. However, the CRC aided SCL (CA-SCL) decoding algorithm still suffer from long decoding latency. In this paper, a reduced latency list decoding (RLLD) algorithm for polar codes is proposed. For the proposed RLLD algorithm, all rate-0 nodes and part of rate-1 nodes are decoded instantly without traversing the corresponding subtree. A list maximum-likelihood decoding (LMLD) algorithm is proposed to decode the maximum likelihood (ML) nodes and the remaining rate-1 nodes. Moreover, a simplified LMLD (SLMLD) algorithm is also proposed to reduce the computational complexity of the LMLD algorithm. Suppose a partial parallel list decoder architecture with list size L = 4 is used, for an (8192, 4096) polar code, the proposed RLLD algorithm can reduce the number of decoding clock cycles and decoding latency by 6.97 and 6.77 times, respectively.

关键词： Government Polar code Government error performance decoding list decoding clock cycle Latency decoding algorithm Ganglia complexity classes

来源：评论

学校读者我要写书评

暂无评论

decoding algorithm for iterated codes correcting compound errors

引用

ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE 2006年第1期89卷 60-72页

作者： Kurihara, M Univ Electrocommun Dept Informat & Commun Engn Chofu Tokyo 1828585 Japan

This paper discusses codes, and a decoding method, that can correct compound errors containing a mix of random and burst errors. Specifically, the paper provides a minimum compound distance that represents a compound error correcting capacity for iterated codes, proposes a compound error correcting decoding algorithm for the code, and demonstrates that the decoding algorithm is capable of correcting compound errors up to half the minimum compound distance of the code. The proposed decoding algorithm is a generalized decoding method in which the decoding method for iterated codes indicated by Reddy and Robinson is a particular case. By this generalization, the proposed decoding algorithm can correct compound errors that cannot be corrected by conventional decoding methods. (c) 2005 Wiley Periodicals, Inc.

关键词： random error burst error compound error compound distance iterated code decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Gaussian Approximation Optimized SC-Flip decoding algorithm of Polar Codes 4

Gaussian Approximation Optimized SC-Flip Decoding Algorithm ...

引用

4th IEEE Information Technology, Networking, Electronic and Automation Control Conference (ITNEC)

作者： Li, Jianping Gao, Zhengqi Lv, Yansong Commun Univ China Sch Informat & Commun Engn Beijing Peoples R China

ISBN: (纸本)9781728143903

The polar codes proposed by Arikan is the first channel code proved to achieve the symmetric capacity of any binary input discrete memoryless channel (BDMC). Besides, the polar codes have been chosen for the eMBB control channels in the 5th generation mobile communication system. However, the successive cancellation flip (SCF) decoding algorithm of polar codes has a high average complexity at low SNR. To overcome the problem, the segmented SCF (SSCF) algorithm significantly has reduced the complexity of the SCF algorithm by using segmented cyclic redundancy check (CRC) bits. To further reduce the complexity, we have proposed a Gaussian approximation optimized SCF (G-SCF) decoding algorithm, which sets a threshold based on the Gaussian approximation algorithm to avoid unnecessary flip operations. Simulation results have shown that when the SNR is 1.5dB, the average complexity of the SSCF decoding algorithm is reduced by 14.4% compared with SSCF at (1024,512).

关键词： Polar codes decoding algorithm Gaussian approximation

来源：评论

学校读者我要写书评

暂无评论

A unified decoding algorithm for linear codes based on partitioned parity-check matrices

A unified decoding algorithm for linear codes based on parti...

引用

IEEE Information Theory Workshop

作者： Ma, Xiao Bai, Baoming Sun Yat Sen Univ Dept Elect & Commun Engn Guangzhou 510275 Guangdong Peoples R China Xidian Univ State Key Lab ISN Xian 710071 Peoples R China

ISBN: (纸本)9781424415632

In this paper, we propose a unified decoding algorithm for linear codes, named doubly extended sum-product algorithm (DESPA). The DESPA is described as a belief propagation algorithm over a generalized normal graph that represents the code based on a partitioned parity-check matrix. In one extreme case, the DESPA minimizes the frame-error-rate;while in another extreme case, the DESPA minimizes the bit-error-rate. In practice, the DESPA can be implemented to make trade-offs between decoding complexity and decoding performance.

关键词： check matrix linear codes decoding algorithm Belief propagation extreme case partitions decoding

来源：评论

学校读者我要写书评

暂无评论

Diagonal space time Hadamard codes with erasure decoding algorithm

Diagonal space time Hadamard codes with erasure decoding alg...

引用

IEEE Wireless Communications and Networking Conference

作者： Giustiniano, D Lusina, P Garbo, G Univ Palermo Dipartimento Ingn Elettr I-90133 Palermo Italy

ISBN: (纸本)0780389662

A major challenge in the area of the space time codes is to find codes suitable for efficient decoding, thus overcoming the problem of many existing space time code designs which require maximum-likelihood (NIL) decoding. A solution could be to apply Single-Input Single-Output (SISO) channel codes and theory over temporal channel fading to the Multi-Input Single-Output (MISO) code construction and classical suboptimum decoding methods. For these purposes, a space time code construction which allows the use of efficient decoding algorithms is described. We propose a concatenated code, where the inner code is the diagonal space time Hadamard (D-STH) code [11 [21 with Paley constructions and the outer code is an algebraic block code, such as a Reed-Solomon (RS) code. Our perspective is different than most existing concatenation type schemes, which destroy the inter-dependence of the outer channel code and the inner space time code by using an interleaver. As decoding method, we investigate bounded minimum distance (BMD) with erasure decoding algorithm. A simple method to achieve the optimum threshold for deciding on an erased symbol will be derived. Using that, the proposed concatenated scheme is able to exploit almost all of the spatial diversity of the system.

关键词： space-time codes Hadamard codes concatenated codes algebraic codes block codes Reed-Solomon codes decoding diagonal space time Hadamard code erasure decoding algorithm single-input single-output channel code multi-input single-output code construction concatenated code bounded minimum distance algorithm Paley constructions algebraic block code Reed-Solomon code erased symbol decision threshold spatial diversity Reed-Solomon codes Concatenated codes Hadamard codes spatial diversity decoding algebraic codes Block codes space-time codes Codes optimum threshold decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

A Novel HMM decoding algorithm Permitting Long-Term Dependencies and its Application to Handwritten Word Recognition 14

A Novel HMM Decoding Algorithm Permitting Long-Term Dependen...

引用

14th International Conference on Frontiers in Handwriting Recognition (ICFHR)

作者： Frinken, Volkmar Kakisako, Ryosuke Uchida, Seiichi Kyushu Univ Fac Informat Sci & Elect Engn Fukuoka 812 Japan

ISBN: (纸本)9781479943357

A new decoding for hidden Markov models is presented. As opposed to the commonly used Viterbi algorithm, it is based on the Min-CuUMax-Flow algorithm instead of dynamic programming. Therefore non-Markovian long-term dependencies can easily be added to influence the decoding path while still finding the optimal decoding in polynomial time. We demonstrate through an experimental evaluation how these constraints can be used to improve an HMM-based handwritten word recognition system that model words via linear character-HMM by restricting the length of each character.

关键词： Character recognition decoding Handwriting recognition Heuristic algorithms Hidden Markov models Training Viterbi algorithm Hidden Markov models Viterbi algorithm handwriting recognition decoding Character recognition Heuristic algorithms Functional training word recognition decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

decoding algorithm and BER Performance of Interference Alignment and Cancellation System in MIMO Networks

Decoding Algorithm and BER Performance of Interference Align...

引用

2011 the Iet 4th International Conference on Wireless,Mobile & Multimedia Networks(第四届无线、移动及多媒体网络国际会议 ICWMMN2011)

作者： Yang Xiao Yuanyuan Li Moon Ho Lee Institute of Information Science Beijing Jiaotong University Beijing 100044 China Division of Electronics and Information Engineering Chonbuk National University Jeonju 561-756 Ko

Interference alignment and cancelation (IAC) is a new approach for decoding concurrent transmitter-receiver pairs in MIMO networks. Recent studies on IAC system are focus on the throughput. However, the decoding algorithm and BER performance of IAC system remain to be solved. In this paper, we not only provide a decoding algorithm but also evaluate the bit error rate (BER) performance of it by simulation. The good BER results verify that the proposed decoding algorithm of IAC system is surely feasible.

关键词： interference alignment and cancelation (IAC) decoding algorithm bit error rate (BER) MIMO networks

来源：评论

学校读者我要写书评

暂无评论

On a decoding algorithm by superposition for binary cyclic codes for certain burst errors

引用

ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE 1996年第4期79卷 74-81页

作者： Ogino, A Kohnosu, T Hirasawa, S Nishijima, T WASEDA UNIV SCH SCI & ENGNTOKYO 169JAPAN HOSEI UNIV COLL ENGNKOGANEITOKYO 184JAPAN

Cyclic codes are often used for the purpose of correcting burst errors in digital transmission and recording systems. Since the implementations of the encoding and syndrome calculations of these codes are simple, these codes have superior properties from a practical perspective. In this paper, an effective decoding method is given for certain burst errors (multiple solid-burst errors) that are contained within the detected errors resulting from a binary cyclic ''predecoding'' process, where the precoding process for burst error correction is terminated at the detection stage. Such burst errors can be expressed as random errors by superimposing a copy of itself that has been cyclically shifted by one bit. So, by performing random error decoding on a version of the received sequence that has been superimposed with a one-bit cyclically shifted copy of itself, burst errors can be accurately corrected. This decoding method completely preserves the correction capacity of the precede and is applicable to any binary cyclic code with a minimum distance of at least 5. The correctable multiple solid-burst errors depend on the minimum distance of the code. Furthermore, by applying this technique to interleaved random error-correction codes for the purpose of correcting burst errors, it is shown that it is possible to extend the length of correctable burst errors.

关键词： cyclic codes decoding algorithm superposition method for decoding burst errors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：