Autosophy data compression accelerates and encrypts network communications

Data compression has evolved rapidly from simple disc file compression software to integrated compression chipsets which will become standard parts in most future communications networks. The application is almost irresistible. If simple chipsets can indeed double or triple network throughput and provide an optional unbreakable encryption code, then conventional data communications will soon become uncompetitive. While data compression can greatly reduce the transmission cost, an additional encryption feature is becoming more and more important in open networks and wireless communications. Data compression algorithms have evolved from three separate lines of research. The old Huffman codes depend on uneven distribution of characters in text data. The Ziv-Lempel codes depend on previously transmitted data. Autosophy tree networks are derived from a new information theory and depend on prior knowledge of the data. Selecting the algorithm and chipset for a specific data type is the first step in evaluating the potential benefits. Not all types of data can be compressed and for those that can be there remains a range of potential problems including: data expansion, error propagation and patent liabilities