It is well known that interleavers play a critical role in Turbo coding/decoding schemes, and contention-free interleaver design has become a serious problem in the paraUelization of Turbo decoding, which is indispens...It is well known that interleavers play a critical role in Turbo coding/decoding schemes, and contention-free interleaver design has become a serious problem in the paraUelization of Turbo decoding, which is indispensable to meet the demands for high throughput and low latency in next generation mobile communication systems. This paper unveils the fact that interleavers based on permutation polynomials modulo N are contention-free for every window size W, a factor of the intedeaver length N, which, also called maximum contention-free interleavers.展开更多
Test points selection for integer-coded fault wise table is a discrete optimization problem. The global minimum set of test points can only be guaranteed by an exhaustive search which is eompurationally expensive. In ...Test points selection for integer-coded fault wise table is a discrete optimization problem. The global minimum set of test points can only be guaranteed by an exhaustive search which is eompurationally expensive. In this paper, this problem is formulated as a heuristic depth-first graph search problem at first. The graph node expanding method and rules are given. Then, rollout strategies are applied, which can be combined with the heuristic graph search algorithms, in a computationally more efficient manner than the optimal strategies, to obtain solutions superior to those using the greedy heuristic algorithms. The proposed rollout-based test points selection algorithm is illustrated and tested using an analog circuit and a set of simulated integer-coded fault wise tables. Computa- tional results are shown, which suggest that the rollout strategy policies are significantly better than other strategies.展开更多
Test points selection for integer-coded fault wise table is a discrete optimization problem. On one hand, traditional exhaustive search method is computationally expensive. On the other hand, the space complexity of t...Test points selection for integer-coded fault wise table is a discrete optimization problem. On one hand, traditional exhaustive search method is computationally expensive. On the other hand, the space complexity of traditional exhaustive is low. A tradeoff method between the high time complexity and low space complexity is proposed. At first, a new fault-pair table is constructed based on the integer-coded fault wise table. The fault-pair table consists of two columns： one column represents fault pair and the other represents test points set that can distinguish the corresponding faults. Then, the rows are arranged in ascending order according to the cardinality of corresponding test points set. Thirdly, test points in the top rows are selected one by one until all fault pair are isolated. During the test points selection process, the rows that contain selected test points are deleted and then the dimension of fault-pair table decreases gradually. The proposed test points selection algorithm is illustrated and tested using an integercoded fault wise table derived from a real analog circuit. Computational results suggest show policies are better than the exhaustive strategy.展开更多
Queen problems are unstructured problems, whose solution scheme can be applied in the actual job scheduling. As for the n-queen problem, backtracking algorithm is considered as an effective approach when the value of ...Queen problems are unstructured problems, whose solution scheme can be applied in the actual job scheduling. As for the n-queen problem, backtracking algorithm is considered as an effective approach when the value of n is small. However, in case the value of n is large, the phenomenon of combination explosion is expected to occur. In order to solve the aforementioned problem, queen problems are firstly converted into the problem of function optimization with constraints, and then the corresponding mathematical model is established. Afterwards, the n-queen problem is solved by constructing the genetic operators and adaption functions using the integer coding based on the population search technology of the evolutionary computation. The experimental results demonstrate that the proposed algorithm is endowed with rapid calculation speed and high efficiency, and the model presents simple structure and is readily implemented.展开更多
A new non-binary decoding method, which is called Yaletharatalhussein decoding algorithm, is designed and implemented for decoding non-binary convolutional codes which is based on the trellis diagram representing the ...A new non-binary decoding method, which is called Yaletharatalhussein decoding algorithm, is designed and implemented for decoding non-binary convolutional codes which is based on the trellis diagram representing the convolutional encoder. Yaletharatalhussein decoding algorithm outperforms the Viterbi algorithm and other algorithms in its simplicity, very small computational complexity, decoding reliability for high states TCM codes that suitable for Fourth-Generation (4G), decreasing errors with increasing word length, and easy to implement with real-time applications. The proposed Yaletharatalhussein decoding algorithm deals with non-binary error control coding of the convolutional and TCM codes. Convolutional codes differ from block codes in that a block code takes a fixed message length and encodes it, whereas a convolutional code can encode a continuous stream of data, and a hard-decision decoding can easily be realized using the Yaletharatalhussein algorithm. The idea of non-binary codes has been extended for symbols defined over rings of integers, which outperform binary codes with only a small increase in decoding complexity. The simulation results show that the performance of the nonbinary TCM-based Yaletharatalhussein algorithm outperforms the binary and non-binary decoding methods.展开更多
Most solutions for detecting buffer overflow are based on source code. But the requirement tor source code is not always practical especially for business software. A new approach was presented to detect statically th...Most solutions for detecting buffer overflow are based on source code. But the requirement tor source code is not always practical especially for business software. A new approach was presented to detect statically the potential buffer overflow vulnerabilities in the binary code of software. The binary code was translated into assembly code without the lose of the information of string operation functions. The feature code abstract graph was constructed to generate more accurate constraint statements, and analyze the assembly code using the method of integer range constraint. After getting the elementary report on suspicious code where buffer overflows possibly happen, the control flow sensitive analysis using program dependence graph was done to decrease the rate of false positive. A prototype was implemented which demonstrates the feasibility and efficiency of the new approach.展开更多
In this paper, the second generation wavelet transform is applied to image lossless coding, according to its characteristic of reversible integer wavelet transform. The second generation wavelet transform can provide ...In this paper, the second generation wavelet transform is applied to image lossless coding, according to its characteristic of reversible integer wavelet transform. The second generation wavelet transform can provide higher compression ratio than Huffman coding while it reconstructs image without loss compared with the first generation wavelet transform. The experimental results show that the se cond generation wavelet transform can obtain excellent performance in medical image compression coding.展开更多
This paper deals with the MIMO-OFDM technique that is applied to the fourth generation (4G) of the wireless communication systems, this technique can provide high data rate transmission without increasing transmit pow...This paper deals with the MIMO-OFDM technique that is applied to the fourth generation (4G) of the wireless communication systems, this technique can provide high data rate transmission without increasing transmit power and expanding bandwidth, it can also efficiently use space resources and has a bright future. It presents the channel coding assisted STBC-OFDM systems, and employs the Coded Modulation techniques (CM), since the signal bandwidth available for wireless communications is limited. The proposed system deals with Non-binary error control coding of the TCM-aided STBC-OFDM scheme for transmissions over the Rayleigh channel. A new non-binary decoding method, Yaletharatalhussein decoding algorithm, is designed and implemented for decoding non-binary convolutional codes, which is based on the trellis diagram representing the convolutional encoder. Yaletharatalhussein decoding algorithm outperforms the Viterbi algorithm and other algorithms in its simplicity, very small computational complexity, decoding reliability for high states TCM codes that are suitable for Fourth-Generation (4G), decreasing errors with increasing word length, and easy to implement with real-time applications. The simulation results show that the performance of the non-binary TCM-based Yaletharatalhussein decoding algorithm-assisted STBC-OFDM scheme outperforms the binary and non-binary decoding methods.展开更多
This paper studies the algorithms for coding and decoding Prufer codes of a labeled tree. The algorithms for coding and decoding Prufer codes of a labeled tree in the literatures require time usually. Although there e...This paper studies the algorithms for coding and decoding Prufer codes of a labeled tree. The algorithms for coding and decoding Prufer codes of a labeled tree in the literatures require time usually. Although there exist linear time algorithms for Prufer-like codes [1,2,3], the algorithms utilize the integer sorting algorithms. The special range of the integers to be sorted is utilized to obtain a linear time integer sorting algorithm. The Prufer code problem is reduced to integer sorting. In this paper we consider the Prufer code problem in a different angle and a more direct manner. We start from a naïve algorithm, then improved it gradually and finally we obtain a very practical linear time algorithm. The techniques we used in this paper are of interest in their own right.展开更多
Let F_q be a finite field with q = p^m, where p is an odd prime. In this paper, we study the repeated-root self-dual negacyclic codes over Fq. The enumeration of such codes is investigated. We obtain all the self-dual...Let F_q be a finite field with q = p^m, where p is an odd prime. In this paper, we study the repeated-root self-dual negacyclic codes over Fq. The enumeration of such codes is investigated. We obtain all the self-dual negacyclic codes of length 2~ap^r over F_q, a ≥ 1.The construction of self-dual negacyclic codes of length 2~abp^r over F_q is also provided, where gcd（2, b） = gcd（b, p） = 1 and a ≥ 1.展开更多
With the rapid development of digital earth,smart city,and digital twin technology,the demands of three-dimensional model data’s application is getting higher and higher.These data tend to be multi-objectification,mu...With the rapid development of digital earth,smart city,and digital twin technology,the demands of three-dimensional model data’s application is getting higher and higher.These data tend to be multi-objectification,multi-type,multi-scale,complex spatial relationship,and large amount,which brings great challenges to the efficient organization of them.This paper mainly studies the organization of three-dimensional model data,and the main contributions are as follows:1)A integer coding method of three dimensional multi-scale grid is proposed,which can reduce the four-dimensional(spatial dimension and scale dimension)space into one-dimensional,and has better space and scale clustering characteristics by comparing with various types of grid coding.2)The binary algebra calculation method is proposed to realize the basic spatial relationship calculation of three-dimensional grid,which has higher spatial relationship computing ability than 3D-Geohash method;3)The multi-scale integer coding method is applied to the data organization of three-dimensional city model,and the experiment results show that:it is more efficient and stable than the threedimensional R-tree index and Geohash coding method in the establishment of index and the query of three dimensional space.展开更多
Karhunen-Loeve transform （KLT） is the optimal transform that minimizes distortion at a given bit allocation for Gaussian source. As a KLT matrix usually contains non-integers, integer-KLT design is a classical probl...Karhunen-Loeve transform （KLT） is the optimal transform that minimizes distortion at a given bit allocation for Gaussian source. As a KLT matrix usually contains non-integers, integer-KLT design is a classical problem. In this paper, a joint reversibility-gain （R-G） model is proposed for integer-KLT design in video coding. Specifically, the ＇reversibility＇ is modeled according to distortion analysis in using forward and inverse integer transform without quantization. It not only measures how invcrtible a transform is, but also bounds the distortion introduced by the non-orthonormal integer transform process. The ＇gain＇ means transform coding gain （TCG）, which is a widely used criterion for transform design in video coding. Since KLT maximizes the TCG under some assumptions, here we define the TCG loss ratio （LR） to measure how much coding gain an integer-KLT loses when compared with the original KLT. Thus, the R-G model can be explained as follows： subject to a certain TCG LR, an integer- KLT with the best reversibility is the optimal integer transform for a given non-integer-KLT. Experimental results show that the R-G model can guide the design of integer-KLTs with good performance.展开更多
In optical networks without optical amplifiers(ONWOAs) photons may fade or fail to be detected, but new photons cannot be generated. Hence, under normal conditions, only 1 → 0 errors can occur. However, in some situa...In optical networks without optical amplifiers(ONWOAs) photons may fade or fail to be detected, but new photons cannot be generated. Hence, under normal conditions, only 1 → 0 errors can occur. However, in some situations, the photodetector may generate a false 0 → 1 error. This mostly occurs in cases when the dark current is higher than specified. With this in mind, in this paper,the authors present a class of codes suitable for use in ONWOAs using self-synchronous scramblers.The presented codes can correct single errors and random asymmetric(1 → 0) errors within a b-bit byte. Unlike classical codes, these codes use integer and lookup table operations. As a result, their interleaved version, implemented on a dual-core 3.0 GHz processor, achieves the theoretical throughput above the operating rate of 10 G networks.展开更多
Many modern video encoders use the Lagrangian rate-distortion optimization （RDO） algorithm for mode deci- sions during the compression procedure. For each encoding stage, this approach involves minimizing a cost, wh...Many modern video encoders use the Lagrangian rate-distortion optimization （RDO） algorithm for mode deci- sions during the compression procedure. For each encoding stage, this approach involves minimizing a cost, which is a function of rate, distortion and a multiplier called Lambda. This paper proposes to improve the RDO process by applying two modifications. The first modification is to increase the ac- curacy of rate estimation, which is achieved by computing a non-integer number of bits for arithmetic coding of the syntax elements. This leads to a more accurate cost computation and therefore a better mode decision. The second modification is to search and adjust the value of Lambda based on the char- acteristics of each coding stage. For the encoder used, this paper proposes to search multiple values of Lambda for the intra-4x4 mode decision. Moreover, a simple shift in Lambda value is proposed for motion estimation. Each of these modi- fications offers a certain gain in RDO performance, and, when all are combined, an average bit-rate saving of up to 7.0% can be achieved for the H.264/AVC codec while the same concept is applicable to the H.265/HEVC codec as well. The extra added complexity is contained to a certain level, and is also adjustable according to the processing resources available.展开更多
基金Project (No. 60332030) supported by the National Natural ScienceFoundation of China
文摘It is well known that interleavers play a critical role in Turbo coding/decoding schemes, and contention-free interleaver design has become a serious problem in the paraUelization of Turbo decoding, which is indispensable to meet the demands for high throughput and low latency in next generation mobile communication systems. This paper unveils the fact that interleavers based on permutation polynomials modulo N are contention-free for every window size W, a factor of the intedeaver length N, which, also called maximum contention-free interleavers.
基金supported by Commission of Science Technology and Industry for National Defence of China under Grant No.A1420061264National Natural Science Foundation of China under Grant No.60934002General Armament Department under Grand No.51317040102)
文摘Test points selection for integer-coded fault wise table is a discrete optimization problem. The global minimum set of test points can only be guaranteed by an exhaustive search which is eompurationally expensive. In this paper, this problem is formulated as a heuristic depth-first graph search problem at first. The graph node expanding method and rules are given. Then, rollout strategies are applied, which can be combined with the heuristic graph search algorithms, in a computationally more efficient manner than the optimal strategies, to obtain solutions superior to those using the greedy heuristic algorithms. The proposed rollout-based test points selection algorithm is illustrated and tested using an analog circuit and a set of simulated integer-coded fault wise tables. Computa- tional results are shown, which suggest that the rollout strategy policies are significantly better than other strategies.
基金supported by National Natural Science Foundation of China under Grant No.60934002General Armament Department under Grant No.51317040102
文摘Test points selection for integer-coded fault wise table is a discrete optimization problem. On one hand, traditional exhaustive search method is computationally expensive. On the other hand, the space complexity of traditional exhaustive is low. A tradeoff method between the high time complexity and low space complexity is proposed. At first, a new fault-pair table is constructed based on the integer-coded fault wise table. The fault-pair table consists of two columns： one column represents fault pair and the other represents test points set that can distinguish the corresponding faults. Then, the rows are arranged in ascending order according to the cardinality of corresponding test points set. Thirdly, test points in the top rows are selected one by one until all fault pair are isolated. During the test points selection process, the rows that contain selected test points are deleted and then the dimension of fault-pair table decreases gradually. The proposed test points selection algorithm is illustrated and tested using an integercoded fault wise table derived from a real analog circuit. Computational results suggest show policies are better than the exhaustive strategy.
文摘Queen problems are unstructured problems, whose solution scheme can be applied in the actual job scheduling. As for the n-queen problem, backtracking algorithm is considered as an effective approach when the value of n is small. However, in case the value of n is large, the phenomenon of combination explosion is expected to occur. In order to solve the aforementioned problem, queen problems are firstly converted into the problem of function optimization with constraints, and then the corresponding mathematical model is established. Afterwards, the n-queen problem is solved by constructing the genetic operators and adaption functions using the integer coding based on the population search technology of the evolutionary computation. The experimental results demonstrate that the proposed algorithm is endowed with rapid calculation speed and high efficiency, and the model presents simple structure and is readily implemented.
文摘A new non-binary decoding method, which is called Yaletharatalhussein decoding algorithm, is designed and implemented for decoding non-binary convolutional codes which is based on the trellis diagram representing the convolutional encoder. Yaletharatalhussein decoding algorithm outperforms the Viterbi algorithm and other algorithms in its simplicity, very small computational complexity, decoding reliability for high states TCM codes that suitable for Fourth-Generation (4G), decreasing errors with increasing word length, and easy to implement with real-time applications. The proposed Yaletharatalhussein decoding algorithm deals with non-binary error control coding of the convolutional and TCM codes. Convolutional codes differ from block codes in that a block code takes a fixed message length and encodes it, whereas a convolutional code can encode a continuous stream of data, and a hard-decision decoding can easily be realized using the Yaletharatalhussein algorithm. The idea of non-binary codes has been extended for symbols defined over rings of integers, which outperform binary codes with only a small increase in decoding complexity. The simulation results show that the performance of the nonbinary TCM-based Yaletharatalhussein algorithm outperforms the binary and non-binary decoding methods.
文摘Most solutions for detecting buffer overflow are based on source code. But the requirement tor source code is not always practical especially for business software. A new approach was presented to detect statically the potential buffer overflow vulnerabilities in the binary code of software. The binary code was translated into assembly code without the lose of the information of string operation functions. The feature code abstract graph was constructed to generate more accurate constraint statements, and analyze the assembly code using the method of integer range constraint. After getting the elementary report on suspicious code where buffer overflows possibly happen, the control flow sensitive analysis using program dependence graph was done to decrease the rate of false positive. A prototype was implemented which demonstrates the feasibility and efficiency of the new approach.
基金Supported by the National Natural Science Foundation of China!( 6 9875 0 0 9)
文摘In this paper, the second generation wavelet transform is applied to image lossless coding, according to its characteristic of reversible integer wavelet transform. The second generation wavelet transform can provide higher compression ratio than Huffman coding while it reconstructs image without loss compared with the first generation wavelet transform. The experimental results show that the se cond generation wavelet transform can obtain excellent performance in medical image compression coding.
文摘This paper deals with the MIMO-OFDM technique that is applied to the fourth generation (4G) of the wireless communication systems, this technique can provide high data rate transmission without increasing transmit power and expanding bandwidth, it can also efficiently use space resources and has a bright future. It presents the channel coding assisted STBC-OFDM systems, and employs the Coded Modulation techniques (CM), since the signal bandwidth available for wireless communications is limited. The proposed system deals with Non-binary error control coding of the TCM-aided STBC-OFDM scheme for transmissions over the Rayleigh channel. A new non-binary decoding method, Yaletharatalhussein decoding algorithm, is designed and implemented for decoding non-binary convolutional codes, which is based on the trellis diagram representing the convolutional encoder. Yaletharatalhussein decoding algorithm outperforms the Viterbi algorithm and other algorithms in its simplicity, very small computational complexity, decoding reliability for high states TCM codes that are suitable for Fourth-Generation (4G), decreasing errors with increasing word length, and easy to implement with real-time applications. The simulation results show that the performance of the non-binary TCM-based Yaletharatalhussein decoding algorithm-assisted STBC-OFDM scheme outperforms the binary and non-binary decoding methods.
文摘This paper studies the algorithms for coding and decoding Prufer codes of a labeled tree. The algorithms for coding and decoding Prufer codes of a labeled tree in the literatures require time usually. Although there exist linear time algorithms for Prufer-like codes [1,2,3], the algorithms utilize the integer sorting algorithms. The special range of the integers to be sorted is utilized to obtain a linear time integer sorting algorithm. The Prufer code problem is reduced to integer sorting. In this paper we consider the Prufer code problem in a different angle and a more direct manner. We start from a naïve algorithm, then improved it gradually and finally we obtain a very practical linear time algorithm. The techniques we used in this paper are of interest in their own right.
基金Supported by Reward Fund for Outstanding Young and Middle-Aged Scientists of Shandong Province(Grant No.BS2011DX011)Qingdao Postdoctoral Fund(Grant No.861605040007)
文摘Let F_q be a finite field with q = p^m, where p is an odd prime. In this paper, we study the repeated-root self-dual negacyclic codes over Fq. The enumeration of such codes is investigated. We obtain all the self-dual negacyclic codes of length 2~ap^r over F_q, a ≥ 1.The construction of self-dual negacyclic codes of length 2~abp^r over F_q is also provided, where gcd（2, b） = gcd（b, p） = 1 and a ≥ 1.
基金National Key R&D Program of China[Grant Number 2018YFB0505304]National Natural Science Foundation of China[Grant Number 41671409].
文摘With the rapid development of digital earth,smart city,and digital twin technology,the demands of three-dimensional model data’s application is getting higher and higher.These data tend to be multi-objectification,multi-type,multi-scale,complex spatial relationship,and large amount,which brings great challenges to the efficient organization of them.This paper mainly studies the organization of three-dimensional model data,and the main contributions are as follows:1)A integer coding method of three dimensional multi-scale grid is proposed,which can reduce the four-dimensional(spatial dimension and scale dimension)space into one-dimensional,and has better space and scale clustering characteristics by comparing with various types of grid coding.2)The binary algebra calculation method is proposed to realize the basic spatial relationship calculation of three-dimensional grid,which has higher spatial relationship computing ability than 3D-Geohash method;3)The multi-scale integer coding method is applied to the data organization of three-dimensional city model,and the experiment results show that:it is more efficient and stable than the threedimensional R-tree index and Geohash coding method in the establishment of index and the query of three dimensional space.
基金Project supported by the National Natural Science Foundation of China(Nos.61371162 and 61431015)
文摘Karhunen-Loeve transform （KLT） is the optimal transform that minimizes distortion at a given bit allocation for Gaussian source. As a KLT matrix usually contains non-integers, integer-KLT design is a classical problem. In this paper, a joint reversibility-gain （R-G） model is proposed for integer-KLT design in video coding. Specifically, the ＇reversibility＇ is modeled according to distortion analysis in using forward and inverse integer transform without quantization. It not only measures how invcrtible a transform is, but also bounds the distortion introduced by the non-orthonormal integer transform process. The ＇gain＇ means transform coding gain （TCG）, which is a widely used criterion for transform design in video coding. Since KLT maximizes the TCG under some assumptions, here we define the TCG loss ratio （LR） to measure how much coding gain an integer-KLT loses when compared with the original KLT. Thus, the R-G model can be explained as follows： subject to a certain TCG LR, an integer- KLT with the best reversibility is the optimal integer transform for a given non-integer-KLT. Experimental results show that the R-G model can guide the design of integer-KLTs with good performance.
文摘In optical networks without optical amplifiers(ONWOAs) photons may fade or fail to be detected, but new photons cannot be generated. Hence, under normal conditions, only 1 → 0 errors can occur. However, in some situations, the photodetector may generate a false 0 → 1 error. This mostly occurs in cases when the dark current is higher than specified. With this in mind, in this paper,the authors present a class of codes suitable for use in ONWOAs using self-synchronous scramblers.The presented codes can correct single errors and random asymmetric(1 → 0) errors within a b-bit byte. Unlike classical codes, these codes use integer and lookup table operations. As a result, their interleaved version, implemented on a dual-core 3.0 GHz processor, achieves the theoretical throughput above the operating rate of 10 G networks.
文摘Many modern video encoders use the Lagrangian rate-distortion optimization （RDO） algorithm for mode deci- sions during the compression procedure. For each encoding stage, this approach involves minimizing a cost, which is a function of rate, distortion and a multiplier called Lambda. This paper proposes to improve the RDO process by applying two modifications. The first modification is to increase the ac- curacy of rate estimation, which is achieved by computing a non-integer number of bits for arithmetic coding of the syntax elements. This leads to a more accurate cost computation and therefore a better mode decision. The second modification is to search and adjust the value of Lambda based on the char- acteristics of each coding stage. For the encoder used, this paper proposes to search multiple values of Lambda for the intra-4x4 mode decision. Moreover, a simple shift in Lambda value is proposed for motion estimation. Each of these modi- fications offers a certain gain in RDO performance, and, when all are combined, an average bit-rate saving of up to 7.0% can be achieved for the H.264/AVC codec while the same concept is applicable to the H.265/HEVC codec as well. The extra added complexity is contained to a certain level, and is also adjustable according to the processing resources available.
