The subset encoding method and related automata designs for improving the space efficiency for many applications on the Automata Processor (AP) are presented. The method is a general method that can take advantage of the character-or ability of STEs (State Transition Elements) on the AP, and can relieve the problems of limited hardware capacity and inefficient routing. Experimental results show that after applying the subset encoding method on Hamming distance automata, up to 3.2× more patterns can be placed on the AP if a sliding window is required. If a sliding window is not required, up to 192× more patterns can be placed on the AP. For a Levenshtein distance, the subset encoding can split the Levenshtein automata into small chunks and make them routable on the AP. The impact of the subset encoding method depends on the character size of the AP.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. An encoding method of a processor for a pattern matching application comprising the steps of: encoding a plurality of input data before streaming them into the processor, encoding and placing a plurality of patterns on loop structures on the processor, and matching the encoded input data on the processor using the loop structures, wherein the plurality of input data are application data, and the loop structures contain the encoded patterns. 2. The encoding method according to claim 1, wherein both the plurality of input data and the plurality of patterns are encoded into subsets of characters. 3. The encoding method according to claim 1, wherein the encoded input data are put in a single self-loop state transition element (STE) or a loop structure with multiple STEs on the processor. 4. The encoding method according to claim 3, wherein the single self-loop STE or the loop structure with multiple STEs contains a set of characters. 5. The encoding method according to claim 4, wherein the looped STE structure remains activated when the set of characters in the looped STE structure and another set of characters streamed in serial are identical, and the looped STE structure is turned off when the set of characters in the looped STE structure and the another set of characters streamed in serial are not identical. 6. The encoding method according to claim 3, wherein an STE comprises an array of memory, and a value in the memory cell indicates whether the encoded input data matches with the encoded patterns on the processor. 7. The encoding method according to claim 1, wherein the processor is a non-von Neumann processor based on the architecture of a dynamic random-access memory (DRAM). 8. The encoding method according to claim 6, wherein the processor further comprises a routing matrix for implementing connections among STEs, Boolean logic gates, and counters on the processor. 9. The encoding method according to claim 1, wherein the encoding and the matching are performed in parallel. 10. An automata design method of the processor for applying the encoding method according to claim 1 comprises: exact matching automata, Hamming distance automata, Levenshtein automata, and Damerau-Levenshtein automata. 11. The automata design method according to claim 10, wherein in the exact matching automata, whether the plurality of input data and the plurality of patterns are exactly identical is determined. 12. The automata design method according to claim 10, wherein in the Hamming distance automata, an one-to-one encoding method, an one-to-many encoding method, a many-to-one encoding method, and a many-to-many encoding method are used. 13. The automata design method according to claim 10, wherein in the Hamming distance automata, a ladder structure with a predetermined level is constructed to match the plurality of input data with the plurality of patterns within a predetermined distance. 14. The automata design method according to claim 10, wherein the Hamming distance automata is used to match the plurality of input data and the plurality of patterns with sliding windows, and a size of the plurality of input data is larger than that of the plurality of patterns. 15. The automata design method according to claim 10, wherein in the Levenshtein automata, left-shifted and right-shifted encoding are used for capturing insertions and deletions. 16. The automata design method according to claim 10, wherein in the Damerau-Levenshtein automata, AND logic gates are used for capturing transpositions of adjacent characters.