Page 26 - XaraDocument

XXIV. DATA COMPACTION ALGORITHMS SPEEDS UP TRANSMISSIONS
In telecommunication, and computer science, data compaction is the reduction

of the number of data elements, bandwidth, cost, and time for the generation,

transmission, and storage of data without loss of information by eliminating

unnecessary redundancy, removing irrelevancy, or using special coding.

Some examples of data compaction methods are the use of fixed-tolerance

bands, variable-tolerance bands, slope-keypoints, sample changes, curve patterns,

curve fitting, variable-precision coding, frequency analysis, and probability analysis.

Simply squeezing noncompacted data into a smaller space, for example by

increasing packing density or by transferring data on punched cards onto magnetic

tape, is not data compaction. Whereas data compaction reduces the amount of data

used to represent a given amount of information, data compression does not. Data

Compaction is an important element in developing an effective strategy for remote

data transfer especially with large amounts of data which can be contained in FDR

devices.

Data Compaction offers faster transfers of data since the basic algorithm will

compact or reduce the data, such as in a present day "zip file" and allowing for faster

and more efficient transfer of data.

XXV. DATA ENCRYPTION / DECRYPTION ALGORITHMS

Data encryption generally refers to the encryption of data for security purposes

for authorized personnel only. If critical flight data were to be transferred over a

telecommunications communications link for backup purposes, then that data would

need to be first encrypted before sent out over the data communications link in order

to protect the confidentiality of the flight data in progress. In this patent application,

the data collection embedded is a software system which provides this function.

Docket No. : Ticket 2180/215 21