论文部分内容阅读
This paper defines second-order and third-order permutation global functions and presents the corresponding higher-order cellular automaton approach to the hyper-parallel undistorted data compression. The genetic algorithm is successfully devoted to finding out all the correct local compression rules for the higher-order cellular automaton. The correctness of the higher-order compression rules, the time complexity, and the systolic hardware implementation issue are discussed. In comparison with the first-order automaton method reported, the proposed higher-order approach has much faster compression speed with almost the same degree of cellular structure complexity for hardware implementation.
This paper defines second-order and third-order permutation global functions and presents the corresponding higher-order cellular automaton approach to the hyper-parallel undistorted data compression. The genetic algorithm is successfully devoted to finding out all the correct local compression rules for the higher -order cellular automaton. The correctness of the higher-order compression rules, the time complexity, and the systolic hardware implementation issues are discussed. In contrast with the first-order automaton method reported, the proposed higher-order approach has much faster compression speed with almost the same degree of cellular structure complexity for hardware implementation.