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

International Symposium on Intelligent Multimedia, Video and Speech Processing

作者： Zhu, X Li, HS Lu, J Liu, RS Tsing Hua Univ Dept Elect Engn Beijing 100084 Peoples R China

ISBN: (纸本)9628576623

In this paper, a set of efficient decoding algorithms based on a Speaker Independent Mandarin Connected Digit Speech Recognition System is proposed. By simplifying the computation of observation probabilities and adopting improved beam search pruning algorithm combined with duration information, the average decoding time is reduced froth 0.92 second to 0.11 second per digit string while the recognition rate of unknown-length string is only decreased from 94.3% to 94.0%.

关键词： speech recognition speech coding search problems decoding decoding algorithms Mandarin connected digit speech recognition speaker independent recognition observation probabilities beam search pruning algorithm unknown-length string

来源：评论

学校读者我要写书评

暂无评论

Performances Analysis of Polar Codes decoding algorithms over Variant Binary-Input Channels 5

Performances Analysis of Polar Codes Decoding Algorithms ove...

引用

IEEE International Conference on Signal Processing, Communications and Computing ICSPCC 2015

作者： Xie, Wenjiao Tian, Ruifu Li, Lixin Bao, Tao Zhang, Huisheng Northwestern Polytech Univ Sch Elect & Informat Xian Peoples R China Shanghai Inst Aerosp Elect Technol Shanghai 201109 Peoples R China

ISBN: (纸本)9781479989201

In this paper, the performance of state of the art decoding methods of polar codes, such as the SC (Successive Cancellation), BP (belief propagation), LP (Linear Programming), LSC(List Successive Cancellation) and ML(Maximum Likelihood) decoding, over different binary-input discrete memoryless channels (B-DMCs) are presented. Simulation results indicate that decoding algorithms of polar codes have the performances of the estimated bit error rate (BER) below the order of 10-5. In addition, we came to the conclusion that BP algorithm outperforms SC at the cost of computational complexity. The performance of LP decoder is better than BP and the complexity is less than BP scheme, however, it can only be used in binary erasure channels (BECs). ML decoder has the best performance, but its high complexity makes it act as a reference to reveal the gap between ML and other algorithms. In order to remedy the performance deficiencies without any significant increase in decoding complexity, we further study the concatenated polar codes-the polar-LDPC(Low Density Parity Check) concatenation scheme, which is substantially outperforms ML decoding. What's more, the concatenated Polar-LDPC codes can remedy the error floor of LDPC codes. We firmly believed that the concatenated scheme of polar-LDPC would be a prominent technique in 5G (5th-generation) to support the more reliable transmission demand.

关键词： Polar codes decoding algorithms binary input channels error floor 5th-generation

来源：评论

学校读者我要写书评

暂无评论

Stealing the decoding algorithms of Language Models 23

Stealing the Decoding Algorithms of Language Models

引用

30th ACM SIGSAC Conference on Computer and Communications Security (ACM CCS)

作者： Naseh, Ali Krishna, Kalpesh Iyyer, Mohit Houmansadr, Amir Univ Massachusetts Amherst Amherst MA 01003 USA

ISBN: (纸本)9798400700507

A key component of generating text from modern language models (LM) is the selection and tuning of decoding algorithms. These algorithms determine how to generate text from the internal probability distribution generated by the LM. The process of choosing a decoding algorithm and tuning its hyperparameters takes significant time, manual effort, and computation, and it also requires extensive human evaluation. Therefore, the identity and hyperparameters of such decoding algorithms are considered to be extremely valuable to their owners. In this work, we show, for the first time, that an adversary with typical API access to an LM can steal the type and hyperparameters of its decoding algorithms at very low monetary costs. Our attack is effective against popular LMs used in text generation APIs, including GPT-2, GPT-3 and GPT-Neo. We demonstrate the feasibility of stealing such information with only a few dollars, e.g., $0.8, $1, $4, and $40 for the four versions of GPT-3.

关键词： Hyperparameter stealing language models decoding algorithms

来源：评论

学校读者我要写书评

暂无评论

Two decoding algorithms for Goppa Codes

Two Decoding Algorithms for Goppa Codes

引用

作者： Ochoa, Esperanza San Diego State University

学位级别：M.A., Master of Arts

The McEliece cryptographic system is one of the finalists of the second round of the NIST Post-Quantum Cryptography Standardization Process. As such, it will likely be used in many instances to ensure secure communications over the Internet when quantum computers become practical. The selection of the new system, which will replace the widely used RSA cryptographic system, should be announced by 2025. The McEliece cryptographic system is code-based, which means that it uses an error-correcting code as its basis, typically a Goppa code; it is the random insertion of errors in the original message that guarantees the security of the system. Presumably, only the legitimate user is capable of correcting those errors, thereby retrieving the message for which it is intended. As a result, an efficient decoding algorithm is required. In this work, we study two decoding algorithms for Goppa codes, namely, the Euclidean and Patterson, implement them in Magma, and compare their performances considering several code parameters. Lastly, a modification to Patterson's algorithm is proposed to handle certain cases where the Goppa polynomial is reducible.

关键词： decoding algorithms Goppa codes Quantum computing Coding theory Linear codes Cryptography

来源：评论

学校读者我要写书评

暂无评论

Low-Complexity decoding algorithms for Distributed Space-Time Coded Regenerative Relay Systems

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2012年第9期8卷 1-10页

作者： Zhang, Chao Yin, Huarui Xi An Jiao Tong Univ Sch Elect & Informat Engn Xian 710049 Peoples R China Univ Sci & Technol China Dept Elect Engn & Informat Sci Beijing Peoples R China

We examine decoding structure for distributed space-time coded regenerative relay networks. Given the possible demodulation error at the regenerative relays, we provide a general framework of error aware decoder, where the receiver exploits the demodulation error probability of relays to improve the system performance. Considering the high computational complexity of optimal Maximum Likelihood (ML) decoder, we also propose two low-complexity decoders, Max-Log decoder and Max-Log-Sphere decoder. Computational complexities of these three decoders are also analyzed. Simulation results show that error aware decoders can improve system performance greatly without high system overload and Max-Log decoder and Max-Log-Sphere decoder can drastically reduce the decoding complexity with negligible performance degradation.

关键词： decoding algorithms SPACE & time ELECTRIC relays COMPUTATIONAL complexity ERROR probability PERFORMANCE evaluation

来源：评论

学校读者我要写书评

暂无评论

Research on Encoding and decoding algorithms of LDPC Codes

Research on Encoding and Decoding Algorithms of LDPC Codes

引用

2017 2nd International Conference on Materials Science,Machinery and Energy Engineering(MSMEE 2017)

作者： Yifeng He Zhemin Duan Electronic Information College Northwestern Polytechnical University

The LDPC code, namely low density parity check code, is essentially a linear block code. Its decoding performance is closer to the Shannon limit than the Turbo code. The definition and description of LDPC codes are introduced in this paper. LDPC coding method includes the Algorithm of LU decomposable encoding and the algorithm of partitioned iterated encoding. the algorithm of message passing, the algorithm of minimum-sum decoding and the algorithm of bit-flipping decoding are the common decoding algorithms of the LDPC codes. The concept and features of the encoding and decoding algorithms are explored in this paper to provide some references for the relative researchers.

关键词： Encoding algorithms decoding algorithms LDPC codes

来源：评论

学校读者我要写书评

暂无评论

Quaternary Neural Belief Propagation decoding of Quantum LDPC Codes With Overcomplete Check Matrices

引用

IEEE ACCESS 2025年 13卷 25637-25649页

作者： Miao, Sisi Schnerring, Alexander Li, Haizheng Schmalen, Laurent Karlsruhe Inst Technol KIT Commun Engn Lab CEL D-76187 Karlsruhe Germany German Aerosp Ctr DLR Inst Solar Res Almeria 04005 Spain

Quantum low-density parity-check (QLDPC) codes are promising candidates for error correction in quantum computers. One of the major challenges in implementing QLDPC codes in quantum computers is the lack of a universal decoder. In this work, we first propose to decode QLDPC codes with a belief propagation (BP) decoder operating on overcomplete check matrices. Then, we extend the neural BP (NBP) decoder, which was originally studied for suboptimal binary BP decoding of QLPDC codes, to quaternary BP decoders. Numerical simulation results demonstrate that both approaches as well as their combination yield a low-latency, high-performance decoder for several short to moderate length QLDPC codes.

关键词： Quantum error correction quantum low-density parity-check codes neural networks neural networks channel coding channel coding decoding algorithms decoding algorithms decoding algorithms

来源：评论

学校读者我要写书评

暂无评论

Channel-Aware Gradient Descent Bit-Flipping Algorithm for LDPC Codes

引用

IEEE COMMUNICATIONS LETTERS 2025年第4期29卷 809-813页

作者： Min, Woohong Yang, Kyeongcheol Pohang Univ Sci & Technol POSTECH Dept Elect Engn Pohang Si 37673 Gyeongsangbuk D South Korea

The gradient descent bit-flipping with momentum (GDBF-w/M) and probabilistic GDBF-w/M (PGDBF-w/M) algorithms significantly improve the decoding performance of the bit-flipping (BF) algorithm. In this letter, we propose a channel-aware GDBF-w/M algorithm which operates deterministically based on the received values from the additive white Gaussian noise (AWGN) channel. Numerical results show that the proposed algorithm does not only mitigate the error-floor phenomenon of the GDBF-w/M algorithm, but it also has better decoding performance than the PGDBF-w/M algorithm without the need for a random number generator. Furthermore, the complexity of the proposed algorithm is slightly higher than that of the GDBF-w/M algorithm.

关键词： decoding Probabilistic logic Iterative decoding Vectors AWGN channels Indexes Training Reliability Optimization Maximum likelihood decoding LDPC codes bit-flipping algorithm decoding algorithms

来源：评论

学校读者我要写书评

暂无评论

Multiple channel error-correction algorithms for LCC decoding of Reed-Solomon codes and its high-speed architecture design

引用

IET COMMUNICATIONS 2017年第9期11卷 1407-1415页

作者： Wang, Lingyu Zhang, Wei Wang, Yang Hu, Yan Liu, Yanyan Tianjin Univ Sch Elect Informat Engn Tianjin 300072 Peoples R China Nankai Univ Coll Elect Informat & Opt Engn Tianjin 300071 Peoples R China

Reed-Solomon (RS) code is one of the most widely used error control codes. The decoding algorithms of RS code can be briefly divided into hard-decision decoding (HDD) and algebraic soft-decision decoding (ASD). However, traditional RS decoding algorithms perform unsatisfactorily over bursty channel. Therefore, many modified RS decoding algorithms utilised in bursty channel decoding were proposed. However all of them are HDD and the computation is costly. In this study, the authors propose an ASD algorithm which can be utilised both in additive white Gaussian noise channel and bursty channel. In order to be utilised in multiple channel, the proposed algorithm combines original HDD-based low-complexity chase (HDD-LCC) and burst-error correcting (BC) together. What's more, BC is also modified by adding in the mechanism of pre-judgement to reduce the iterations of BC. The modified algorithm can give a coding gain reaching up to 0.1268 and 1.33dB compared with BC and HDD-LCC, respectively when symbol error rate (SER) is 10(-4) in bursty channel. The proposed RS decoder is implemented and synthesised with Semiconductor Manufacturing International Corporation 0.13-m CMOS technology library. The results show the proposed decoder can operate at 200MHz to achieve the throughput of 1.673Gbps.

关键词： Reed-Solomon codes error correction codes channel coding Gaussian channels multiple channel error correction algorithms LCC decoding Reed-Solomon codes high-speed architecture design RS code error control codes decoding algorithms hard-decision decoding HDD algebraic soft-decision decoding ASD RS decoding algorithms bursty channel bursty channel decoding additive white Gaussian noise channel Semiconductor Manufacturing International Corporation CMOS technology library

来源：评论

学校读者我要写书评

暂无评论

FAST PARALLEL algorithms FOR decoding REED-SOLOMON CODES BASED ON REMAINDER POLYNOMIALS

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1995年第4期41卷 873-885页

作者： DABIRI, D BLAKE, IF Univ of Waterloo Waterloo Ont Can

The problem of decoding cyclic error correcting codes is one of solving a constrained polynomial congruence, often achieved using the Berlekamp-Massey or the extended Euclidean algorithm on a key equation involving the syndrome polynomial. A module-theoretic approach to the solution of polynomial congruences is developed here using the notion of exact sequences. This technique is applied to the Welch-Berlekamp key equation for decoding Reed-Solomon codes for which the computation of syndromes is not required. It leads directly to new and efficient parallel decoding algorithms that can be realized with a systolic array. The architectural issues for one of these parallel decoding algorithms are examined in some detail.

关键词： REED-SOLOMON CODES decoding algorithms SYSTOLIC ARRAYS WELCH-BERLEKAMP EQUATIONS MODULES

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：