A new method of fast compression of program code for ota updates in consumer devices

This paper presents a technology for over the air (OTA) updating that allows software updates in consumer devices such as mobile phones and car-navigation systems that are connected to networks, and it adopts NAND flash memories and demand paging technologies. Software updates for these kinds of consumer devices are carried out using the binary difference that minimizes the amount of update data, software construction technologies that minimize the rewriting of flash memories, and fast compression technologies that enables rapid rewriting. This paper focuses on byte pair encoding (BPE), which is one of the most efficient methods of compressing program code in consumer devices that adopts NAND flash memories and demand paging technologies. We describe a fast method of compressing BPE and evaluating it.

[1]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.

[2]  Philip Gage,et al.  A new algorithm for data compression , 1994 .

[3]  Yoshiyuki Okada,et al.  An extended delta compression algorithm and the recovery of failed updating in embedded systems , 2004, Data Compression Conference, 2004. Proceedings. DCC 2004.

[4]  Dake He,et al.  Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform .2. With context models , 2000, IEEE Trans. Inf. Theory.

[5]  Daniel S. Hirschberg,et al.  Data compression , 1987, CSUR.

[6]  Thomas G. Szymanski,et al.  A fast algorithm for computing longest common subsequences , 1977, CACM.

[7]  Paul Mackerras,et al.  The rsync algorithm , 1996 .

[8]  Walter F. Tichy,et al.  The string-to-string correction problem with block moves , 1984, TOCS.

[9]  A. Moffat,et al.  Offline dictionary-based compression , 2000, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096).

[10]  Benjamin C. Pierce,et al.  What is a file synchronizer? , 1998, MobiCom '98.

[11]  James A. Storer,et al.  Data compression via textual substitution , 1982, JACM.

[12]  Ryozo Kiyohara,et al.  A delta representation scheme for updating between versions of mobile phone software , 2007 .

[13]  Ayumi Shinohara,et al.  Speeding Up Pattern Matching by Text Compression , 2000, CIAC.

[14]  Tibor Gyimóthy,et al.  Survey of code-size reduction methods , 2003, CSUR.

[15]  Abdelghani Bellaachia,et al.  Efficiency of prefix and non-prefix codes in string matching over compressed databases on handheld devices , 2005, SAC '05.

[16]  Craig G. Nevill-Manning,et al.  Compression and Explanation Using Hierarchical Grammars , 1997, Comput. J..