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

Novel memory efficient LDPC decoders for beyond 5G

PHYSICAL COMMUNICATION 2022年 51卷

作者： Li, Hongyuan Yu, Zhenghong Lu, Tongwei Zheng, Wanjun Feng, Haijie Ma, Ziqian Zhu, Fusheng Guangdong Polytech Sci & Technol Coll Robot Zhuhai 519090 Peoples R China Wuhan Inst Technol Hubei Key Lab Intelligent Robot Wuhan 430073 Peoples R China Guangdong New Generat Commun & Network Innovat In Guangzhou Peoples R China

Beyond-5G wireless networks are expected to gain a excellent trade-off among computational accuracy, latency, and efficient use of available resources. This poses a significant challenge to the channel decoder. In this paper, a novel memory efficient algorithm for decoding Low-Density Parity-Check (LDPC) codes is proposed with a view to reduce the implementation complexity and hardware resources. The algorithm, called Check Node Self-Update (CNSU) algorithm, is based on layered normalized min sum (LNMS) decoding algorithm while utilizing iteration parallel techniques to integrate both Variable Nodes (VNs) message and A-Posterior Probability(APP) message into the Check Nodes (CNs) message, which eliminates memories of both the VNs message and the APP message as well as updating module of APP message in CNs unit. Based on the proposed CNSU algorithm, design of partially parallel decoder architecture and serial simulations followed by implementation on the Stratix II EP2S180 FPGA are presented. The results show that the proposed algorithm and implementation bring a significant gain in efficient using of available resources, include reducing hardware memory resources and chip area while keeping the benefit of bit-error-rate (BER) performance and speeding up of convergence with LNMS, which are beneficial to apply in Beyond-5G wireless networks. (C) 2021 Published by Elsevier B.V.

关键词： Low density parity check (LDPC) decoding algorithm FPGA implementation Memory efficient Beyond 5G

来源：评论

学校读者我要写书评

暂无评论

Depth Measurement Based on Infrared Coded Structured Light

引用

JOURNAL OF SENSORS 2014年第1期2014卷

作者： Jia, Tong Zhou, Zhong Xuan Gao, Hai Hong Northeastern Univ Coll Informat Sci & Engn Shenyang 110819 Peoples R China

Depth measurement is a challenging problem in computer vision research. In this study, we first design a new grid pattern and develop a sequence coding and decoding algorithm to process the pattern. Second, we propose a linear fitting algorithm to derive the linear relationship between the object depth and pixel shift. Third, we obtain depth information on an object based on this linear relationship. Moreover, 3D reconstruction is implemented based on Delaunay triangulation algorithm. Finally, we utilize the regularity of the error curves to correct the system errors and improve the measurement accuracy. The experimental results show that the accuracy of depth measurement is related to the step length of moving object.

关键词： Sequence coding structured light accuracy of measurement pixel step size Infrared radiation computer vision decoding algorithm mesh generation three-dimensional displays Depth measurement linear relation

来源：评论

学校读者我要写书评

暂无评论

Review of brain-computer interface based on steady-state visual evoked potential

引用

Brain Science Advances 2022年第4期8卷 258-275页

作者： Siyu Liu Deyu Zhang Ziyu Liu Mengzhen Liu Zhiyuan Ming Tiantian Liu Dingjie Suo Shintaro Funahashi Tianyi Yan School of Life Science Beijing Institute of TechnologyBeijing 100081China School of Mechanical and Electrical Engineering Beijing Institute of TechnologyBeijing 100081China Advanced Research Institute of Multidisciplinary Science Beijing Institute of TechnologyBeijing 100981China Kyoto University Yoshida-honmachi 606-8501Kyoto-ShiJapan

The brain-computer interface(BCI)technology has received lots of attention in the field of scientific research because it can help disabled people improve their quality of ***-state visual evoked potential(SSVEP)is the most researched BCI experimental paradigm,which offers the advantages of high signal-to-noise ratio and short training-time requirement by *** a complete BCI system,the two most critical components are the experimental paradigm and decoding ***,a systematic combination of the SSVEP experimental paradigm and decoding algorithms is missing in existing *** the present study,the transient visual evoked potential,SSVEP,and various improved SSVEP paradigms are compared and analyzed,and the problems and development bottlenecks in the experimental paradigm are finally pointed ***,the canonical correlation analysis and various improved decoding algorithms are introduced,and the opportunities and challenges of the SSVEP decoding algorithm are discussed.

关键词： steady-state visual evoked potential brain–computer interface canonical correlation analysis decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

AN IMPROVED SOVA-BASED decoding SCHEME FOR TURBO-STCM

引用

Transactions of Nanjing University of Aeronautics and Astronautics 2003年第1期20卷 108-111页

作者：李颖慧徐大专南京航空航天大学信息科学与技术学院

Parallel concatenated spa ce time trellis code modulation, called Turbo STCM, can efficiently increase the coding gains of the space time codes. However, the complexity of the iterat iv e decoding restricts its application. This paper introduces a lower complex deco ding algorithm based on soft output Viterbi algorithm (SOVA) for Turbo STCM. S imulational results show that the new SOVA algorithm for the Turbo STCM outperf orms the original space time trellis code (STTC) by 4~6 dB. At the same time, compared with the Max Log MAP (maximum a posteriori) algorithm, the new scheme requires a lower complexity and approaches the performance of Turbo STCM decod ing w ith Max Log MAP.

关键词： decoding algorithm spa ce time trellis codes SOVA algorithm

来源：评论

学校读者我要写书评

暂无评论

Securing Digital Data: A New Edge Detection and XOR Coding Approach for Imperceptible Image Steganography

引用

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2023年第11期14卷 1214-1220页

作者： Al-Dmour, Hayat Mutah Univ Fac Informat Technol Mutah Karak Jordan

The rapid progress of digital devices and technology, coupled with the emergence of the internet has amplified the risks and perils associated with malicious attacks. Consequently, it becomes crucial to protect valuable information transmitted through the internet. Steganography is a tried-and-true technique for hiding information beneath digital content, such as pictures, texts, audio, and video. Various methodologies of image steganography have been developed recently. In image recognition, edge detection secures an image into well-defined areas. This paper introduces a novel image steganography algorithm with edge detection and XOR coding techniques. The proposed approach aims to conceal a confidential message within the spatial domain of the original image. In contrast to uniform regions, the Human Visual System (HVS) is less responsive to variations in the sharp areas;an edge detection algorithm is applied to identify edge pixels. Furthermore, to enhance the efficiency and reduce the embedding impact, XOR operation has been utilized to embed the secret message in the Least Significant Bit (LSB). According to the results of the experiments, the proposed method embeds confidential data without causing noticeable modifications to the stego image. The proposed method system produced imperceptible stego images with minimal embedding distortions compared to existing methods. Based on the results, the proposed approach outperforms the conventional methods regarding image distortion techniques. The PSNR values achieved by the proposed method are higher than the acceptable level.

关键词： Steganography information hidings bits modification decoding algorithm edge detection canny edge detection human visual system

来源：评论

学校读者我要写书评

暂无评论

Generalized Higher-Order Dependency Parsing with Cube Pruning 12

Generalized Higher-Order Dependency Parsing with Cube Prunin...

引用

Conference on Empirical Methods in Natural Language Processing

作者： Hao Zhang Ryan McDonald Google Inc.

ISBN: (纸本)9781622765034

State-of-the-art graph-based parsers use features over higher-order dependencies that rely on decoding algorithms that are slow and difficult to generalize. On the other hand, transition-based dependency parsers can easily utilize such features without increasing the linear complexity of the shift-reduce system beyond a constant. In this paper, we attempt to address this imbalance for graph-based parsing by generalizing the Eisner (1996) algorithm to handle arbitrary features over higher-order dependencies. The generalization is at the cost of asymptotic efficiency. To account for this, cube pruning for decoding is utilized (Chiang, 2007). For the first time, label tuple and structural features such as valencies can be scored efficiently with third-order features in a graph-based parser. Our parser achieves the state-of-art unlabeled accuracy of 93.06% and labeled accuracy of 91.86% on the standard test set for English, at a faster speed than a reimplementation of the third-order model of Koo et al. (2010).

关键词： Parser Parsing decoding Cube higher-order test standards tree surgery Structural properties English Valence English language Generalization fast speed decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Sublinear Time, Measurement-Optimal, Sparse Recovery For All 12

Sublinear Time, Measurement-Optimal, Sparse Recovery For All

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms

作者： Ely Porat Martin J. Strauss Bar Ilan University University of Michigan

ISBN: (纸本)9781611972108

An approximate sparse recovery system in l_1 norm makes a small number of measurements of a noisy vector with at most k large entries and recovers those heavy hitters approximately. Formally, it consists of parameters N, k, ε, an m-by-N measurement matrix, φ, and a decoding algorithm, D. Given a vector, x, where x_k denotes the optimal k-term approximation to x, the system approximates x by {top}x = D(φx), which must satisfy ‖x{top}^ - x‖_1 ≤ (1 + ε) ‖x - x_k‖_1. Among the goals in designing such systems are minimizing the number m of measurements and the runtime of the decoding algorithm, D. We consider the "forall" model, in which a single matrix φ, possibly "constructed" non-explicitly using the probabilistic method, is used for all signals x.

关键词： decoding algorithm sublinear system recovery mechanical heart valve K CORRECTION Runtime measurement matrix deuterium ABSORBED DOSE

来源：评论

学校读者我要写书评

暂无评论

A Quantization Schema with Negligible Degradation for LDPC Decoder

A Quantization Schema with Negligible Degradation for LDPC D...

引用

2010 IEEE International Conference Conferenhce on Wireless Communications,Networking and Information Security(2010 IEEE 无线通信、网络技术与信息安全国际会议 WCNIS)

作者： Ming-Qiu Wang Shu-Tao Xia He-Guang Su Lai-Zhong Cui Graduate School at Shenzhen Tsinghua University Guangdong China

A quantization schema with negligible degradation for LDPC decoder is proposed. It’s based on the decoding algorithm deduced from Belief Propagation algorithm on LLR. The schema offers a quantization criterion for iteration decoder, based on the study of channel outputs. The schema is adaptable for different channel status and quantization scale. Static step lengths for hardware implementation are selected according to the proposed criterion. The performance of the proposed schema is illustrated by both structured and random codes. In simulations for 6-bits quantization, performance loss is negligible. And the schema produces less than 0.01dB degradation for 5-bits quantization above 10?5 BER and about 0.1dB for 4-bits quantization. There is no error floor of BER even around 10?7. Simulations show the coverage plays an important role in quantization process. The results of static step lengths are as good as or even better than those of the variable step lengths.

关键词： channel coding decoding algorithm quantization LDPC

来源：评论

学校读者我要写书评

暂无评论

Hardware decoders for polar codes: An overview

Hardware decoders for polar codes: An overview

引用

International Symposium on Circuits and Systems

作者： Pascal Giard Gabi Sarkis Alexios Balatsoukas-Stimming YouZhe Fan Chi-ying Tsui Andreas Burg Claude Thibeault Warren J. Gross Dept. of Electr. and Comput. Eng. McGill Univ. Montreal Quebec Canada Telecommun. Circuits Lab. EPFL Lausanne Switzerland Dept. of Electron. and Comput. Eng. Hong Kong Univ. of Sci. and Technol. Hong Kong China Dept. of Electr. Eng. Ecole de technologie superieure Montreal Quebec Canada

ISBN: (纸本)9781479953424

Polar codes are an exciting new class of error correcting codes that achieve the symmetric capacity of memoryless channels. Many decoding algorithms were developed and implemented, addressing various application requirements: from error-correction performance rivaling that of LDPC codes to very high throughput or low-complexity decoders. In this work, we review the state of the art in polar decoders implementing the successive-cancellation, belief propagation, and list decoding algorithms, illustrating their advantages.

关键词： Polar code state of the art error correction New classes decoders low density parity check codes decoding algorithm Memoryless channel list decoding Error correction codes

来源：评论

学校读者我要写书评

暂无评论

Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized 08

Uniform Direct Product Theorems: Simplified, Optimized, and ...

引用

ACM Symposium on Theory of Computing

作者： Russell Impagliazzo Ragesh Jaiswal Avi Wigderson Valentine Kabanets UC San Diego La Joila Institute of Advanced Studies Princeton Simon Fraser University

ISBN: (纸本)9781605604657

The classical Direct-Product Theorem for circuits says that if a Boolean function f : {0, l}~n→ {0,1} is somewhat hard to compute on average by small circuits, then the corresponding kwise direct product function f~k (x_1;...,x_k) = (f(s_1),...,f(x_k)) (where each x_i ∈ {0, l}~n) is significantly harder to compute on average by slightly smaller circuits. We prove a fully uniform version of the Direct-Product Theorem with information-theoretically optimal parameters, up to constant factors. Namely, we show that for given k and ε, there is an efficient randomized algorithm A with the following property. Given a circuit C that computes f~k on at least ε fraction of inputs, the algorithm A outputs with probability at least 3/4 a list of 0(1/ε) circuits such that at least one of the circuits on the list computes f on more than 1 - δ fraction of inputs, for δ = O((log1/ε)/k). Moreover, each output circuit is an AC~0 circuit (of size poly(n, k, log 1/δ,1/ε)), with oracle access to the circuit C. Using the Goldreich-Levin decoding algorithm [5], we also get a fully uniform version of Yao's XOR Lemma [18] with optimal parameters, up to constant factors. Our results simplify and improve those in [10]. Our main result may be viewed as an efficient approximate, local, list-decoding algorithm for direct-product codes (encoding a function by its values on all k-tuples) with optimal parameters. We generalize it to a family of "derandomized" direct-product codes, which we call intersection codes, where the encoding provides values of the function only on a subfamily of k-tuples. The quality of the decoding algorithm is then determined by sampling properties of the sets in this family and their intersections. As a direct consequence of this generalization we obtain the first derandomized direct product result in the uniform setting, allowing hardness amplification with only constant (as opposed to a factor of k) increase in the input length. Finally, this general setting naturally a

关键词： Direct Product Theorem Direct Product Code XOR Code Codes Theorem Intersection Mentoring Concatenated codes optimal parameter Uniforms Uniform foreign key decoding algorithm Electric circuits

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：