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

18th IEEE International Conference on Intelligent Transportation Systems

作者： Yalla, Veera Ganesh Pillai, Preeti J. Oguchi, Kentaro Toyota InfoTechnol Ctr USA Intelligent Comp Div Mountain View CA USA

ISBN: (纸本)9781467365963

In this paper, we present the concept of "Ease of Driving" or EoD rating for road scene environment. We introduce the Classification by Holistic Analysis of Scene Environment (chase) algorithm to automatically classify the EoD rating using computer vision and machine learning techniques. With the chase algorithm we were able to achieve an accuracy of 86.84 % to classify the EoD. In the near future, EoD information will be used to create better navigation services to improve the driving comfort and mobility by leveraging the existing camera sensors in the car.

关键词： Ease of Driving EoD Classification by Holistic Analysis of Scene Environment chase algorithm Navigation Mobility

来源：评论

学校读者我要写书评

暂无评论

Low-Complexity Decoding of Block Turbo Codes Based on the chase algorithm

引用

IEEE COMMUNICATIONS LETTERS 2017年第4期21卷 706-709页

作者： Son, Jaeyong Cheun, Kyungwhoon Yang, Kyeongcheol Pohang Univ Sci & Technol POSTECH Dept Elect Engn Pohang 37673 Gyeongbuk South Korea Samsung Elect Co Ltd Memory Business Controller Dev Team Suwon 16677 Gyeonggi South Korea Samsung Elect Co Ltd Mobile Commun Business Commun Res Grp Suwon 16677 Gyeonggi South Korea

Block turbo codes (BTCs) are constructed by serially concatenating linear block codes and iteratively decoded by letting each component code be decoded in two stages. The chase algorithm is employed in the first stage to make a list of candidate codewords by generating a fixed number of test sequences (TSs) and algebraically decoding them, regardless of the signal-to-noise ratio or the iteration number. In the second stage, the extrinsic information is generated for iterative decoding. In this letter, we propose a low-complexity decoding algorithm for BTCs. The proposed algorithm first checks whether an algebraic hard-decision decoder outputs a codeword for a given decoder input vector, and then adaptively applies one of the two estimation rules. Based on these two rules, the number of TSs in the proposed algorithm can be made monotonically decreasing with iterations. Numerical results demonstrate that the proposed algorithm has much lower computational complexity with a negligible performance loss, compared with the conventional decoding scheme based on the chase algorithm.

关键词： Adaptive decoding algorithm block turbo codes (BTCs) chase algorithm decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Half-chase algorithm of non-soft decision decoding based on majority

Half-chase algorithm of non-soft decision decoding based on ...

引用

9th International Conference on Advanced Communication Technology (ICACT 2007)

作者： Kuo, Chun-Fong Lai, Hsin-Kun Lu, Erl-Huei Chang Gung University Chin Min Institute of Technology Taiwan

ISBN: (纸本)9788955191318

A non-soft decision decoding algorithm for binary linear block codes transmitted over AWGN channel is presented. Unlike soft decision decoding algorithms, the proposed algorithm does not computing weighted Hamming distances. Based on the majority of code word candidates from the hard decision decoding output, the proposed algorithm improves error-correcting performance by 1dB of coding gain compared to that of hard decision decoding algorithms. Also, a schematic block diagram for finding the code word of majority is developed. Furthermore, a comparison of hardware complexity is made between the computation of weighted Hamming distances and the finding of majority code word.

关键词： majority soft decision decoding chase algorithm coding gain weighted Hamming distance

来源：评论

学校读者我要写书评

暂无评论

Iterative decoding for the concatenation of LDPC codes and BCH codes based on chase algorithm

Iterative decoding for the concatenation of LDPC codes and B...

引用

6th International Conference on ITS Telecommunications Proceedings

作者： Shi, Zhiping Zhou, Liang Wen, Hong Li, Shaoqian Univ Elect Sci & Technol China Natl Key Lab Commun Chengdu 610054 Peoples R China Southeast Univ Natl Mobile Commun Res Lab Dhaka Bangladesh

ISBN: (纸本)0780395867

In this paper, an iterative joint decoding algorithm for low density parity check codes with BCH codes based on chase algorithm is proposed. After a certain number of iterations, the soft output values delivered by belief propagation algorithm of LDPC codes are used as reliability values to perform chase decoding of BCH codes. And BCH decoder also will return soft information to LDPC decoder as input. This approach presents an option scheme for LDPC with medium length because of the relevant presence of short loops. It allows to bridge the gap between error performance and maximum likelihood decoding. Simulation result for the scheme is given.

关键词： chase algorithm LDPC codes BCH codes

来源：评论

学校读者我要写书评

暂无评论

Multistage parallel interference cancellation based on chase algorithm

Multistage parallel interference cancellation based on Chase...

引用

2nd IEEE International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2006)

作者： Feng, Liu Soleymani, M. Reza Concordia Univ Dept Elect & Comp Engn Wireless & Satellite Commun Lab Montreal PQ H3G 1M8 Canada

ISBN: (纸本)9781424405169

A key issue in a multistage parallel interference cancellation (PIC) scheme is to improve the hard decision accuracy after matched filters (MFs). For achieving this pill-pose, most PIC schemes focus oil choosing the suitable weight for each user in each stage bill keeping the hard decision values after MFs intact. This paper presents a new PIC scheme that uses chase algorithm [5] to edit the possible hard decision combinations and selects the one minimizing a cost function as the final hard decision result for performing the inteiference cancellation. Peiforinance and complexity comparisons are presented aniong chase-PIC, norniahied least-ineansquare adaptive multistage PIC (7VLMS-PIC) scheines [4] and their variants. A new PIC scheme using NLMS as the earlier stages and chase in the later stages is proposed, which call achieve a better peiforinance than multistage NLMS-PIC but with lower complexity.

关键词： parallel interference cancellation CDMA multi-user detection chase algorithm

来源：评论

学校读者我要写书评

暂无评论

A chase-GMD algorithm for soft-decision decoding of Reed-Solomon codes on perpendicular recording channels

A Chase-GMD algorithm for soft-decision decoding of Reed-Sol...

引用

IEEE International Conference on Communications (ICC 2008)

作者： Xia, Haitao Wang, Han Cruz, J. R. Link A Media Devices Corp Santa Clara CA 95051 USA Univ Oklahoma Sch Elect & Comp Engn Norman OK 73019 USA

ISBN: (纸本)9781424420742

We propose a soft-decision Reed-Solomon (RS) decoding algorithm, which uses the combined approaches of the chase and the generalized minimum distance (CMD) algorithms and exploits the recursive property of interpolation-based RS decoding algorithms. We evaluate the performance of this chase-CMD type algorithm on perpendicular magnetic recording systems, and present simulation results that show that we can achieve better performance with fairly short latency and lower decoding complexity than the current state-of-art algorithms.

关键词： chase algorithm generalized minimum distance algorithm Guruswami-Sudan algorithm Koetter-Vardy algorithm list decoding perpendicular magnetic recording channels polynomial interpolation Reed-Solomon codes reliability-based decoding soft-decision decoding

来源：评论

学校读者我要写书评

暂无评论

Multistage Parallel Interference Cancellation Based on chase algorithm

Multistage Parallel Interference Cancellation Based on Chase...

引用

2nd International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2006), vol.1

作者： Liu Feng M. Reza Soleymani Wireless and Satellite Communications Lab Department of Electrical and Computer Engineering Concordia University Montreal QUE Canada

A key issue in a multistage parallel interference cancellation (PIC) scheme is to improve the hard decision accuracy after matched filters (MFs). For achieving this purpose, most PIC schemes focus on choosing the suitable weight for each user in each stage but keeping the hard decision values after MFs intact. This paper presents a new PIC scheme that uses chase algorithm [5] to edit the possible hard decision combinations and selects the one minimizing a cost function as the final hard decision result for performing the interference cancellation. Performance and complexity comparisons are presented among chase-PIC, normalized least-mean-square adaptive multistage PIC (NLMS-PIC) schemes [4] and their variants. A new PIC scheme using NLMS as the earlier stages and chase in the later stages is proposed, which can achieve a better performance than multistage NLMS-PIC but with lower complexity.

关键词： Parallel interference cancellation CDMA Multi-user detection chase algorithm

来源：评论

学校读者我要写书评

暂无评论

A novel turbo product code decoder architecture with a compact candidate code set

引用

PHYSICAL COMMUNICATION 2025年 68卷

作者： Liang, Xianming Yan, Jin Gong, Kexian Sun, Peng Xie, Zhaoyan Southwest China Inst Elect Technol Beijing Peoples R China Zhengzhou Univ Sch Elect & Informat Engn Zhengzhou 450001 Peoples R China

We propose a high-efficiency, low-complexity turbo product code (TPC) decoder. A criterion is designed to reduce the candidate code set size, retaining the most effective candidate codewords based on their Euclidean distances. A novel method for calculating extrinsic information is proposed to compensate for performance loss due to the reduced candidate code set. The decoder's top-level architecture is also improved, allocating hardware resources in an interleave-like manner to avoid memory conflicts. Simulation results show that the proposed algorithm achieves significant performance gains and consumes less hardware resources. The decoder's throughput in the new architecture can reach 1.371 Gbps.

关键词： Turbo product code Soft decoding chase algorithm Memory conflict Hardware architecture

来源：评论

学校读者我要写书评

暂无评论

Performance of a chase-type decoding algorithm for Reed-Solomon codes on perpendicular magnetic recording channels

引用

JOURNAL OF MAGNETISM AND MAGNETIC MATERIALS 2008年第22期320卷 3124-3127页

作者： Wang, H. Chang, W. Cruz, J. R. Univ Oklahoma Sch Elect & Comp Engn Norman OK 73019 USA

Algebraic soft-decision Reed-Solomon (RS) decoding algorithms with improved error-correcting capability and comparable complexity to standard algebraic hard-decision algorithms could be very attractive for possible implementation in the next generation of read channels. In this work, we investigate the performance of a low-complexity chase (LCC)-type soft-decision RS decoding algorithm, recently proposed by Bellorado and Kavcic, on perpendicular magnetic recording channels for sector-long RS codes of practical interest. Previous results for additive white Gaussian noise channels have shown that for a moderately long high-rate code, the LCC algorithm can achieve a coding gain comparable to the Koetter-Vardy algorithm with much lower complexity. We present a set of numerical results that show that this algorithm provides small coding gains, on the order of a fraction of a dB, with similar complexity to the hard-decision algorithms currently used, and that larger coding gains can be obtained if we use more test patterns, which significantly increases its computational complexity. (C) 2008 Elsevier B. V. All rights reserved.

关键词： Koetter-Vardy algorithm Algebraic soft-decision decoding Reed-Solomon code Perpendicular magnetic recording channel chase algorithm

来源：评论

学校读者我要写书评

暂无评论

Fast chase algorithms for Decoding Reed-Solomon Codes

Fast Chase Algorithms for Decoding Reed-Solomon Codes

引用

3rd International Symposium on Next-Generation Electronics (ISNE)

作者： Chu, Shao-I Chen, Yan-Haw Chiu, Yi-Chan Chang, Ru-Sian Natl Kaohsiung Appl Sci Dept Elect Engn Kaohsiung Taiwan I Shou Univ Dept Informat Engn Kaohsiung Taiwan

ISBN: (纸本)9781479947805

This paper presented the modified chase algorithms to improve the decoding time by reducing the number of candidate codewords. Generally speaking, the candidate codewords will increase with the error correction capability of the code. This fact leads to decoding complexity. The innovations of the proposed algorithm lie in the two-step reliability information selection. Simulation results showed the decoding time of the new scheme is significantly improved, while the error correction performance is almost the same as compared with the conventional chase-2 algorithm.

关键词： Reed-Solomon code chase algorithm reliability soft-decision decoding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：