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

Computer and Computing Technologies in Agriculture II——the Second IFIP International Conference(CCTA2008) Part II

作者： Ming Sun Longsheng Fu Shuqing Han College of Information and Electrical Engineering China Agricultural University

The purpose of this research is to develop software to optimize the data compression of a PDF417 barcode using VC++*** to the different compression mode and the particularities of Chinese,the relevant approaches which optimize the encoding algorithm of data compression such as spillage and the Chinese characters encoding are proposed,a simple approach to compute complex polynomial is *** the whole data compression is finished,the number of the codeword is reduced and then the encoding algorithm is *** developed encoding system of PDF417 barcodes will be applied in the logistics management of fruits,therefore also will promote the fast development of the two-dimensional bar codes.

关键词： Two-dimensional barcode PDF417 encoding algorithm visual C++6.0

来源：评论

学校读者我要写书评

暂无评论

Efficient encoding and decoding algorithm for triangular discrete global grid based on Hybrid Transformation Strategy

引用

COMPUTERS ENVIRONMENT AND URBAN SYSTEMS 2018年 68卷 110-120页

作者： Zhou, Liangchen Lian, Wenjie Lv, Guonian Zhu, A-Xing Lin, Bingxian Nanjing Normal Univ Minist Educ Key Lab Virtual Geog Environm Nanjing 210023 Jiangsu Peoples R China State Key Lab Cultivat Base Geog Environm Evolut Nanjing 210023 Jiangsu Peoples R China Jiangsu Ctr Collaborat Innovat Geog Informat Reso Nanjing 210023 Jiangsu Peoples R China Univ Wisconsin Madison Deportment Geog Madison WI 53706 USA

Grid codes are an important part of a grid system and provide a unique identifier for the cells in the spherical triangular discrete global grid, where the transformation between geographic coordinates and grid codes is the basis of global spatial data integration and various analytical applications. Owing to the particularity of the topological properties, the spherical space cannot be continuously paved with the same grid cells as those in the plane space. Thus, the recursive approximation method is typically used to establish the transformation algorithm between the geographic coordinates and the grid codes. The efficiency of those algorithms that were based on recursive approximation obviously decreased with the increased grid subdivision level;thus, it is not conducive to the integration of massive high-resolution spatial data. Whereas the geometric properties of the grid cells in the spherical triangular discrete global grid differ during the initial subdivision levels, as the level increases, these geometric properties tend to be the same, along with the properties of the local regions similar to the plane. Considering this characteristic, this paper proposes a hybrid bidirectional transformation algorithm. In the proposed algorithm, the recursive approximation method is used at the lower level where there is a large difference in the geometrical properties of the grid cells, and the direct mapping method using a similar plane grid is used at the higher level where the geometrical properties of the grid cells are virtually the same. In experiments conducted using the proposed algorithm with geographic coordinates at different scales and grid codes at different levels, the running time remained stable with no significant change throughout increases in the hierarchical level. Further, it was proven to satisfy the requirements of the absolute accuracy evaluation method. Compared with the traditional recursive approximation algorithm, the proposed algorithm has o

关键词： Decoding algorithm encoding algorithm Discrete global grid Icosahedron Triangular discrete global grid

来源：评论

学校读者我要写书评

暂无评论

encoding algorithms for 2 dimensional run-length-limited constraints

Encoding algorithms for 2 dimensional run-length-limited con...

引用

IEEE International Symposium on Information Theory

作者： Kamabe, H Gifu Univ Dept Informat Gifu 5011193 Japan

We give lower bounds of the capacities of 2-dimensional Run-Length-Limited (RLL) constraints. We also present a coding algorithm for encoding data sequences into two-dimensional binary arrays satisfying a (1, 2)-RLL c... 详细信息

ISBN: (纸本)0780382803

关键词： runlength codes binary sequences matrix algebra encoding algorithm RLL constraint 2D run-length-limited constraint lower bound data sequence encoding two-dimensional binary array

来源：评论

学校读者我要写书评

暂无评论

Efficient Lubytransform encodingalgorithm based on short cycle elimination

引用

Journal of Beijing Institute of Technology 2014年第3期23卷 407-412页

作者：曹聪哲费泽松匡镜明 School of Information and Electronics Beijing Institute of Technology

An effective Luby transform （LT） encoding algorithm based on short cycle elimination is proposed to improve decoding probabilities of short length LT codes. By searching the generator ma- trix, some special encoded symbols are generated by the encoder to effectively break the short cycles that have negative effect on the performance of LT codes. Analysis and numerical results show that by employing the proposed algorithm, the encoding complexity decreases and the decoding probabili- ties improve both in binary erasure channels （BECs） and additive white gauss noise （AWGN） chan- nels.

关键词： Luby transform （LT） codes short cycle encoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient 3D Hilbert Curve encoding and Decoding algorithms

引用

Chinese Journal of Electronics 2022年第2期31卷 277-284页

作者： JIA Lianyin LIANG Binbin LI Mengjuan LIU Yong CHEN Yinong DING Jiaman Faculty of Information Engineering and Automation Kunming University of Science and Technology Yunnan Key Laboratory of Artificial Intelligence Kunming University of Science and Technology Library Yunnan Normal University School of Information Science and Engineering Guangxi University for Nationalities School of Computing Informatics and Decision Systems Arizona State University

Hilbert curve describes a one-to-one mapping between multidimensional space and 1 D *** traditional 3D Hilbert encoding and decoding algorithms work on order-wise manner and are not aware of the difference between different input data and spend equivalent computing costs on them, thus resulting in a low efficiency. To solve this problem, in this paper we design efficient 3D state views for fast encoding and decoding. Based on the state views designed, a new encoding algorithm(JFK-3HE) and a new decoding algorithm(JFK-3HD) are proposed. JFK-3HE and JFK-3HD can avoid executing iteratively encoding or decoding each order by skipping the first 0 s in input data, thus decreasing the complexity and improving the efficiency. Experimental results show that JFK-3HE and JFK-3HD outperform the state-of-the-arts algorithms for both uniform and skew-distributed data.

关键词： order-wise manner multidimensional space encoding state-of-the-arts algorithms encoding algorithm parallel algorithms JFK-3HE statistical distributions decoding solid modelling design efficient 3D JFK-3HD traditional 3D Hilbert encoding equivalent computing costs different input data decoding algorithm Hilbert curve state views iterative methods

来源：评论

学校读者我要写书评

暂无评论

Accelerating Huffman encoding Using 512-Bit SIMD Instructions

引用

IEEE TRANSACTIONS ON CONSUMER ELECTRONICS 2024年第1期70卷 554-563页

作者： Yu, Yue Zhao, Zhe Lin, Sian-Jheng Li, Weihai Univ Sci & Technol China Sch Cyberspace Sci & Technol CAS Key Lab Electromagnet Space Informat Hefei 230026 Peoples R China

Based on 512-bit SIMD instructions, a Huffman encoding implementation, termed Huffman-SIMD, is proposed. The proposed implementation consists of four parts: establishing the Huffman coding table, data initialization, look-up table, and shifting and merging data. We establish the code table according to the characteristics of SIMD instructions. The code table is divided into eight sub-tables, with every two sub-tables in a group. It uses flag bits in each storage item to distinguish codewords from non-codewords, so the code table does not need to store the length of codewords in order to reduce the use of registers. After accelerating the table lookup operation using SIMD instruction, the valid size in each entry is different. Therefore, the shift merging algorithm is designed to operate on data and eliminate the spacing between data. This paper uses three datasets, Calgary, Silesia and Canterbury, to evaluate the implementation and compare it with the existing Huff0 library. The throughput is improved by 12.01% on average. Thus the implementation proposed in this paper improves the coding efficiency.

关键词： encoding Symbols Decoding Codes Throughput Registers Huffman coding Huffman code SIMD instructions encoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Linear time encoding of cycle GF(2^p) codes through graph analysis

引用

IEEE COMMUNICATIONS LETTERS 2006年第5期10卷 369-371页

作者： Huang, Jie Zhu, Jinkang Univ Sci & Technol China Dept Elect Engn & Informat Sci Hefei Peoples R China

In this letter, we present a linear-complexity encoding algorithm for any cycle GF(2(p)) code C-E(G, H). We just need to investigate the case where G is a nontrivial connected graph. If G is a tree, the only codeword is the all-zero word. If G is not a tree, first, we show that through graph analysis H can he transformed into an equivalent block-diagonal upper-triangular form simply by permuting the rows and columns of H;then, we show that whether H is full row-rank or not, the code can be encoded in linear time.

关键词： cycle code encoding algorithm Galois fields

来源：评论

学校读者我要写书评

暂无评论

Block-Triangularization of Parity Check Matrices for Efficient encoding of Linear Codes

Block-Triangularization of Parity Check Matrices for Efficie...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Shibuya, Tomoharu Sophia Univ Dept Informat & Commun Sci Tokyo Japan

ISBN: (纸本)9781457705953

In this paper, we propose a new encoding algorithm for linear codes whose computational complexity is O(w( H)) where w(H) denotes the number of non-zero elements in a parity check matrix H of a code. The proposed algorithm is based on the block-triangularization - an efficient technique to solve a system of linear equations - of a parity part of a parity check matrix, combining additional row and column permutations. As a result, the proposed algorithm can encode any linear codes defined by sparse parity check matrices, such as LDPC codes, with O(n) complexity where n denotes the code length.

关键词： Bipartite graph Computational complexity Equations LDPC codes Linear code Matrix decomposition Parity check codes computational complexity encoding encoding algorithm linear codes linear codes linear equations matrix algebra parity check codes sparse parity check matrix block-triangularization

来源：评论

学校读者我要写书评

暂无评论

Parallel algorithmic Optimization and Achievement for LDPC encoding and Decoding on CUDA Platform

Parallel Algorithmic Optimization and Achievement for LDPC E...

引用

International Conference on Computational Science and Computational Intelligence (CSCI)

作者： Liu Zhen Wang Yunpei Lu Lulu Jiangsu Univ Sci & Technol Sch Comp Sci & Engn Zhenjiang Peoples R China Jiangsu Univ Sci & Technol Sch Comp Sci & Engn Zhenjiang Peoples R China

ISBN: (纸本)9781467397957

With the development of mobile Internet applications, the fourth generation mobile communication (4G) has been widely used, low-density parity-check (LDPC) codes have gradually become the first choice for 4G communication because of its superior performance. For the short of traditional encoding and belief propagation (BP) decoding algorithm, this paper adopts a method of parallel processing for LDPC encoding and decoding which is finally realized on the mobile terminal. On the CUDA platform, CPU scheduling and GPU parallelization are used to process a large number of repeated operations so that parallel encoding algorithm and heterogeneous parallel BP algorithm are achieved and the efficiency is significantly improved.

关键词： LDPC codes encoding algorithm BP algorithm parallelization

来源：评论

学校读者我要写书评

暂无评论

A SPACE-AND-TIME-EFFICIENT CODING algorithm FOR LATTICE COMPUTATIONS

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1994年第5期6卷 819-829页

作者： GANGULY, DD MOHAN, CK RANKA, S SYRACUSE UNIV SCH COMP & INFORMAT SCISYRACUSENY 13244

We present an encoding algorithm-for lattices that significantly reduces space requirements while allowing fast computations of least upper bounds and greatest lower bounds of pairs of elements. We analyze the algorithms for encoding, LUB and GLB computations, and prove their correctness. Empirical experiments reveal that our method is significantly more space efficient than the transitive closure method, and the saving becomes increasingly more important as the size of the lattice increases.

关键词： LATTICES LEAST UPPER BOUND GREATEST LOWER BOUND encoding algorithm PARTIALLY ORDERED SETS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：