The purpose of this research is to develop software to optimize the data compression of a PDF417 barcode using VC++6.0. According to the different compression mode and the particularities of Chinese, the relevant appr...
详细信息
ISBN:
(纸本)9781441902108
The purpose of this research is to develop software to optimize the data compression of a PDF417 barcode using VC++6.0. According 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 introduced. After the whole data compression is finished, the number of the codeword is reduced and then the encoding algorithm is optimized. The developed encoding system of PDF 417 barcodes will be applied in the logistics management of fruits, therefore also will promote the fast development of the two-dimensional bar codes.
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...
详细信息
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.
A novel approach composed of the phase-shift measurement method and the encoding matrix is introduced to solve the problem of the fast measurement and the calibration of phased array antennas. Both phased array antenn...
详细信息
ISBN:
(纸本)9781467318006
A novel approach composed of the phase-shift measurement method and the encoding matrix is introduced to solve the problem of the fast measurement and the calibration of phased array antennas. Both phased array antennas and probe are fixed in the whole measurement process. The encoding coefficient matrix is used to control the phase-shift of each phase shifter in phased array antennas. The signal of each phase shifter and the excitation of each channel can be recovered after decoding. In the mean time, the fault of each element can be diagnosed. The simulation of the measurement process of the phased array antenna model shows the correctness and effectiveness of the approach.
From the existing clustering techniques, spatial density-based ones register one of the most promising results in detecting arbitrary shaped data, being robust to outliers and not restricted by various data distributi...
详细信息
ISBN:
(纸本)9780769549347;9781467350266
From the existing clustering techniques, spatial density-based ones register one of the most promising results in detecting arbitrary shaped data, being robust to outliers and not restricted by various data distributions. The existing literature contains a plethora of density based algorithms but in all cases one or multiple global parameters need to be set, parameters that are seldom easy to set requiring in depth knowledge about the analyzed data. This paper proposes a parameter-free novel genetic clustering algorithm with an original method for encoding clustering solutions relying on density based clustering parameters. Within each clustering solution genotype, gene position, defined by several density based clustering attributes, plays a key role for recovering the encoded partition. Each gene defined density-based cluster can only attract object not already attracted by previously defined clusters. The proposed encoding scheme allows for always valid crossover results, with great offspring variations even when using simple crossover operators. While not requiring any input parameters, experiments involving multiple clustering validation indices as fitness criteria, across both synthetic and real data sets, show comparable results with existing density-based clustering techniques.
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 algo...
详细信息
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.
We explore the implementation in hardware of encoders for algebraic codes for binary memories that have some cells stuck to given values. The location and stuck values of the cells are assumed to be known at encode ti...
详细信息
ISBN:
(纸本)9781424488650
We explore the implementation in hardware of encoders for algebraic codes for binary memories that have some cells stuck to given values. The location and stuck values of the cells are assumed to be known at encode time, but not at decode time. Recently, an algorithm for BCH-like codes for stuck cells was developed that relies on a type of polynomial interpolation in an extension field followed by a step of projection of the result of the interpolation back into the binary field. In this article, we report on the area and latency of a sequential implementation of this encoding algorithm for a variety of values for the number of stuck cells. The statistics on area and latency follow from preliminary circuit synthesis results obtained from a full VHDL implementation of these examples.
In this paper, a novel lossless data hiding scheme is proposed to achieve the goals of hiding secret data into a VQ compressed image and lossless reconstruction of the original image. This scheme first uses neighborin...
详细信息
ISBN:
(纸本)9781424463916
In this paper, a novel lossless data hiding scheme is proposed to achieve the goals of hiding secret data into a VQ compressed image and lossless reconstruction of the original image. This scheme first uses neighboring and processed compression codes to generate sub-codebooks and then uses these sub-codebooks and encoding algorithm to perform encoding and data hiding simultaneously. More important, the original VQ compressed codes can be recovered completely after data extraction. To evaluate the effectiveness of this approach, various test images are used in the experiments. From the experimental results, it is shown that the proposed scheme can largely decrease the compression rate and increase the hiding capacity for achieving data hiding. That is, the performance of the proposed scheme is superior to other previous schemes in compression ratio and embedding capacity.
As one of the useful background knowledge, concept hierarchies organize data or concepts in hierarchical forms or in certain partial order, which are used for expressing knowledge in concise, high-level terms, and fac...
详细信息
As one of the useful background knowledge, concept hierarchies organize data or concepts in hierarchical forms or in certain partial order, which are used for expressing knowledge in concise, high-level terms, and facilitating mining knowledge at multiple levels of abstraction. To incorporate the concept hierarchies into a data mining system, encoding plays a key role. A novel generic encoding algorithm is proposed which can be treated as a generic purpose encoding strategy suitable for any data mining functionalities. The partial order of the hierarchy is exactly represented by the codes so that it only needs to manipulate the codes when processing mining tasks.
Though LDPC codes have been accepted by DVB-S2, the LDPC encode of DVB-S2 (Digital Video Broadcasting Satellite Second Generation) are difficult to be implemented for their huge code lengths of 16200 bits and 64800 bi...
详细信息
ISBN:
(纸本)9781424436927
Though LDPC codes have been accepted by DVB-S2, the LDPC encode of DVB-S2 (Digital Video Broadcasting Satellite Second Generation) are difficult to be implemented for their huge code lengths of 16200 bits and 64800 bits). To shorten the codes will lead the problems of girth-4 and lower weight codes. This paper analyzed the possible reasons leading to the problems, and revised the current code construction of DVB-S2. The simulation results in the AWGN channel show that the BER performance of the improved LDPC codes is much better than that of the former shorten codes.
With more and more ribonucleic acid (RNA) secondary structures accumulated, the need for comparing different RNA secondary structures often arises in function prediction and evolutionary analysis. Numerous efficient a...
详细信息
With more and more ribonucleic acid (RNA) secondary structures accumulated, the need for comparing different RNA secondary structures often arises in function prediction and evolutionary analysis. Numerous efficient algorithms were developed for comparing different RNA secondary structures, but challenges remain. In this paper, six new models based on the linear regression model were proposed for the comparison of RNA secondary structures. The proposed models were tested on a mixed data, containing six secondary structures from RNase P RNAs, three secondary structures from SSU rRNA and five secondary structures from 16S ribosomal RNAs. The results have shown the effectiveness of the proposed models. Moreover, the time complexity of our models is favorable by comparing with that of the existing methods which solve the similar problem. Crown Copyright (C) 2008 Published by Elsevier Ltd. All rights reserved.
暂无评论