Abstract: Presented herein are system(s), method(s), and apparatus for converting unsigned fixed length codes to signed fixed length codes. In one embodiment, there is presented a circuit for converting an unsigned code to a signed code. The circuit comprises a multiplexer. The multiplexer comprises a first input, a second input, and an output. The first input receives a first value, the first value being the right shifted unsigned code plus one. The second input receives a second value, the second value being an inverse of a right shifted unsigned code plus one. The output outputs a selected one of the first value received by the first input or the second value received by the second input. The multiplexer selects the selected one of the first value or the second value based on a least significant bit of the unsigned code.

Abstract: Digital signal processing (“DSP”) circuit blocks are provided that can more easily work together to perform larger (e.g., more complex and/or more arithmetically precise) DSP operations if desired. These DSP blocks may also include redundancy circuitry that facilitates stitching together multiple such blocks despite an inability to use some block (e.g., because of a circuit defect). Systolic registers may be included at various points in the DSP blocks to facilitate use of the blocks to implement systolic form, finite-impulse-response (“FIR”), digital filters.

Abstract: In a method and arrangement for preparation of data for loading from a first data processing device into a second data processing device via a first data connection, a number of transmission-ready transmission data packets are generated in at least one packetizing step from the data to be loaded into the second data processing device; and at least one load parameter influencing the total load time until a complete loading of the data into the second data processing device is determined in a determination step preceding the packetizing step. The generation of the transmission data packets ensues in the at least one packetizing step dependent on the first load parameter.

Abstract: The present invention relates to communication technologies, and provides a decompression method for communication network, in which such fields as an SN are compressed by using an ROHC scheme, so that the compression efficiency is increased. The ROHC uses a WLSB algorithm to compress some fields which change regularly, and decodes by using the decompressor's context through transmitting the low significant bits in these fields. In order to avoid using the inefficient ergodic method and the incorrect direct replacing method in low bits, the present invention selects, based on the mathematical characteristics of the definition of interpretation intervals, to decode by using the method that the low bits is determined by the received k significant bits while the high bits is determined jointly by the local storage information and these k significant bits. Its decoding method can be used for decompression of an SN, a TS and an IP-ID in an ROHC compression.

Abstract: A mobile handset network employs a generator to generate update packages and a corresponding update agent in mobile handset to update its firmware and/or software. The generator may employ multiple instruction streams and efficient encoding techniques to make the generated update packages efficient and compact. One of the multiple instruction streams may be used for variable length integers (VLI), which employs groups of a certain number of bits that can be extended as needed.

Abstract: A system and method for waveform compression includes preprocessing a collection of waveforms representing cell and/or interconnect response waveforms and constructing a representative waveform basis using linear algebra to create basis waveforms for a larger set of waveforms. The collection waveforms are represented as linear combination coefficients of an adaptive subset of the basis waveforms to compress an amount of stored information needed to reproduce the collection of waveforms. The representation of coefficients may be further compressed by, e.g., analytic representation.

Abstract: The present application addresses a fundamental problem in the design of computing systems, that of minimising the cost of memory access. This is a fundamental limitation on the design of computer systems as regardless of the memory technology or manner of connection to the processor, there is a maximum limitation on how much data can be transferred between processor and memory in a given time, this is the available memory bandwidth and the limitation of compute power by available memory bandwidth is often referred to as the memory-wall. The solution provided creates a map of a data structure to be compressed, the map representing the locations of non-trivial data values in the structure (e.g. non-zero values) and deleting the trivial data values from the structure to provide a compressed structure.

Abstract: A computation apparatus includes an inverse conversion table creation unit configured to create an inverse conversion table in which discrete values obtained by applying a predetermined conversion on predetermined data correspond to inverse conversion values obtained by applying a conversion inverse to the predetermined conversion on the discrete values, a range decision unit configured to decide in which range the predetermined data is included when the predetermined data is input among ranges where the inverse conversion values adjacent in the inverse conversion table are set as border values, and a discrete value decision unit configured to decide the discrete value corresponding to the inverse discrete value whose value is close to the predetermined data among the inverse conversion values serving as the border values of the range decided by the range decision unit.

Abstract: Predictive lossless coding provides effective lossless image compression of both photographic and graphics content in image and video media. Predictive lossless coding can operate on a macroblock basis for compatibility with existing image and video codecs. Predictive lossless coding chooses and applies one of multiple available differential pulse-code modulation (DPCM) modes to individual macro-blocks to produce DPCM residuals having a closer to optimal distribution for run-length, Golomb Rice RLGR entropy encoding. This permits effective lossless entropy encoding despite the differing characteristics of photographic and graphics image content.

Abstract: The use of the ordinary Poisson iterative reconstruction algorithm in PET requires the estimation of expected random coincidences. In a clinical environment, random coincidences are often acquired with a delayed coincidence technique, and expected randoms are estimated through variance reduction (VR) of measured delayed coincidences. In this paper we present iterative VR algorithms for random compressed sinograms, when previously known methods are not applicable. Iterative methods have the advantage of easy adaptation to any acquisition geometry and of allowing the estimation of singles rates at the crystal level when the number of crystals is relatively small. Two types of sinogram compression are considered: axial (span) rebinning and transaxial mashing. A monotonic sequential coordinate descent algorithm, which optimizes the Least Squares objective function, is investigated.

Abstract: Processing data presented in the form of a vector representation involves representing direction of the vector with incremental accuracy by using a set of vector codebooks of decreasing dimensions per accuracy increment.

Abstract: An encryption device and method and decryption device and method which implement a bit-based encryption scheme and hardware design. The encryption device includes a random number generator, receiving a main key, determining a working key using at least one random number and outputting a working key, a model, receiving the main key, the working key and plain text to be encoded and generating at least two frequency counts. The encryption device further includes an encoder, which outputs encoded text based on the working key, the plain text and the at least two frequency counts. The encryption device and method and decryption device and method process encrypted text that is based upon a stream structure with an unlimited key length and may be compressed by 50%. The encoded text is changeable with different environments even for the same plain text and the same key. Operations of the hardware design are based on arithmetic additions and shifts, and not multiplications and divisions.

Abstract: The described embodiments provide a system that encodes a sequence of integers using a variable-length compression technique. During operation, the system scans the sequence of integers and observes the sizes of the integers to determine a threshold value, K, from the observed sizes. For a given integer of length N bits, if N?K is greater than zero, the system generates a tag for the encoded integer comprising a sequence of N?K zeros followed by a one, and generates a set of remaining bits for the encoded integer as a sequence of the N?1 least-significant bits which make up the integer. Otherwise, the system generates a tag for the encoded integer as a single one, and generates a set of remaining bits for the encoded integer by padding the N bits which make up the integer with zeros so that the set of remaining bits is K bits in length.

Abstract: A method of decoding symbols in which a first codeword has been spread by a second codeword to recover first information and second information is provided. The decoding occurs jointly, with an overall output determining both the first and second information. A first parallel code multiplying operation for each codeword of the second code is followed by a second parallel code multiplying operation for the first code. An overall maximum output of the second parallel code multiplying operations determines the output information.

Abstract: Protocols and architecture for secure virtual private networks. Intraenterprise data communications are supported in a secure manner over the Internet or other public network space with the implementation of secure virtual private networks. Members of a virtual private network group exchange data that may be compressed, encrypted and authenticated, if the exchange is between members of the group.

Abstract: We describe a method for dense encoding of information. Bennet and Wiesner (Phys. Rev. Lett. 69:2881-2884, 1992), using EPR-pairs, showed that n bits can be encoded by n/2 quantum-bits, from which the original bits can be retrieved. Here, in a completely different (non-quantum) setting, we give a method for more dense encoding: In our method n bits x1, x2, . . . , xn are mapped by a linear transform B over the 6-element ring Z6 to numbers z1, z2, . . . , zt from ring Z6 with t=no(1)(i.e., much fewer numbers) (Quantity o(1) here denotes a positive number which goes to 0 as n goes to infinity), then, by applying another linear transform C to these zi's, we will get back n elements of ring Z6, x?1, x?2, . . . , x?n, where, e.g., x?1 may have the form x?1=x1+3x2+4x3. One can get back x1 simply by running through the values of xi on the set 0, 1, 2, 3, 4, 5, and noticing that only x1 has period 6, (3x2 has period 2, 4x3 has period 3). Our results generalize for any non-prime-power composite number m instead of 6.

Abstract: A system and method for clustered tunneling of requests in application servers and other systems is provided. The system includes a client, a cluster having a plurality of members, and a proxy. The cluster does not advertise the internal addresses of its members since clients might attempt to directly connect to that member. Instead, the client is configured to include a tunneling layer within which the proxy address is set. The advertised address of the cluster member is then set in a header at the client. During runtime, the client connects to the proxy as before, but then uses its internal information to connect or communicate with the appropriate cluster member. In accordance with an embodiment the client sets a cookie which is then sent to the proxy. The proxy re-writes the cookie with the appropriate cluster member information and uses this information to tunnel the request to the appropriate server.

Abstract: For one disclosed embodiment, a converter converts 2N-bit data into an N-bit value indicating a number of bits in the data that have a predetermined logical value. The converter includes N comparators, each determining whether the number of bits in the data having the predetermined logical value exceeds a respective one of a plurality of reference values. The N-bit value is generated based on the outputs of the comparators. For another disclosed embodiment, a first delay element delays a signal based on a number of bits in a data value having a predetermined logical value, and a second delay element delays the signal based on a number of bits in a reference value having the predetermined logical value. A comparator then generates a bit value based on the delayed signals.

Abstract: Systems and methods compress and decompress 16 bit data. The 16 bit data may be signed or unsigned and represented in a fixed point or floating point format. A fixed block size of data is compressed into a fixed length format. Data compressed using a medium quality compression scheme may be efficiently decompressed in hardware. Data may be efficiently compressed and decompressed in hardware using a high quality compression scheme. The high quality compression scheme has a lower compression ratio compared with the medium quality compression scheme, but is near lossless in terms of quality.

Abstract: A method, computer program product and system for balancing compression efficiency against access performance. Source data is read from a database row by row and column by column within each row. Algorithm(s) are selected to compress the data read for each column. Algorithms are selected in a manner that closely maximizes the amount of data stored in a given amount of disk space but requires minimal system resources to decompress the compressed data. These algorithms are stored in a control block. Further, parameters that allow the read data to be stored in a compressed manner efficiently are stored in the control block. Upon a second reading of the source data, data is compressed column by column using the appropriate algorithms and parameters. The compressed data may then be decompressed using the appropriate algorithms and parameters. In this manner, a better balance may be realized between compression efficiency and access performance.

Abstract: A method of coding audio and/or video data. A data symbol may be coded using an exponent and a residual, in which the exponent is coded using a variable length code, such as but not limited to a Huffman code or a Golomb code. The variable length code may be adaptive and may code according to probabilities or frequencies of occurrence of the data symbol.

Abstract: Methods and apparatus to compress a dataset include: obtaining a first block of a dataset to be compressed; computing a proxy for at least a portion of the first block; comparing the proxy to a set of proxies representative of previously stored blocks; and, if the proxy for the at least the portion of the first block matches a proxy in the set of proxies, storing a data structure that maps the at least the portion of the first block to at least a portion of a previously stored block associated with the matching proxy without storing the at least the portion of the first block.

Abstract: A method of confirming a certificate by using a management computer that issues the certificate is disclosed. The management computer is coupled to an application terminal for applying for issuance of the certificate and to a confirmation terminal for reading a display code printed on the certificate.

Abstract: A method for determining a grouping of segments within a market. The method includes forming a bias mitigated square matrix from a square matrix populated with second choice data, and forming a compressed matrix from the bias mitigated square matrix. Each different segment is initially associated with a row of the square matrix and a column of the square matrix. The method also includes determining a matrix consistency score for the compressed matrix, forming at least one additional compressed matrix from the bias mitigated square matrix, and determining matrix consistency scores for each additional compressed matrix. The method further includes determining which matrix consistency score is best.

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: An image coding method is provided, in which the method includes the steps of: extracting edge information which represents an edge part of an original image; obtaining density information of an edge smoothed image from the original image by smoothing the edge part; obtaining coded edge information by coding the edge information according to a first coding algorithm; obtaining coded density information by coding the density information of the edge smoothed image according to a second coding algorithm; and sending the coded edge information and the coded density information as coded information to an image decoding apparatus.

Abstract: An encryption technique and a decryption technique that are applied to video data that is encrypted on a predetermined domain of compressed video data are disclosed. For example, JPEG2000 compressed video data can be compressed using a wavelet conversion. Compressed video data is input. The input video data is decompressed to a predetermined domain of the compression process, and the decompressed video data is then encrypted. The encrypted video data is then compressed in accordance with the decompression process, and information representing the encrypted compression domain is stored in a predetermined area of the compressed video data.

Abstract: An image processing method comprising: a decoding processing step of applying decoding processing to a first kind of image data and a second kind of image data; a first resolution conversion processing step of applying first resolution conversion processing to the first kind of image data subjected to decoding processing; a parameter acquisition step of acquiring a parameter for resolution conversion of the second kind of image data subjected to decoding processing, on the basis of a result of the first resolution conversion processing; and a second resolution conversion processing step of applying a second resolution conversion processing to the second kind of image data subjected to decoding processing by using the acquired parameter.

Abstract: Systems and methods for analyzing ratiometric data, e.g., ratiometric image data such as fluorescent image data.

Abstract: A control system database server is disclosed that includes a data compression facility that implements a compression test sequence on streams of time stamped data points rendered by components of a control system. A deadband/time override is incorporated into the compression test sequence to ensure that a previously received data point, within the stream of received data points, is saved within a designated time period even if the compression test sequence would have determined that the data point be discarded. The series of compressed/tabled data points, corresponding to the received steams of data points, are thereafter provided by the historian to requesting client applications that, by way of example, retrieve the compressed, time stamped data point streams for the purpose of constructing and displaying trend graphs.

Abstract: A table, such as a database table can be partitioned into blocks that are conveniently sized for storage and retrieval. The amount of storage space required and the speed of storing and retrieving blocks is proportional to the size of the blocks. Compressing the blocks leads to less required space and more speed. The columns in a table, and therefore the rows in a transposed block, tend to contain similar data. Compression algorithms can work more efficiently when sequential data items are similar. Therefore, transposing the blocks before compression or compressing them in a column-wise manner leads to better compression. Different compression algorithms can be used for each set of columnar data to yield even better compression.

Abstract: A system, apparatus and a method for implementing a secured communications link at a layer other than that at which packets are filtered are disclosed. In one embodiment, a computer system is configured to form a virtual private network (“VPN”) and comprises an address inspection driver to identify initial target packet traffic addressed to a target server. Also, the computer system includes a pseudo server module to receive rerouted initial target packet traffic from the address inspection driver. The pseudo server module is configured to convey packet regeneration instructions to a VPN gateway. The address inspection driver functions to identify additional target packet traffic addressed to the target server and routes the additional target packet traffic to the pseudo server. In one embodiment, the pseudo server is configured to strip header information from the additional target packet traffic to form a payload, and thereafter, to route the payload to the target server.

Abstract: A matrix by vector multiplication processing system (1) comprises a compression engine (2) for receiving and dynamically compressing a stream of elements of a matrix; in which the matrix elements are clustered, and in which the matrix elements are in numerical floating point format, and a memory (SDRAM, 3) for storing the compressed matrix. It also comprises a decompression engine (4) for dynamically decompressing elements retrieved from the memory (3), and a processor (10) for dynamically receiving decompressed elements from the decompression engine (3), and comprising a vector cache (13, 19), and multiplication logic (12, 21) for dynamically multiplying elements of the vector cache with the matrix elements. There is a cache (13) for vector elements to be multiplied by matrix elements to one side of a diagonal, and a separate cache or register (19) for vector elements to be multiplied by matrix elements to the other side of the diagonal.

Abstract: An apparatus to implement a deflate process in a compression engine. An embodiment of the apparatus includes a hash table, a dictionary, comparison logic, and encoding logic. The hash table is configured to hash a plurality of characters of an input data stream to provide a hash address. The dictionary is configured to provide a plurality of distance values in parallel based on the hash address. The distance values are stored in the dictionary. The comparison logic is configured to identify a corresponding length for each matching distance value from the plurality of distance values. The encoding logic is configured to encode the longest length and the matching distance value as a portion of a LZ77 code stream.

Abstract: A cryptosystem based on a Jacobian of a hyperelliptic curve is being used. Various methods and apparati are provided for generating a compressed data format that identifies one or more points—on the Jacobian of the hyperelliptic curve, and for subsequently decompressing the compressed format data.

Abstract: A method includes receiving an original string of bits where each of the bits represents one of two possible logic levels. The string of bits also carries information. A new string is formed, based on the original string, which contains all of the information of the original string by using fewer bits of one of the logic levels.

Abstract: An apparatus for compressing media content is disclosed. The apparatus divides the media content into at least three predetermined portions, compresses each of the at least three portions using one of at least three different compression algorithms and makes the at least three compressed predetermined portions publicly available. Making the portions publicly available includes, for example, transmitting the portions over a computer network such as the Internet.

Abstract: A lattice dividing unit determines lattice lines to divide parameters of all points of a picture at every division and supplies distortion correction parameters (distortion correction coordinates) on the lattice points to a distortion correction memory (not shown). A polynomial of degree n coefficient deriving unit expresses all distortion correction coordinates on each lattice line in the form of a function relative to positions on lattice lines and approximates the distortion correction coordinates by desired division polynomial of degree n. Further, a sample point deriving unit compresses distortion correction parameters based upon the division polynomial of degree n obtained from the polynomial of degree n coefficient deriving unit.

Abstract: A method and apparatus are disclosed for use with multiple input, multiple output (MIMO) signal processing techniques, which reduce the amount of memory and memory bandwidth used to store and access filter coefficients by compressing a filter coefficient based at least in part on one or more neighboring filter coefficients for storage and decompressing the filter coefficients when retrieved. The decompressed filter coefficients can be used with a MIMO filtering technique, and/or can be used to compress or decompress additional coefficients.

Abstract: A lattice dividing unit determines lattice lines to divide parameters of all points of a picture at every division and supplies distortion correction parameters (distortion correction coordinates) on the lattice points to a distortion correction memory (not shown). A polynomial of degree n coefficient deriving unit expresses all distortion correction coordinates on each lattice line in the form of a function relative to positions on lattice lines and approximates the distortion correction coordinates by desired division polynomial of degree n. Further, a sample point deriving unit compresses distortion correction parameters based upon the division polynomial of degree n obtained from the polynomial of degree n coefficient deriving unit.

Abstract: A system and method for effectively storing compressed information in an electronic device includes a memory device coupled to the electronic device for storing the compressed information. A compression module sequentially performs a forward write procedure to store first components of the compressed information. The forward write procedure begins at a top location of the memory device. The compression module concurrently performs a reverse write procedure to store second components and third components of the compressed information sequentially in an interlaced configuration. The reverse write procedure begins at a bottom location of the memory device.

Abstract: An mage forming device and image forming method capable of performing selective data compression. Printing data transmitted from a host computer are stored in RAM and developed into image data by CPU. The CPU determines whether or not the greatest raster length in the image data of each page exceeds a reference value that represents the data transfer ability of the laser printer (and corresponds to the value of 80% of the largest printing width of the laser printer) on a page by pages. If the greatest raster length exceeds the reference value, the image data of the page are compressed by the CPU and stored in the RAM. If the greatest raster length do not exceed the value, the image data of the page are stored in the RAM without being compressed. Then, the image data stored in the RAM are sent to an ASIC on a raster by raster basis. Only compressed image data are decompressed and the decompressed data then are transferred to a laser unit. Non-compressed image data per se are transferred to the laser unit.

Abstract: A database system includes an enhanced technique for performing sorts in which removals of duplicate records are performed to compact the size of segments being sorted. To enhance a query plan, the duplicate record removal is performed as early in the query plan as possible. By removing duplicate records early in the query plan, the number of input/output (I/O) operations is reduced, resulting in more efficient usage of database system resources. In example implementations, two type of sorts are performed: a heap sort (to sort successive segments of an input file, with the sorting associated with concurrent removal of duplicate records to compact each segment so that a smaller number of I/O accesses is needed); and a merge sort (in which output files from prior sorting passes are merged and sorted, with the merge sort process also associated with the removal of duplicate records to further compact the data segments and reduce the number of I/O accesses).

Abstract: A computer-based method for scanning data using string filtering includes compressing a data string using a hashing algorithm to obtain a data-string signature, and then determining that the data-string signature matches a known data-string signatures stored in a lookup table if the signature is determined to have a match in the lookup table.

Abstract: A data processing system including an instruction cache 8 and an instruction decompression circuit 10 between the instruction cache 8 and a compressed instruction data memory 12. The instruction decompression circuit decompresses compressed instruction data CID recovered from the compressed instruction data memory and forms program instructions which are supplied to the instruction cache. The program instructions are compressed in blocks of program instructions with an associated mask value where the bit values within the mask indicate whether corresponding bit slices within the blocks of program instructions are to be represented by a default bit value or a separately specified by bit slice specifier values. This technique is particularly well suited to VLIW processors.

Abstract: A lattice dividing unit determines lattice lines to divide parameters of all points of a picture at every division and supplies distortion correction parameters (distortion correction coordinates) on the lattice points to a distortion correction memory. A polynomial of degree n coefficient deriving unit expresses all distortion correction coordinates on each lattice line in the form of a function relative to positions on lattice lines and approximates the distortion correction coordinates by desired division polynomial of degree n. Further, a sample point deriving unit compresses distortion correction parameters based upon the division polynomial of degree n obtained from the polynomial of degree n coefficient deriving unit. In the derived division polynomial of degree n, internal points which result from dividing both ends of the division polynomial of degree n by n is supplied to the distortion correction memory as new distortion correction parameters (approximated distortion correction coordinates).

Abstract: Analog data is compressed by processing certain data from data storage and interpolating data between data points which fall within an acceptable error range. Data points are compressed by modifying or eliminating data depending upon the slope relationship of a stored data point to artificial data points, which are representative of the range of accepted deviations from the original data point.

Abstract: Systems and methods for efficient storage of network management object identifiers are provided. Object identifiers such as SNMP MIB object identifiers are stored in a compressed form. In one embodiment, a single integer represents multiple elements of an object identifier where these elements are common to many identifiers. The redundancy inherent in a standard object identifier format is thereby greatly reduced. Large memory savings are provided in network management systems that employ many network management objects.

Abstract: A trace data compression system includes a data acquisition circuit which is configured to acquire address information for identifying an address for reading or writing operation of a microcomputer which performs predetermined processing, and data information as operand data stored in the address; an address information compression circuit which is configured to compress the address information having been acquired by the data acquisition circuit and output the address information as compressed; a data information compression circuit which is configured to compress the data information having been acquired by the data acquisition circuit and output the data information as compressed; a data output circuit which is configured to output variable length data containing the address information having been compressed and outputted by the address information compression circuit and the data information having been compressed and outputted by the data information compression circuit.

Abstract: An adaptive compression technique which is an improvement to Lempel-Ziv (LZ) compression techniques, both as applied for purposes of reducing required storage space and for reducing the transmission time associated with transferring data from point to point. Pre-filled compression dictionaries are utilized to address the problem with prior Lempel-Ziv techniques in which the compression software starts with an empty compression dictionary, whereby little compression is achieved until the dictionary has been filled with sequences common in the data being compressed. In accordance with the invention, the compression dictionary is pre-filled, prior to the beginning of the data compression, with letter sequences, words and/or phrases frequent in the domain from which the data being compressed is drawn. The letter sequences, words, and/or phrases used in the pre-filled compression dictionary may be determined by statistically sampling text data from the same genre of text.