Abstract: In one aspect, a method of compressing data includes splitting an I/O into smaller I/Os based on an I/O throughput. The size of the smaller I/Os are equal or less than a set block size. The method also includes asynchronously compressing the smaller I/Os. In another aspect, an article includes a non-transitory machine-readable medium that stores executable instructions. The instructions cause a machine to split an I/O into smaller I/Os based on an I/O throughput and asynchronously compress the smaller I/Os. The size of the smaller I/Os being equal or less than a set block size. In a further aspect, a system includes circuitry configured to split an I/O into smaller I/Os based on an I/O throughput and asynchronously compress the smaller I/Os. The size of the smaller I/Os being equal or less than a set block size.

Abstract: A method is set forth for compressing a file of size C for storage in a memory space of size F, where C>F, comprising compressing successive portions of the file until C?F, creating a header to the file including an offset value indicating a location separating compressed and uncompressed portions of the file, and appending the header to the file. A further method is set forth for executing a file comprising reading the header to determine the predetermined compression algorithm and the offset, copying the uncompressed portions from the memory to a RAM, decompressing the compressed portions starting at the offset, storing the decompressed portions of the load into RAM in sequence after the uncompressed portions, and executing the file from the RAM.

Abstract: A method and system for compressing a tree with a plurality of nodes that each may be associated with a node identifier and a parent node identifier. The method may comprise for each node in the tree determining whether the current node is to be deleted, if the current node is to be deleted updating a list of deleted nodes such that the node identifier of the current node may be stored; a parameter representing a number of nodes currently having been deleted from the tree may be stored, such that the parameter is associated with the node identifier of the current node, and updating the node identifier and the parent node identifier of the current node as a function of the list of deleted nodes. Each node in the tree is visited only once.

Abstract: An integrated memory controller (IMC) preferably sits on the main CPU bus or a high speed system peripheral bus and couples to system memory. The IMC may use a lossless data compression and decompression scheme for improved performance. The IMC may also include microcode for specific decompression of particular data formats such as digital video and digital audio. Compressed data may be decompressed in the IMC and stored into system memory or saved in the system memory in compressed format. Internal memory mapping may allow for formal definition spaces which may define the format of the data and the data type to be read or written. Software overrides may be placed in applications software in systems that desire to control data decompression at the software application level.

Abstract: A method to perform a least recently used (LRU) algorithm for a co-processor is described, which co-processor in order to directly use instructions of a core processor and to directly access a main storage by virtual addresses of said core processor comprises a TLB for virtual to absolute address translations plus a dedicated memory storage also including said TLB, wherein said TLB consists of at least two zones which can be assigned in a flexible manner more than one at a time. Said method to perform a LRU algorithm is characterized in that one or more zones are replaced dependent on an actual compression service call (CMPSC) instruction.

Abstract: A dual-interface connector for providing an interface to a storage device and an interface to a host and for connecting between a storage device and a host includes a storage device interface, for connecting with a storage device, and a host interface, for connecting with a host. A controller is operable in at least two distinct modes of operation. In a first mode of operation, the controller enables a session to be opened, by the host, between the storage device and the host when the storage device is connected to the storage device interface and the host is connected to the host interface. In a second mode of operation, the controller is operative, if an open session exists between the storage device and the host, to maintain the open session between the storage device and the host even after the storage device is disconnected from the storage device interface.

Abstract: The present invention aims for efficient use of storage capacity in a storage system by reducing the amount of time taken for processing including removing redundancy and data compression executed with respect to transferred data. Focusing on data patterns included in transferred data, the most suitable pattern is detected, and de-duplication processing is gradually executed. Data compression is then executed with data after de-duplication as a target. Determination of the decision for execution of gradual de-duplication processing, or execution of compression processing is made depending on the amount of data remaining at each processing stage and the system load.

Abstract: In a computer system supporting memory compression and wherein data is stored on a disk in a different compressed format, and wherein an IOA (input/output adaptor)/IOP (input/output processor) selectively reads from and writes to a main memory through a direct memory access (DMA) operation, a method for transmitting compressed data from the IOA/IOP to the main memory includes reserving a set of free memory sectors to contain the data in said main memory, sending to the IOA/IOP addresses of said memory sectors, copying the data from the IOA/IOP to said memory sectors using said DMA operation, constructing at the IOA/IOP compressed memory directory information defining how and where the data is stored in memory, sending the memory directory information to a memory controller, and storing the memory directory information in the compressed memory directory structure.

Abstract: Data is transferred over a network for storage purposes in a way that accommodates systems which are equipped to only handle a predetermined data block size. This is accomplished by transmitting the data using the same data block size regardless as to whether the data is compressed or not. In use, data to be transferred is identified on a first computer. Prior to being transferred to a second computer, it is determined whether the data is to be compressed. If it is determined that the data is not to be compressed, the data is subdivided into a plurality of data blocks with a predetermined size. If it is determined that the data is to be compressed, the data is compressed and subdivided into a plurality of data blocks with the predetermined size. Such data blocks are then transferred to the second computer via the network, for storing the data.

Abstract: A method and apparatus compress projection data and store the compressed projection data in a rotatable part that is mounted for rotation within a stationary part. The data acquisition source, compressor and storage device are connected to the rotatable part. The compressor compresses projection data samples provided by the data acquisition source to form compressed packets. The compressed packets are stored in the storage device, for example one or more solid state drives mounted on the rotatable part. A data access array contains information related to the location of the stored compressed packets. Compressed packets are retrieved and transferred across the interface to the stationary part. A decompressor at the stationary part decompresses the received compressed packets to form decompressed samples of the corresponding projection data. This abstract does not limit the scope of the invention as described in the claims.

Abstract: A computerized data storage system includes at least one storage device including a nonvolatile writable medium; a cache memory operatively coupled to the storage port and including a data storing area and a data management controller and a storage port. The storage port is operable to connect to a host computer, receive and send I/O information required by the host computer. The storage port is also operable to receive a request to read data, and, in response to the request to read data, the storage port is operable to send the data stored in the data storing area of the cache memory. The storage port is further operable to receive a request to write data, and, in response to the request to write data, the storage port is operable to send the write data to the data storing area of the cache memory.

Abstract: Provided are an apparatus and a method for saving a memory in a portable terminal, the method includes receiving a request for basic data and an address indicating a storage position of the basic data; determining whether the requested basic data has been stored in a paging buffer; if it is determined that the requested basic data has not been stored in the paging buffer, transforming the address of the requested basic data into an address of a corresponding compressed block using a block address table; searching the compressed basic data for the compressed block corresponding to the address of the compressed block; decompressing the searched compressed block; storing data of the decompressed block in the paging buffer; and returning the requested basic data stored in the paging buffer.

Abstract: A method, system, and medium for compressing systems management information in a historical data store. Dynamically determining the appropriate compression algorithm to apply based on the type of data being compressed and stored. As further input is received for any particular measurement, the appropriate compression algorithm will be automatically selected from the set of available compression algorithms or be defined by a user configuration parameter. The amount of historical data stored with the minimal amount of data loss is optimized by the system dynamically changing the compression algorithm used for the given input data over a particular time span. The system engineer is therefore presented with the pertinent information for monitoring, administrating and diagnosing system activities.

Abstract: An arrangement including a first semiconductor chip and a second semiconductor chip connected thereto, where the second semiconductor chip is additionally connected to electrical loads and drives these electrical loads on the basis of a timing which is prescribed to it by load control data, and where the first semiconductor chip transmits to the second semiconductor chip the aforementioned load control data and pilot data which control the second semiconductor chip, and where the second semiconductor chip transmits to the first semiconductor chip diagnostic data which represent states prevailing in the second semiconductor chip or events which occur. The diagnostic data are transmitted via a first transmission channel and the load control data and the pilot data are transmitted via a second transmission channel.

Abstract: Methods, apparatuses, and systems directed to efficient compression processing in system architectures including a control plane and a data plane. Particular implementations feature integration of compression operations and mode selection with a beltway mechanism that takes advantage of atomic locking mechanisms supported by certain classes of hardware processors to handle the tasks that require atomic access to data structures while also reducing the overhead associated with these atomic locking mechanisms.

Abstract: This disclosure describes a dynamic pattern elimination compression method to eliminate redundant patterns, the content of which is not known a priori, by identifying the candidate dynamic patterns and marking them, then checking to see if there are any duplicate occurrences within the entire message by searching for markers, if a marker is found, checking to see if the pattern occurred before, if not, assigning a unique variable to the pattern, if so replacing the pattern with the variable that was assigned for this pattern, and if a pattern is found only once, removing the variable assigned to it.

Abstract: Systems for performing inline wire speed data deduplication are described herein. Some embodiments include a device for inline data deduplication that includes one or more input ports for receiving an input data stream containing duplicates, one or more output ports for providing a data deduplicated output data stream, and an inline data deduplication engine coupled to said one or more input ports and said one or more output ports to process input data containing duplicates into output data which is data deduplicated, said inline data deduplication engine having an inline data deduplication bandwidth of at least 4 Gigabytes per second.

Abstract: An image processing apparatus includes a data bus provided to access a memory, a compressing unit which compresses an image data and outputs a compressed image data, a write unit which writes the compressed image data into the memory via the data bus, a read unit which reads a compressed image from the memory via the data bus, a decompression unit which decompresses the compressed data read by the read unit, and a control unit which controls operations of the write unit and the read unit, based on an amount per unit time of the compressed image data outputted from the compressing unit, an amount per unit time of the compressed image data read from the memory and a degree of congestion of the data bus.

Abstract: A data processing system is distributed across a plurality of locations coupled together by a wide-area communications network and includes physical storage devices and a set of host computers distributed across the locations. Each host executes both a local initiator application and a local caching storage controller (CSC) application.

Abstract: Provided are a method and an apparatus for compression transmission of bus data including a plurality of bytes including upper bits and lower bits. The apparatus includes a comparator and an aligner. The comparator compares upper bits of a previous byte with upper bits of a current byte among the plurality of bytes. If the upper bits of the previous byte are identical to the upper bits of the current byte, the aligner compresses the bus data in a combination of a full-byte and a half-byte, by allowing the previous byte to be constituted with the full-byte having bits corresponding to the number of bits of the previous byte and allowing the current byte to be constituted with the half-byte excluding the upper bits of the current byte. Then, the aligner arrays the compressed bus data in a preset bus bandwidth to transmit to a slave device.

Abstract: Systems and methods for commonality factoring for storing data on removable storage media are described. The systems and methods allow for highly compressed data, e.g., data compressed using archiving or backup methods including de-duplication, to be stored in an efficient manner on portable memory devices such as removable storage cartridges. The methods include breaking data, e.g., data files for backup, into unique chunks and calculating identifiers, e.g., hash identifiers, based on the unique chunks. Redundant chunks can be identified by calculating identifiers and comparing identifiers of other chunks to the identifiers of unique chunks previously calculated. When a redundant chunk is identified, a reference to the existing unique chunk is generated such that the chunk can be reconstituted in relation to other chunks in order to recreate the original data. The method further includes storing one or more of the unique chunks, the identifiers and/or the references on the removable storage medium.

Abstract: Systems and methods for commonality factoring for storing data on removable storage media are described. The systems and methods allow for highly compressed data, e.g., data compressed using archiving or backup methods including de-duplication, to be stored in an efficient manner on portable memory devices such as removable storage cartridges. The methods include breaking data, e.g., data files for backup, into unique chunks and calculating identifiers, e.g., hash identifiers, based on the unique chunks. Redundant chunks can be identified by calculating identifiers and comparing identifiers of other chunks to the identifiers of unique chunks previously calculated. When a redundant chunk is identified, a reference to the existing unique chunk is generated such that the chunk can be reconstituted in relation to other chunks in order to recreate the original data. The method further includes storing one or more of the unique chunks, the identifiers and/or the references on the removable storage medium.

Abstract: Systems and methods for creating, reading, and writing compressed data for use with a block mode access storage. The compressed data are packed into plurality of compressed units and stored in a storage logical unit (LU). One or more corresponding compressed units may be read and/or updated with no need of restoring the entire storage logical unit while maintaining de-fragmented structure of the LU.

Abstract: A tape drive unit has a data compression engine coupled to an incoming data stream. A buffer memory stores data of the incoming data stream. A control module enables or disables the data compression engine in response to a function of the data occupancy level of the buffer memory.

Abstract: A transcoder device includes means for receiving encoding information transmitted from a motion-picture encoding and transmitting device and decoding information transmitted from a motion-picture receiving and decoding device, referring to the encoding information and the decoding information to determine whether the syntax in a video packet transmitted from the motion-picture encoding and transmitting device is transcoded, and outputting transcoding control information, and means for transcoding an encoded bitstream that is input in the syntax level on the basis of the transcoding control information and transmitting the transcoded encoded bitstream to the motion-picture receiving and decoding device.

Abstract: A multi-protocol serial interface (MPSI) apparatus can include a controller circuit that is configured to receive information about a type of MPSI utilized for data transfer and that is configured to control a format of the data transfer and input/output timing associated with the data transfer. A data generation and processing circuit is coupled to the controller circuit and is configured to extract information from a buffer memory to generate data for the data transfer according to the format based on the information and is configured to generate the data in a packet format or a bit format based on the information.

Abstract: A method (and system) of storing information, includes storing main memory compressed information onto a memory compressed disk, where pages are stored and retrieved individually, without decompressing the main memory compressed information.

Abstract: For use in a storage network comprising a plurality of network elements and operable with a block mode access storage protocol, a method of operating a compression system operatively coupled to at least one computer and to one or more storage devices configured as at least one storage logical unit accommodating data compressed by the compression system, the computer, the storage devices and the compression system are configured as separate network elements. According to the method, the compression system is configured to hold a virtual logical unit, the virtual logical unit is configured to virtually represent in non-compressed form the compressed data stored in the at least one storage logical unit. The size of the virtual logical unit corresponds to an estimated size of raw data which, being compressed, would substantially amount to a size of the storage logical unit.

Abstract: A method for transmitting a message by compressed data transmission between a sender and a receiver using connectionless or connection oriented protocols. The sender gateway assures that the appropriate handling of the message data is made by knowing the transmission protocol(s) used. T The rules and structures of the protocol(s) must be known to be able to use a compression method ideally suited to the needs of the particular protocol. Both gateways analyze the data stream between sender and receiver, compress outgoing and decompressing incoming data. For connection oriented protocols, differently structured data structures are transmitted during a connection. To distinguish different data structures, the gateway providing for compression examines the data to be transmitted and, by knowing the definition of the protocol used and the state of the machine, it can control the compression to use a file-oriented compression on certain parts of the data stream.

Abstract: Space-time code, and methods for constructing space-time codes are provided. The space-time coder performs a respective linear transformation on each of P sets of K modulated symbols of a modulated symbol stream to produce P sets of T linearly transformed symbols, applies a respective phase rotation to each set of T linearly transformed symbols to produce a respective set of T phase rotated symbols, and performs a threading operation on the sets of T phase rotated symbols to produce P threaded sequences that define M output sequences. During each of T symbol periods, a respective one of the P threaded sequences includes a symbol from one of the P sets of phase rotated symbols. At least one symbol from each set of phase rotated symbols appears in each output sequence, where M>=2, 2<=P<=M, and T>=M and M>=K.

Abstract: Compressed memory systems are provided to reduce latency associated with accessing compressed memory using stratified compressed memory architectures and memory organization protocols in which a region of compressed main memory is allocated as a direct access memory (DAM) region for storing uncompressed data items. The uncompressed data items in the DAM region can be directly accessed, speculatively, to serve access requests to main memory, requiring access to compressed memory in the event of a DAM miss.

Abstract: System and method for decompressing data. A compressed data stream including contiguous variable length blocks is received, each block including multiple contiguous variable length data fields and a tag portion that includes multiple contiguous tag fields corresponding respectively to the data fields. Each tag field stores a tag value specifying a size of a respective field in the block. A current variable length block is stored. A single machine instruction of a processor is executed that analyzes the tag portion of the current block, and creates a control pattern, storing the control pattern in a first register of the processor. The control pattern is configured to unpack the variable length data fields of the current variable length block into corresponding uniform data fields. The contiguous variable length data fields of the current variable length block are decompressed using the control pattern, thereby decompressing the compressed data stream.

Abstract: Trace circuitry, and a method of operating such trace circuitry, are provided for generating a trace stream indicative of activities of monitored circuitry of a data processing apparatus. The monitored circuitry produces data elements indicative of those activities, and the trace circuitry comprises trace element generation circuitry which is responsive to at least some of the data elements produced by the monitored circuitry to generate trace elements representative of those data-elements, with the trace elements generated being dependent on a selected trace mode of operation of the trace circuitry. Compression circuitry is then arranged to apply an encoding operation to a sequence of trace elements in order to produce a packet whose bit pattern represents the sequence of trace elements, and to cause that packet to be output in the trace stream, the encoding operation applied being dependent on a current compression scheme associated with the compression circuitry.

Abstract: A method (and system) of storing information, includes storing main memory compressed information onto a memory compressed disk, where pages are stored and retrieved individually, without decompressing the main memory compressed information.

Abstract: An encoded code stream is searched for a frame generally coincident with a specific frame without having to decoding the frame to its original image. The present invention provides an image search device that searches an object encoded code stream formed by compression coding of a plurality of frames for a frame generally coincident with a specific one, which includes a decoder for making entropy decoding of the object encoded code stream to generate quantization coefficients of each frame, a matching unit for making matching between the quantization coefficients of the specific frame and those of each frame which are generated by the decoder and correspond in sample position to those of the specific frame, and a judging unit for judging, based on the result of matching, whether the frame is generally coincident with the specific one.

Abstract: A matrix architecture for KVM extenders connecting a plurality of console terminals and a plurality of computers. The matrix architecture for KVM extenders includes a plurality of first extenders and a plurality of second extenders. The first extenders transform keyboard, mouse analog signals into keyboard, mouse data packets and transform video data packets into video signals for console terminals. The second extenders transform video signals into video data packets and transform keyboard, mouse data packets into keyboard, mouse analog signals. The broadcasters broadcast keyboard, video, mouse data packets, each having a source address and a target address to couple computers to console terminals by broadcasting video data packets from second extenders to first extenders and to couple console terminals to computers by broadcasting keyboard, mouse data packets from first extenders to second extenders.

Abstract: An image processor for lowering data transfer speed. A JPEG compression circuit performs two-dimensional compression process on data output from a YCbCr conversion circuit to generate compressed image data. A timing signal generator changes the frequency of a transfer clock signal in accordance with the compressed image data. An output circuit outputs the compressed image data in accordance with the transfer clock signal.

Abstract: A data logger is disclosed wherein a common housing includes different function blocks which are connected to one another. These function blocks include at least one analog/digital converter for conversion of measurement signals into digital input data, a memory unit for recording of digital data and of digitized event data, a timer, a processor unit for processing of data, a power supply source and input and output interfaces for measurement signals or digital data and event data. The processor unit is configured for conversion of digital input data and time data into a format which is compatible with standardized software (e.g., freely available) and which makes it possible to display the processed data using standardized software in tabular and/or graphic form on an output device.

Abstract: An integrated circuit 2 is provided including multiple devices 4, 6, 8, 10, 12, 14 for communicating via an interconnect 16. A sending device 18 includes a sideband signal indicating the use of a representation of a repeating data word in place of that repeating data word itself. The receiving device can then form the repeating pattern of data words in response to receipt of the representation. This reduces the bandwidth consumed upon the interconnect 16.

Abstract: An instruction code compression method and an instruction fetch circuit which are capable of reducing both the number of fetches and program codes. A reuse flag is provided in an upper bit group including operational codes, and a lower bit group including operands and having the same number of bits as the upper bit group. When 2N+1 (N is an integer of 1 or more) instruction codes having the same upper bit group continues in a series of instruction codes, respective reuse flags of the lower bit group of a 2n-th (n is an integer of 1 or more and N or less) instruction code and a (2n+1)-th instruction code in the series of instruction codes are set to “1”, and the lower bit groups of the 2n-th and (2n+1)-th instruction codes are integreted into one compressed instruction code.

Abstract: Associative matrix compression methods, systems, computer program products and data structures compress an association matrix that contains counts that indicate associations among pairs of attributes. Selective bit plane representations of those selected segments of the association matrix that have at least one count is performed, to allow compression. More specifically, a set of segments is generated, a respective one of which defines a subset, greater than one, of the pairs of attributes. Selective identifications of those segments that have at least one count are stored. The at least one count that is associated with a respective identified segment is also stored as at least one bit plane representation. The at least one bit plane representation identifies a value of the at least one associated count for a bit position of the count that corresponds to the associated bit plane.

Abstract: A method and apparatus for determining a bandwidth needed for services to be provided over an Internet Protocol (IP) network such as a Voice over Internet Protocol (VoIP) network and a Service over Internet Protocol (SoIP) network are disclosed. For example, the service provider utilizes a tool (e.g., an algorithm or a software application) that calculates the effective compression ratio and effective data rate of traffic on an IP network based on customer specified traffic information and standards for coding, protocol overhead, sampling, etc. In one embodiment, the network service provider presents a menu to a customer to allow the customer to enter the pertinent traffic information. Once the traffic information is received, the tool will determine the Effective Data Rate (EDR) and Effective Compression Ratio (ECR).

Abstract: A data compression and decompression apparatus according to an embodiment of the present invention comprises: a plurality of compression modules that implements compression algorithms with the same compression rate and different throughputs, respectively, a plurality of decompression modules that implements decompression algorithms corresponding to the compression algorithms of the compression modules, respectively, and an algorithm switching unit that switches a compression module to be used for compression of the write data and a decompression module to be used for decompression of the compressed data according to a progress of data processing in the data processing module.

Abstract: An embedded system comprises a storage device, a main memory, and an operating system (OS). The storage device stores executable files, data files, and at least one dependency tag of an application which have been installed on the embedded system. The dependency tag records relationships between the application and related data files utilized by the application under various execution statuses. The OS comprises a module which, when requested to execute the application, locates the related data files of the application according to the dependency tag, loads the executable file and the related data files to the main memory, and execute the executable file.

Abstract: An information recording/reproducing system has a data storage device that stores a data stream with a predetermined data format and an information recording/reproducing apparatus, which is connected with the data storage device, for recording and reproducing the data stream. The apparatus includes information recording/reproducing portion and memory portion that stores plural species of empty data file bodies each in which additional information corresponding to a species of data format and data are assigned to loading regions. The apparatus also has selection portion that selects an empty data file body with a specified data format from the plural species of empty data file bodies. The apparatus further has information-loading portion that loads the additional information and the data into predetermined loading regions assigned in the empty data file body that has been selected by the selection portion.

Abstract: Disclosed herein is an electronic device network including a plurality of electronic devices. The electronic devices may each have update agents capable of selectively decompressing compressed code and/or compressed data segments. The update agents may also be adapted to employ the decompressed code and data segments in conjunction with additional update information to update the firmware and/or software, compressed or otherwise, resident in the electronic devices. An update generator may be adapted to employ compression and decompression techniques to extract compressed code and data segments from a plurality of memory images stored in the electronic devices. The update generator may also be adapted to process the extracted information and generate update packages using the decompressed code and data segments and the additional update information. The update generator may also be adapted to selectively compress the update information in generated update packages usable for updating the electronic devices.

Abstract: A computer-implemented method, system and computer program product for arbitrarily aligning vector operands, which are transmitted in inter-thread communication buffer packets within a highly threaded Network On a Chip (NOC) processor, are presented. A set of multiplexers in a node in the NOC realigns and extracts data word aggregations from an incoming compressed inter-thread communication buffer packet. The extracted data word aggregations are used as operands by an execution unit within the node.

Abstract: Data storage controllers and data storage devices employing lossless or lossy data compression and decompression to provide accelerated data storage and retrieval bandwidth. In one embodiment of the invention, a composite disk controller provides data storage and retrieval acceleration using multiple caches for data pipelining and increased throughput. In another embodiment of the invention, the disk controller with acceleration is embedded in the storage device and utilized for data storage and retrieval acceleration.

Abstract: Embodiments of the present invention are directed to a microcontroller which includes a Register Load Assist engine. The microcontroller can include no or minimal non-volatile memory which stores boot data. Thus, most of the boot data can be stored at a non-volatile memory external to the microcontroller. An external circuit can read the externally positioned non-volatile memory and send compressed boot data to the microcontroller. The boot data can be originally stored in compressed form in the external non-volatile memory or it can be compressed by the external circuit. The boot data can be received by the microcontroller and saved in an intermediate location in the microcontroller's internal volatile memory. The RLA engine can then uncompress the boot data and store various portions of it in their final destinations (such as, for example, in respective registers).

Abstract: An embodiment of the present invention is a system and method relating to shrinking, or optimizing, executable images resulting is a savings of storage space. In at least one embodiment, the present invention removes unnecessary fields, or information, from an executable image header before storing the image on a flash for a target platform. The removal of information that is irrelevant to the target platform allows the executable to take up less space on the flash memory. When loaded, the image is interpreted based on the optimized header information. In an embodiment, the image may be further compressed by known methods, to save additional space. Other embodiments are described and claimed.