| 摘要 |
A method for compressing formatted code is disclosed. According to the method, the code is scanned so that all different burst and pause lengths of the code are found. The lengths are then arranging as elements of an array, with each element having a representative element number. Then, the formatted code is scanned for all possible burst-pause length couples found together. Using the "couple" information as well as the element numbers of the first array, a second array is provided with each element having two nibbles. Both nibbles of the second array element are used to point to an element number of the first array. Finally, a third array which represents the compressed formatted code is generated. The third array is also formed with elements having two nibbles. However, the nibbles of the third array point to the second array element numbers and can properly represent the entire formatted code therewith. Preferably, the formatted code is further compressed by recognizing repeat code or the repeat of an entire key code in the formatted code. Indications that an entire key code or just a particular repeat code are to be repeated after the full key code is completed may be stored in another array. Thus, repeat information need not be included in the compressed third array. |
