Настройки

Укажите год
-

Небесная энциклопедия

Космические корабли и станции, автоматические КА и методы их проектирования, бортовые комплексы управления, системы и средства жизнеобеспечения, особенности технологии производства ракетно-космических систем

Подробнее
-

Мониторинг СМИ

Мониторинг СМИ и социальных сетей. Сканирование интернета, новостных сайтов, специализированных контентных площадок на базе мессенджеров. Гибкие настройки фильтров и первоначальных источников.

Подробнее

Форма поиска

Поддерживает ввод нескольких поисковых фраз (по одной на строку). При поиске обеспечивает поддержку морфологии русского и английского языка
Ведите корректный номера.
Ведите корректный номера.
Ведите корректный номера.
Ведите корректный номера.
Укажите год
Укажите год
Применить Всего найдено 7783. Отображено 100.
19-01-2012 дата публикации

Method for Compressing Information

Номер: US20120016918A1
Автор: Jae Won Oh
Принадлежит: Individual

Provided is a method of compressing information. The method includes converting compression target information into a binary number, converting the binary number into a decimal number a, performing operation of a discriminant S = 1 + 1 + 8  a 2 and obtaining a result S of the discriminant in order to operate “b” and “k” of a one-to-one correspondence function of the decimal number, obtaining “b” and “k” as a result of the discriminant, determining whether or not compression target information can be compressed based on the obtained “b” and “k” and the decimal number, and obtaining “b”, “k”, and least significant digit of the compression target information converted into binary number by repeating the first to third steps until it is determined that the compression target information can be compressed, and outputting a compressed information by incorporating the obtained “b”, “k”, and least significant digit of the binary number, wherein the least significant digit of the compression target information converted into binary number is removed and input as the compression target information during the repeating.

Подробнее
Номер записи: 1
19-01-2012 дата публикации

Index rank optimization system and method

Номер: US20120016963A1
Автор: Benjamin Cappel Hendrickson, Nicholas Stefan Gerner, S. Rand Mitchell Fishkin
Принадлежит: SEOMOZ Inc

An index ranking optimization system and method are provided herein.

Подробнее
Номер записи: 2
29-03-2012 дата публикации

System, methods, and media for providing in-memory non-relational databases

Номер: US20120079484A1
Автор: Ofer Bengal, Yiftach Shoolman
Принадлежит: Individual

Providing a first control process that executes in a hardware processor; providing a first server process that executes in a hardware processor, that responds to write requests by storing objects in in-memory, non-relational data store, and that responds to read requests by providing objects from in-memory, non-relational data store, wherein the objects each have an object size; forming a plurality of persistent connections between the first control process and the first server process; using the first control process, pipelining, using a pipeline having a pipeline size, requests that include the read requests and the write requests over at least one of the plurality of persistent connections; using the first control process, adjusting the number of plurality of persistent connections and the pipeline size based on an average of the object sizes; and using the first control process, prioritizing requests by request type based on anticipated load from the requests.

Подробнее
Номер записи: 3
14-06-2012 дата публикации

Codeword adaptation for variable length coding

Номер: US20120147947A1
Автор: Liwei Guo, Marta Karczewicz, Wei-Jung Chien, Xianglin Wang
Принадлежит: Qualcomm Inc

In one example, this disclosure describes a method of codeword adaptation for variable length coding. The method includes applying a first codeword adaptation scheme to groups of codewords in a variable length coding (VLC) table to change mappings of codewords within the groups to events in the VLC table; and applying a second codeword adaptation scheme to individual codewords within the groups of codewords in the VLC table to change mappings of the codewords to the events within the groups in the VLC table.

Подробнее
Номер записи: 4
05-07-2012 дата публикации

Dynamic decoding lookup table generation method and electronic device applying the same

Номер: US20120169518A1
Автор: Tse-Min Chen, Wen-Shan Wang
Принадлежит: Industrial Technology Research Institute ITRI

A dynamic decoding lookup table generation method is provided. The generation method includes: receiving a variable length coding (VLC) table; and dynamically establishing an adaptive decoding lookup table from the VLC table according to a target decoding rate and a free system memory resource.

Подробнее
Номер записи: 5
19-07-2012 дата публикации

Macro-block encoding of skipped video frames

Номер: US20120183058A1
Автор: Kumar Arrakutti Desappan, Pramod Kumar Swami
Принадлежит: Texas Instruments Inc

A video system includes an encoder for generating a compressed bit stream in response to a received video signal. A transitional location is located in the bit stream that includes skip macro-block encoding, where the transitional location provides an indication where a linear relationship starts to exist between a length of the encoded bit stream and a length of a number of skipped macro-blocks. The skipped macro-blocks in the bit stream before the transitional location are encoded using a predetermined nonlinear relationship between the length of the encoded bit stream and the length of the number of skipped macro-blocks, whereas skipped macro-blocks in the bit stream are encoded using a linear relationship between the length of the encoded bit stream and the length of the number of skipped macro-blocks.

Подробнее
Номер записи: 6
26-07-2012 дата публикации

Position coding for context-based adaptive variable length coding

Номер: US20120189222A1
Автор: Dihong Tian, Pi Sheng Chang, Wen-Hsiung Chen
Принадлежит: Individual

Particular embodiments include a method, an apparatus, and logic embodied in tangible computer-readable medium that when executed carries out a method of encoding an ordered sequence of quantized transform coefficients of a block of image data. One embodiment is a context adaptive variable length coding method that includes position coding the positions of zero-valued and non-zero valued coefficients by either a mixed method that encodes either the run length of zeroes preceding a non-zero coefficient or the run length of nonzero-valued coefficients preceding a zero-valued coefficients. Another includes position coding that uses a variable length code for two parameters respectively indicating the number of zero-valued coefficient positions and nonzero-valued coefficient positions still to be coded.

Подробнее
Номер записи: 7
02-08-2012 дата публикации

Methods and devices for load balancing in parallel entropy coding and decoding

Номер: US20120194363A1
Автор: Dake He, En-hui Yang, Gaëlle Christine Martin-Cocher, Gergely Ferenc Korodi
Принадлежит: Research in Motion Ltd

Devices and methods for entropy decoding a bitstream of encoded data by extracting a plurality of encoded subsequences from a payload field of the bitstream for parallel decoding on a set of parallel entropy decoders. The method includes dividing the payload of concatenated encoded subsequences into segments using a distribution function and distributing the segments amongst the set of parallel entropy decoders to balance the computational load among the parallel entropy decoders. The received bitstream includes auxiliary information inserted by the encoder to enable the decoder to entropy decode segments that begin with a portion of an encoded subsequence.

Подробнее
Номер записи: 8
23-08-2012 дата публикации

Binary-shift operations such as for header compression in packet-based communications

Номер: US20120215939A1
Автор: Xiaomin Lu
Принадлежит: LSI Corp

In one embodiment of a header-compression method, a timestamp value is divided by a stride value using a plurality of binary-shift operations corresponding to a Taylor expansion series of the reciprocal stride value in a base of ½. When the division-logic circuitry of an arithmetic logic unit in the corresponding communication device is not designed to handle operands that can accommodate the length of the timestamp and/or stride values, the header-compression method can advantageously be used to improve the speed and efficiency of timestamp compression in communication devices.

Подробнее
Номер записи: 9
13-09-2012 дата публикации

Bar code generation method using color code, data compression method, and internet service method thereof

Номер: US20120229312A1
Автор: Ji Deak Cheon
Принадлежит: Individual

A method and a system for exchanging electronic information data, using a color code recognition device are provided. An electronic information data from the first computer is recognized in either in the ASCII code or in the binary digit format. The electronic information data is encoded by substituting each character of the ASCII codes or the binary digit recognized with a color value. The encoded data is transmitted to the second computer, and the transmitted data is decoded into the original electronic information data. The system for exchanging an electronic information data includes a storage device for storing the user identification database and the legend database, an encoding device for encoding the electronic information data, a decoding device for decoding the encoded data to restore the encoded data into its original format, and a network device for transmitting the data between a plurality of computers over the network.

Подробнее
Номер записи: 10
27-09-2012 дата публикации

Methods of compressing data in storage device

Номер: US20120242517A1
Автор: Hong-rak Son, Je-Hyuck SONG, Jun-Jin Kong, Kwang-gu LEE, Kyoung-lae Cho, Man-keun Seo
Принадлежит: SAMSUNG ELECTRONICS CO LTD

At least one example embodiment discloses a method of compressing data in a storage device. The method includes determining a codeword length of a symbol using a first table indicating a relationship between a number of occurrences of the symbol in received data and the codeword length, determining a codeword having the codeword length for the symbol, and generating compressed data of the received data, the generating including converting the symbol into the codeword.

Подробнее
Номер записи: 11
18-10-2012 дата публикации

Compression producing output exhibiting compression ratio that is at least equal to desired compression ratio

Номер: US20120262312A1
Автор: Andrew Milne, Lokpraveen B. Mosur, Prashant Paliwal, Quinn W. Merrell, Sailesh Bissessur
Принадлежит: CR Bard Inc, Intel Corp

An embodiment may include first circuitry and second circuitry. The first circuitry may compress, at least in part, based at least in part upon a first set of statistics, input to produce first output exhibiting a first compression ratio. If the first compression ratio is less than a desired compression ratio, the second circuitry may compress, at least in part, based at least in part upon a second set of statistics, the first output to produce second output. The first set of statistics may be based, at least in part, after an initial compression, upon other data that has been previously compressed and is associated, at least in part, with the input. The second set of statistics may be based at least in part upon the input. Many alternatives, variations, and modifications are possible.

Подробнее
Номер записи: 12
18-10-2012 дата публикации

Adaptive compression

Номер: US20120265737A1
Автор: Miodrag Potkonjak
Принадлежит: EMPIRE TECHNOLOGY DEVELOPMENT LLC

Technology for adaptive compression is described (“the technology”). The technology may identify two or more partitions of a data stream; optionally pre-process data in each partition; create one or more evaluation functions to evaluate a suitability for compression of the data in each partition using a set of potential compression methods; process the created one or more evaluation functions; choose a subset of the set of potential compression methods for each segment at least partly by analyzing the evaluation functions; select a compression method for each segment based on a compression ratio of compressing the sequence of used compression methods and a compression rate of the data; compress the data in each partition using the selected compression method for the partition; compress a subsequence that indicates which compression method is used for each segment.

Подробнее
Номер записи: 13
29-11-2012 дата публикации

Systems and methods for identifying long matches of data in a compression history

Номер: US20120300993A1
Автор: Robert Plamondon
Принадлежит: Individual

Systems and methods of storing previously transmitted data and using it to reduce bandwidth usage and accelerate future communications are described. By using algorithms to identify long compression history matches, a network device may improve compression efficiently and speed. A network device may also use application specific parsing to improve the length and number of compression history matches. Further, by sharing compression histories, compression history indexes and caches across multiple devices, devices can utilize data previously transmitted to other devices to compress network traffic. Any combination of the systems and methods may be used to efficiently find long matches to stored data, synchronize the storage of previously sent data, and share previously sent data among one or more other devices.

Подробнее
Номер записи: 14
06-12-2012 дата публикации

Method and Apparatus to Perform Function Compression

Номер: US20120307920A1
Автор: Muriel Medard, Soheil Feizi-Khankandi
Принадлежит: Massachusetts Institute of Technology

A functional compression scheme involves determining a minimal entropy coloring of a characteristic graph of a random variable. Various scenarios are disclosed where the determination of the minimal entropy coloring of a characteristic graph is easy and tractable.

Подробнее
Номер записи: 15
13-12-2012 дата публикации

Interference resistant compressive sampling

Номер: US20120314822A1
Автор: Jai Gupta
Принадлежит: Newlans Inc

Embodiments provide for dramatically improved interference resistance in advanced communications applications, where the frequency range can exceed 1 GHz. Such embodiments may be implemented using wideband technology to provide a wideband compressive sampling architecture that is capable of superior interference rejection through RF front end cancellation.

Подробнее
Номер записи: 16
20-12-2012 дата публикации

Method and System for Data Compression

Номер: US20120319876A1
Автор: Alexander Froemmgen
Принадлежит: SAP SE

In one aspect, methods and systems for variable-block length encoding of data, such as an inverted index for a file are disclosed. These methods and systems provide for relatively fast encoding and decoding, while also providing for compact storage. Other aspects include a nearly 1:1 inverted index comprising a position vector and a data store, wherein values that have a unique location mapping are represented directly in the position vector, while for 1:n values (n>1), the position vector can include a pointer, and potentially some portion of information that would typically be stored in the data area, in order to fully use fixed width portions of the position vector (where a maximum pointer size is smaller than a maximum location identifier size).

Подробнее
Номер записи: 17
31-01-2013 дата публикации

Method and device for iterative blind wideband sampling

Номер: US20130028353A1
Автор: Chester Park
Принадлежит: Telefonaktiebolaget LM Ericsson AB

Devices and methods are for iteratively sampling a wideband signal in order to recover one or more narrowband signals are disclosed. In one aspect, a wideband signal is received and the signal is sampled using a sampling device, which includes an amplifier with an initial gain level, to produce a plurality of sampled signals. A first set of narrowband signals may be recovered from the plurality of sampled signals. Then, the wideband signal is re-sampled to produce a second plurality of sampled signals. The re-sampling includes increasing the gain of the amplifier to a second level and suppressing a component of the wideband signal. A second set of narrowband signals may then be recovered from the second set of sampled signals.

Подробнее
Номер записи: 18
07-02-2013 дата публикации

Unified binarization for CABAC/CAVLC entropy coding

Номер: US20130034148A1
Автор: Ba-Zhong Shen, Brian Heng
Принадлежит: Broadcom Corp

Unified binarization for CABAC/CAVLC entropy coding. Scalable entropy coding is implemented in accordance with any desired degree of complexity (e.g., entropy encoding and/or decoding). For example, appropriately implemented context-adaptive variable-length coding (CAVLC) and context-adaptive binary arithmetic coding (CABAC) allow for selective entropy coding in accordance with a number of different degrees of complexity. A given device may operate in accordance with a first level complexity a first time, a second level complexity of the second time, and so on. Appropriate coordination and signaling between an encoder/transmitter device and a decoder/receiver device allows for appropriate coordination along a desired degree of complexity. For example, a variable length binarization module and an arithmetic encoding module may be implemented within an encoder/transmitter device and a corresponding arithmetic decoding module and a variable length bin decoding module may be implemented within a decoder/receiver device allowing for entropy coding along various degrees of complexity.

Подробнее
Номер записи: 19
07-02-2013 дата публикации

Compression Analyzer

Номер: US20130036101A1
Автор: Amit Ganesh, Jesse Kemp, Kam Shergill, Manosiz Bhattacharyya, Roger Macnicol, Sachin Kulkarni, Vikram Kapoor, Vineet Marwah
Принадлежит: Oracle International Corp

Techniques are described herein for automatically selecting the compression techniques to be used on tabular data. A compression analyzer gives users high-level control over the selection process without requiring the user to know details about the specific compression techniques that are available to the compression analyzer. Users are able to specify, for a given set of data, a “balance point” along the spectrum between “maximum performance” and “maximum compression”. The point thus selected is used by the compression analyzer in a variety of ways. For example, in one embodiment, the compression analyzer uses the user-specified balance point to determine which of the available compression techniques qualify as “candidate techniques” for the given set of data. The compression analyzer selects the compression technique to use on a set of data by actually testing the candidate compression techniques against samples from the set of data. After testing the candidate compression techniques against the samples, the resulting compression ratios are compared. The compression technique to use on the set of data is then selected based, in part, on the compression ratios achieved during the compression tests performed on the sample data.

Подробнее
Номер записи: 20
21-02-2013 дата публикации

Method and apparatus for compression and de-compression of spectral data

Номер: US20130044012A1
Автор: David A. Clifton, Ian J. Shaylor
Принадлежит: Optimized Systems And Solutions Ltd

A method and apparatus for data compression, particularly applicable to spectral signals such as Fast Fourier Transforms of vibration data. The data is merged to remove redundant frequencies when recorded at multiple sample rates, thresholded with respect to a noise floor to remove even more redundant data, and then the positions of non-zero signal values, with respect to the noise floor, are recorded in a first dataword and the non-zero signal values themselves are all recorded concatenated to form a second dataword. The compressed data set consists of the first and second datawords, together with the value of the noise floor, maximum original amplitude and the broadband power. In the event of successive data sets having the same or similar locations for non-zero signal values a re-use flag may be set and the locations dataword discarded. Preferably the signal values are non-linearly quantized to further reduce the amount of data.

Подробнее
Номер записи: 21
28-02-2013 дата публикации

Inverted Order Encoding in Lossless Compresssion

Номер: US20130054543A1
Автор: Larry K. Brown
Принадлежит: Invensys Systems Inc

A method of compressing an electronic file is provided. The method comprises reading a first electronic file in reverse order sequence from bottom to top, while reading the first file, identifying patterns in a content of the first file and while reading the first file, building a dictionary comprising a plurality of entries, each entry defining an association of a code to one of the patterns identified in the content of the first file. The method further comprises, while reading the first file, building a second electronic file that is a compressed version of the first file, wherein the second electronic file comprises a compressed content portion and a dictionary portion, wherein the compressed content portion comprises codes from the dictionary and wherein the dictionary portion comprises the dictionary.

Подробнее
Номер записи: 22
04-04-2013 дата публикации

Data encoding apparatus, data decoding apparatus and methods thereof

Номер: US20130082850A1
Автор: Hidenori Takeshima
Принадлежит: Individual

a In a data encoding apparatus, an acquisition unit acquires an input data including a plurality of arranged data. A conversion unit searches a data group including a first consecutive data and a second data adjacent to the first consecutive data, each data of the first consecutive data having a first value and the second data having a second value, and converts the data group into an intermediate data. A selection unit selects a selected encoding method among a plurality of encoding methods, at a time of encoding the intermediate data based on where a beginning of the data group corresponding to the intermediate data exists in the input data. An encoding unit can encode the intermediate data by using the selected encoding method.

Подробнее
Номер записи: 23
04-04-2013 дата публикации

Compression format for high bandwidth dictionary compression

Номер: US20130082851A1
Автор: Akshay G. Pethe, Debendra Das Sharma, Dror REIF, Ido Y. Soffair, Ilan Pardo
Принадлежит: Intel Corp

Method, apparatus, and systems employing dictionary-based high-bandwidth lossless compression. A pair of dictionaries having entries that are synchronized and encoded to support compression and decompression operations are implemented via logic at a compressor and decompressor. The compressor/decompressor logic operatives in a cooperative manner, including implementing the same dictionary update schemes, resulting in the data in the respective dictionaries being synchronized. The dictionaries are also configured with replaceable entries, and replacement policies are implemented based on matching bytes of data within sets of data being transferred over the link. Various schemes are disclosed for entry replacement, as well as a delayed dictionary update technique. The techniques support line-speed compression and decompression using parallel operations resulting in substantially no latency overhead.

Подробнее
Номер записи: 24
06-06-2013 дата публикации

CO-COMPRESSION AND CO-DECOMPRESSION OF DATA VALUES

Номер: US20130142266A1
Автор: Ström Jacob, Wennersten Per
Принадлежит: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)

A first and a second data value are co-compressed by generating a sequence of symbols having a most significant symbol that is the most significant symbol of a compressed representation of the first data value and a least significant symbol that is the most significant symbol of a compressed representation of the second data value. The compressed representation of the first data value corresponds to at least a portion of the symbols of the sequence of symbols starting from the most significant symbol and extending towards the least significant symbol in a first reading direction. The compressed representation of the second data value also corresponds to at least a portion of the symbols of the sequence of symbols, however, starting from the least significant symbol and extending in an opposite reading direction towards the most significant symbol. 1. A data compressing method comprising:co-compressing at least a first data value and a second data value by generating a sequence of symbols having a most significant symbol that is the most significant symbol of a compressed representation of said first data value and a least significant symbol that is the most significant symbol of a compressed representation of said second data value, wherein said compressed representation of said first data value comprises at least a portion of said sequence of symbols starting from said most significant symbol of said sequence of symbols and extending in a first reading direction towards said least significant symbol and said compressed representation of said second data value comprises at least a portion of said sequence of symbols starting from said least significant symbol and extending in a second, opposite reading direction towards said most significant symbol of said sequence of symbols; andstoring said sequence of symbols as a compressed representation of at least said first data value and said second data value.2. The method according to claim 1 , wherein co-compressing ...

Подробнее
Номер записи: 25
27-06-2013 дата публикации

USING VARIABLE LENGTH ENCODING TO COMPRESS AN INPUT DATA STREAM TO A COMPRESSED OUTPUT DATA STREAM

Номер: US20130162453A1
Автор: Jaquette Glen A.
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

Provided are a computer program product, system, method, and data structure for using variable length code tables to compress an input data stream to a compressed output data stream. If a number of consecutive data units in the input data stream match the number of consecutive data units in a history buffer of previously received data units in the input data stream, a copy pointer symbol is generated indicating the copy pointer symbol referencing previously received data units in the history buffer and indicating a location of a start of the consecutive data units in the history buffer. A determination is made of an encoding of the number. Indication is made in the generated copy pointer symbol the determined encoding of the number and the copy pointer symbol is outputted in the compressed output data stream. 1. A computer program product for compressing an input data stream to produce a compressed output data stream , the computer program product comprising a computer readable storage medium having computer readable program code embodied therein that is executed to perform operations , the operations comprising:determining whether a number of consecutive data units in the input data stream match the number of consecutive data units in a history buffer of previously received data units in the input data stream;in response to determining that the number of consecutive data units in the input data stream match the number of consecutive data units in the history buffer, generating a copy pointer symbol indicating the copy pointer symbol referencing previously received data units in the history buffer and indicating a location of a start of the consecutive data units in the history buffer;determining an encoding of the number, wherein the encoding includes one of a plurality of prefix values, wherein each prefix value has one or more bits, and wherein the one or more bits of each prefix value indicates a number of data units represented by at least one bit following the ...

Подробнее
Номер записи: 26
18-07-2013 дата публикации

Methods and systems for compressing and comparing genomic data

Номер: US20130185267A1
Автор: Callum J. Bell, Joe M. Gatewood, Valerio G. Aimale
Принадлежит: Mitotech LLC

Systems and methods are disclosed for compressing and comparing data such as genomic data. The disclosed systems and methods may include selecting a segment, creating a delta representation of the segment, the delta representation comprising a script, and storing the script. Furthermore, the disclosed systems and methods may include receiving a first script comprising a compressed version of a first segment and receiving a second script comprising a compressed version of a second segment. The disclosed systems and methods may further include comparing the first script to the second script and determining if the first segment matches the second segment based upon the comparison of the first script to the second script.

Подробнее
Номер записи: 27
18-07-2013 дата публикации

MODIFIED GABOR TRANSFORM WITH GAUSSIAN COMPRESSION AND BI-ORTHOGONAL DIRICHLET GAUSSIAN DECOMPRESSION

Номер: US20130185344A1
Автор: Shimshovitz Asaf, Tannor David J.
Принадлежит: YEDA RESEARCH & DEVELOPMENT CO. LTD.

A signal processor for compressing signal data, including a function shapes generator for receiving as input time and frequency scale parameters, and for generating as output a plurality of shape parameters for a corresponding plurality of localized functions, wherein the shape parameters govern the centers and spreads of the localized functions, a matrix generator for receiving as input the plurality of shape parameters and a sequence of sampling times, and for generating as output a matrix whose elements are the values of the localized functions at the sampling times, a signal transformer for receiving as input an original signal and the matrix generated by the matrix generator, and for generating as output a transformed signal by applying the matrix to the original signal, and a signal compressor for receiving as input the transformed signal, and for generating as output a compressed representation of the transformed signal. 1. A signal processor for compressing signal data , comprising:a function shapes generator for receiving as input time and frequency scale parameters, and for generating as output a plurality of shape parameters for a corresponding plurality of localized functions, wherein the shape parameters govern the centers and spreads of the localized functions;a matrix generator, coupled with said function shapes generator, for receiving as input the plurality of shape parameters generated by said function shapes generator, and a sequence of sampling times, and for generating as output a matrix whose elements are the values of the localized functions at the sampling times, wherein each column of the matrix corresponds to one of the localized functions, and wherein each row of the matrix corresponds to one of the sampling times;a signal transformer, coupled with said matrix generator, for receiving as input an original signal, and the matrix generated by said matrix generator, and for generating as output a transformed signal by applying the matrix to ...

Подробнее
Номер записи: 28
25-07-2013 дата публикации

Entropy encoding and decoding scheme

Номер: US20130187798A1
Автор: Detlev Marpe, Heiko Schwarz, Thomas Wiegand
Принадлежит: Fraunhofer Gesellschaft zur Forderung der Angewandten Forschung eV

In PIPE coding, where alphabet symbols are distributed among a plurality of specialized entropy en/decoders according to their probability distribution estimate, a categorizing stage is provided where source symbols to be encoded are sub-divided into a first substream which is subject to VLC coding, and a second substream which is subject to PIPE coding. By this measure, source symbols having an appropriate symbol probability distribution, i.e. a probability distribution suitable for being efficiently coded by means of VLC coding without the deficiencies outlined above in the introductory portion of the specification of the present application, may be categorized as VLC coded symbols whereas other symbols may be treated as PIPE coded symbols and subject to PIPE coding, the coding complexity of which is higher than VLC coding, but at a better compression efficiency.

Подробнее
Номер записи: 29
25-07-2013 дата публикации

DIGITAL MEDIA USAGE IN RESPONSE TO IMPACT DATA

Номер: US20130190910A1
Автор: "OCONNELL Brian M.", Haminton, II Rick A., Moskowitz Paul A., PICKOVER Clifford A.
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

Aspects provide digital media content as a function of embedded environmental impact data. When a digital multimedia item is received, an embedded environmental impact value is decoded and the item is utilized as a function of the decoded embedded environmental impact value. Some aspects account for amounts and types of energy used in creating the item to calculate an environmental impact value for the item, and the calculated environmental impact value is embedded within digital data of the item. 1. A method for providing digital media content with an embedded environmental impact data value , the method comprising:a programmable device determining at least one of an amount of energy used in creating a first digital multimedia item comprising a digital multimedia file on a tangible machine-readable article, and a type of energy used in creating the first digital multimedia item; an amount of energy used in providing the first item to a user;', 'an amount of energy used to physically deliver the tangible machine-readable article to the user; and', 'an amount of energy used to recycle or dispose of the tangible machine-readable article;, 'the programmable device calculating a first environmental impact value for the first digital multimedia item as a function of the determined at least one of the amount of energy used in creating the first digital multimedia item and the type of energy used in creating the first digital multimedia item, by determining at least one ofthe programmable device encoding the determined first environmental impact value; andthe programmable device embedding the encoded first environmental impact value within digital data of the first digital multimedia item for decoding by a receiver of the first digital multimedia item.2. The method of claim 1 , further comprising:receiving a second digital multimedia item comprising a second embedded environmental impact value;decoding the second embedded environmental impact value;determining an amount of ...

Подробнее
Номер записи: 30
22-08-2013 дата публикации

LOW BIT RATE SIGNAL CODER AND DECODER

Номер: US20130214943A1
Автор: Gorodnitsky Irina, Yen Anton
Принадлежит:

An improved mixed oscillator-and-external excitation model and methods for estimating the model parameters, for evaluating model quality, and for combining it with known in the art methods are disclosed. The improvement over existing oscillators allows the model to receive, as an input, all except the most recent point in the acquired data. Model stability is achieved through a process which includes restoring unavailable to the decoder data from the optimal model parameters and by using metrics to select a stable restored model output. The present invention is effective for very low bit-rate coding/compression and decoding/decompression of digital signals, including digitized speech, audio, and image data, and for analysis, detection, and classification of signals. Operations can be performed in real time, and parameterization can be achieved at a user-specified level of compression. 1. A non-transitory computer-readable storage medium with an executable program stored thereon , in which the program for analyzing and modeling a data signal instructs a processor to perform a method comprising the following steps of:pre-processing the data signal to generate a data frame, said pre-processing being capable of: sampling the data signal, transforming the data signal, smoothing the data signal, and decomposing the data signal into one or more components to be modeled as separate inputs;modeling the data frame as a combination of fixed length blocks of waveforms drawn from a reference buffer to determine model parameters, the reference buffer comprising all but the most recent data point of the current frame;evaluating qualities of a plurality of models to select an optimal model; andprocessing the computed model parameters, said processing being capable of storing, transmitting, analyzing, and classifying the data signal.2. The method as recited in claim 1 , further comprising the step of storing and making available for future computations at least one of: the waveform ...

Подробнее
Номер записи: 31
22-08-2013 дата публикации

METHOD OF MANUFACTURING MASTER DISC, METHOD OF MANUFACTURING RECORDING MEDIUM, PROGRAM, AND RECORDING MEDIUM

Номер: US20130215732A1
Автор: Hayashi Shinobu
Принадлежит: SONY CORPORATION

Information unique on a group basis is allowed to be efficiently added to a recording medium in which read-only contents data is recorded. Master data (cutting master) having a data structure in which data to be replaced is managed by a file system as data to be arranged in a specific folder or a specific file is produced by authoring. In manufacturing of a recording medium master disc through premastering and mastering using the master data, replacement data unique to each group is prepared, and the data to be replaced is replaced with the replacement data to perform the mastering (master disc exposure). Then, a stamper is produced from the produced master disc, and recording media is mass-produced by using the stamper. In other words, the replacement data are changed on the group basis to allow the recording media in which the replacement data (such as GP and GP) unique to each group is recorded as read-only data to be manufactured, as recording media containing the same content. 1. A method of manufacturing a master disc , the method comprising:a preprocessing step of, for master data having a data structure in which contents data and data to be replaced are managed by a file system, confirming the data to be replaced based on the file system and preparing replacement data;an exposure step of performing exposure of a recording medium master disc, based on the master data in which the data to be replaced is replaced with the replacement data; anda development step of performing development on the recording medium master disc subjected to the exposure to produce a recording medium master disc on which a concavo-convex pattern corresponding to the exposure is formed.2. The method of manufacturing the master disc according to claim 1 , wherein in the exposure step claim 1 , the replacement data and the master data containing the data to be replaced are supplied claim 1 , the exposure is performed by laser light irradiation based on a modulation signal obtained from ...

Подробнее
Номер записи: 32
29-08-2013 дата публикации

METHOD AND APPARATUS FOR ENTROPY DECODING

Номер: US20130222160A1
Автор: Imthurn Paul Daniel, Ku Weicheng Joseph
Принадлежит: Certicom Corp.

An entropy decoder and method for decoding code words with an indication of associated probability for each code word. The decoder can be operable to receive code words and the indication of associated probability. A branch node block can be in communication with a leaf node block. The branch node block comprising one or more branch node lookup tables and branch node control logic. The branch node control logic operable to process a code word in the input buffer using a selected table from the one or more branch node lookup tables to obtain leaf node information and a bit count of a code word size, the branch control logic further operable to refresh the input buffer to replace the bit count of the code word size and to make the leaf node information and the table selection available to the leaf node block. 1. A hardware implemented method of operating an entropy decoding engine for use in an entropy decoder operating on data compressed with a context based variable length compression scheme , the entropy decoder receiving code words and probability information , the entropy decoding engine for decoding the code words into phrase words using N search tree lookup tables , each search tree lookup table corresponding to a probability from a set of N probabilities , the method comprising:the decoding engine receiving a code word and associated probability information; 'the leaf node block, looking up leaf node contents from the lookup table corresponding to the probability information and the leaf node information provided by the branch node block to locate the leaf node and outputting leaf node contents from the leaf node and an indication of the probability information, whereby the leaf node contents output by the leaf node block may be assembled to produce the phrase words.', 'a branch node block of the decoding engine reading the code word and processing the code word using a lookup table corresponding to the probability information to obtain leaf node information, ...

Подробнее
Номер записи: 33
29-08-2013 дата публикации

Parallel pyramid entropy coding for video and image compression

Номер: US20130223536A1
Автор: Lei Zhang
Принадлежит: Broadcom Corp

Methods, systems, and computer program products are provided to divide code blocks, such as blocks of quantized coefficient of image or video data, into smaller blocks and sub-blocks that can be processed in parallel using layered entropy coding and decoding scheme. This division is accomplished while still encoding the entire code block using the same layered entropy coding scheme.

Подробнее
Номер записи: 34
05-09-2013 дата публикации

METHODS AND COMPUTER PROGRAM PRODUCTS FOR COMPRESSION OF SEQUENCING DATA

Номер: US20130231870A1
Автор: Beauchemin Mark, Cawley Simon, Gupta Mohit, HUBBELL Earl, MARJANOVIC Iztok, REARICK Todd, SUGNET Charles
Принадлежит: LIFE TECHNOLOGIES CORPORATION

A compression method includes measuring a waveform associated with a chemical event occurring on a sensor array, wherein the waveform comprises at least one region associated with expected measured values and at least one region associated with unpredictable measured values; applying a first compression process to the waveform, the first compression process including an averaging of one or more frames in one or more portions of the waveform; and applying a second compression process to the waveform, the second compression process including a truncating of data corresponding to a portion of the waveform that is not related to a nucleotide incorporation component of the waveform. 1. A compression method , comprising:measuring a waveform associated with a chemical event occurring on a sensor array, wherein the waveform comprises at least one region associated with expected measured values and at least one region associated with unpredictable measured values;applying a first compression process to the waveform, the first compression process including an averaging of one or more frames in one or more portions of the waveform; andapplying a second compression process to the waveform, the second compression process including a truncating of data corresponding to a portion of the waveform that is not related to a nucleotide incorporation component of the waveform.2. The method of claim 1 , wherein the truncating of data comprises determining claim 1 , for each of a plurality of sensors in the sensor array claim 1 , a cut-off time point for the waveform for that sensor defining a data range to be truncated.3. The method of claim 2 , wherein each cut-off time point is determined by mining a plurality of past analysis runs for a given sensor array geometry.4. The method of claim 2 , wherein each cut-off time point is determined prior to every run or during a calibration procedure.5. The method of claim 2 , wherein each cut-off time point is factory pre-determined for a given ...

Подробнее
Номер записи: 35
12-09-2013 дата публикации

Delta-Sigma D/A Converter

Номер: US20130234872A1
Автор: Alfred Zotz, Michael Korn, Roberto Lugli, Stephan Damith
Принадлежит: Endress and Hauser Wetzer GmbH and Co KG

A delta-sigma D/A converter, by which a digital valued, input signal is convertible into a binary, clock signal time discrete, output signal. By forming an average value of the output signal over a number of clock signal cycles, an analog value of the input signal can be displayed. The delta-sigma D/A converter is embodied in such a manner that, in use, it provides the output signal by serial arrangement of signal patterns of a set of signal patterns, wherein the signal patterns of the set are, in each case, binary, clock signal time discrete and extend over a signal pattern cycles total of a plurality of clock cycles. At least two signal patterns of the set have mutually different signal pattern average values, which are formed over the respective signal pattern cycles total, and all signal patterns of the set have, in each case, essentially the same number, especially exactly the same number, of edges.

Подробнее
Номер записи: 36
19-09-2013 дата публикации

SIGNAL PROCESSOR, WINDOW PROVIDER, ENCODED MEDIA SIGNAL, METHOD FOR PROCESSING A SIGNAL AND METHOD FOR PROVIDING A WINDOW

Номер: US20130241750A1
Автор: GEIGER Ralf, HELMRICH Christian
Принадлежит: Fraunhofer-Gesellschaft zur Foerderung der angewandten Forschung e. V.

A signal processor for providing a processed version of an input signal in dependence on the input signal includes a windower configured to window a portion of the input signal, or of a pre-processed version thereof, in dependence on a signal processing window described by signal processing window values for a plurality of window value index values, in order to obtain the processed version of the input signal. The signal processor also includes a window provider for providing the signal processing window values for a plurality of window value index values in dependence on one or more window shape parameters. 5. A non-transitory computer readable medium including a computer program for performing the method according to when the computer program runs on a computer.6. A non-transitory computer readable medium including a computer program for performing the method according to when the computer program runs on a computer. This application is a continuation of copending International Application No. PCT/EP2011/053484, filed Mar. 8, 2011, which is incorporated herein by reference in its entirety, and additionally claims priority from U.S. Application No. 61/312,775, filed Mar. 11, 2010, and European Application EP 10175142.8, filed Sep. 2, 2010, which are all incorporated herein by reference in their entirety.Embodiments according to the invention are related to a signal processor for providing a processed version of an input signal in dependence on the input signal, to a window provider for providing signal processing window values, to an encoded media signal, to a method for processing a signal and to a method for providing signal processing window values.An embodiment according to the invention is related to an apparatus for encoding or decoding an audio or video signal using variable window functions. Another embodiment according to the invention is related to a method for encoding or decoding an audio or video signal using variable window functions.Embodiments ...

Подробнее
Номер записи: 37
19-09-2013 дата публикации

METHODS AND DEVICES FOR CODING AND DECODING THE POSITION OF THE LAST SIGNIFICANT COEFFICIENT

Номер: US20130241752A1
Автор: He Dake, Wang Jing
Принадлежит: RESEARCH IN MOTION LIMITED

Methods and devices are described for entropy coding data using an entropy coder to encode quantized transform domain coefficient data. Last significant coefficient information is signaled in the bitstream using two-dimensional coordinates for the last significant coefficient. The context for bins of one of the coordinates is based, in part, upon the value of the other of the coordinates. In one case, instead of signaling last significant coefficient information, the number of non-zero coefficients is binarized and entropy encoded. 1. A method for encoding quantized transform domain coefficient data in an encoder having a processor , the method comprising:determining, with the processor, an x-coordinate and a y-coordinate for a last-significant-coefficient position within a block of the quantized transform domain coefficient data; andentropy encoding, with the processor, the x-coordinate and the y-coordinate by determining a context for encoding of one of the coordinates based upon the value of the other of the coordinates.2. The method claimed in claim 1 , wherein entropy encoding includes binarizing the x-coordinate and the y-coordinate and entropy encoding each bin of the binarized x-coordinate and each bin of the binarized y-coordinate.3. The method claimed in claim 2 , wherein binarizing comprises converting each coordinate to a fixed-length binary code.4. The method claimed in claim 2 , wherein determining a context includes determining a context for each bin of said one of the coordinates based upon the value of the other of the coordinates.5. The method claimed in claim 1 , further comprising determining that the x-coordinate and y-coordinate are not [0 claim 1 ,0] before performing said entropy encoding.6. The method claimed in claim 1 , further comprising entropy encoding significant coefficient flags for the block and level information for the block.7. An encoder for encoding quantized transform domain coefficient data claim 1 , the encoder comprising:a ...

Подробнее
Номер записи: 38
03-10-2013 дата публикации

Data Encoding and Decoding Method and Device

Номер: US20130257634A1
Автор: Fang Po-Hsiang, Wang Yu-Hsiang
Принадлежит: NOVATEK MICROELECTRONICS CORP.

An encoding method includes receiving a first data with a first length; dividing the first data into a plurality of data segments with a first specific length; obtaining at least one compressible data segment composed of identical data values if it exists and at least one uncompressible data segment composed of non-identical data values if it exists from the plurality of data segments; compressing the at least one compressible data segment to obtain at least one compressed data segment with a second specific length; generating an encoding data segment according to quantity and position of the at least one compressed data segment; and combining the at least one compressed data segment, the at least one uncompressible data segment and the encoding data segment to generate a second data with a second length, wherein the second specific length is shorter than the first specific length. 1. An encoding method , comprising:receiving a first data with a first length;dividing the first data into a plurality of data segments with a first specific length;obtaining at least one compressible data segment composed of identical data values if it exists and at least one uncompressible data segment composed of non-identical data values if it exists from the plurality of data segments;compressing the at least one compressible data segment to obtain at least one compressed data segment with a second specific length if it exists;generating an encoding data segment according to quantity and position of the at least one compressed data segment; andcombining the compressed data segment, the uncompressible data segment and the encoding data segment to generate a second data with a second length;wherein the second specific length is shorter than the first specific length.2. The encoding method of claim 1 , wherein the step of compressing the at least one compressible data segment to obtain the at least one compressed data segment with the second specific length if it exists comprises: ...

Подробнее
Номер записи: 39
03-10-2013 дата публикации

OPTICAL DISK, FORMAT PROCESSING METHOD FOR THE SAME, RECORDING METHOD FOR THE SAME, AND OPTICAL DISK DEVICE

Номер: US20130258827A1
Автор: HIRABAYASHI Masayuki, IZAWA Shinsuke
Принадлежит: Hitachi Consumer Electronics Co., Ltd.

An optical disk that enables a laser beam to be focused on an object track without making mistakes, an optical disk device, a format processing method, and a recording method. The optical disk shall be configured to has a guiding layer with a physical groove structure containing address information and a single or multiple recording layers with no groove structure, in which the guide areas for recording the address information thereon are formed along a track of the guide layer at fixed intervals in a user data area of each recording layer. An address for the recording layer is generated based on information obtained from the guide layer, and the address for the recording layer is recorded in the guide area. 1. An optical disk that comprises a guide layer with a physical groove structure containing address information and at least one recording layer with no groove structure ,wherein the recording layer has guide areas each in a non-recorded state for recording the address information in an area along a track of the guide layer at fixed intervals.2. A format processing method of the optical disk according to claim 1 , comprising:moving a laser spot to a recording target position of the guide area of the recording layer;generating an address for the recording layer based on information obtained from the guide layer; andrecording the address for the recording layer in the guide area,wherein the method repeats the steps until the addresses are recorded in the guide areas of all the recording layers.3. A recording method for recording user data on an optical disk that has been formatted by the format processing method according to claim 2 , the recording method comprising:moving the laser spot to the recording target position of the recording layer;reproducing a fixed number of the guide areas starting from the guide area at the recording target position;determining whether the address information of the reproduced guide areas is continuous; andperforming an adjustment ...

Подробнее
Номер записи: 40
03-10-2013 дата публикации

SYSTEM AND METHOD FOR MULTI-RESIDUE MULTIVARIATE DATA COMPRESSION

Номер: US20130262414A1
Автор: Fu Shengli, Garcia Oscar N.
Принадлежит: University of North Texas

A method for encoding data comprising generating a table having N moduli, where N is a positive integer equal to two or more, where each of a plurality of integers has a unique set of residue values associated with the moduli. Storing or transmitting the first data field value of a sequence of L data fields values, where L is an integer equal to or greater than 2. Storing or transmitting a set of K residue values, where K Подробнее

Номер записи: 41
03-10-2013 дата публикации

Compression and decompression system, compression apparatus, decompression apparatus and compression and decompression method

Номер: US20130262808A1
Автор: Hideyuki Unno
Принадлежит: Fujitsu Ltd

In a compression and decompression system that performs data compression and decompression, the decompression of compressed data is performed in a way that a compression apparatus generates a byte code string as compressed data, and a decompression apparatus executes the byte code string. The byte code includes an 8-byte-unit copy instruction and direct data processing instruction, and the compression apparatus determines whether to use the 8-byte-unit copy instruction and direct data processing instruction or a byte-unit copy instruction and direct data processing instruction upon decompression, and generates the byte code.

Подробнее
Номер записи: 42
17-10-2013 дата публикации

BYPASS BINS FOR REFERENCE INDEX CODING IN VIDEO CODING

Номер: US20130272377A1
Автор: Coban Muhammed Zeyd, Karczewicz Marta, Seregin Vadim, Wang Xianglin
Принадлежит: QUALCOMM INCORPORATED

In an example, aspects of this disclosure relate to a method for decoding a reference index syntax element in a video decoding process that includes decoding at least one bin of a reference index value with a context coding mode of a context-adaptive binary arithmetic coding (CABAC) process. The method also includes decoding, when the reference index value comprises more bins than the at least one bin coded with the context coded mode, at least another bin of the reference index value with a bypass coding mode of the CABAC process, and binarizing the reference index value. 1. A method for encoding a reference index syntax element in a video encoding process , the method comprising:binarizing a reference index value;encoding at least one bin of the binarized reference index value with a context coding mode of a context-adaptive binary arithmetic coding (CABAC) process; andencoding, when the binarized reference index value comprises more bins than the at least one bin coded with the context coded mode, at least another bin of the binarized reference index value with a bypass coding mode of the CABAC process.2. The method of claim 1 , encoding a first bin (bin0) of the binarized reference index value with a first context (ctx0),', 'encoding a second bin (bin1) of the binarized reference index with a second context (ctx1), and, 'wherein encoding at least one bin of the binarized reference index value with the context coding mode comprises 'encoding a third bin (bin2) and all remaining bins after the third bin (bin2) with the bypass coding mode.', 'wherein encoding at least another bin of the binarized reference index value with the bypass coding mode comprises3. The method of claim 2 , wherein binarizing the reference index value comprises binarizing the reference index value using a combined truncated unary and exponential Golomb code.4. The method of claim 1 , wherein encoding the at least another bin of the binarized reference index value with the bypass coding mode ...

Подробнее
Номер записи: 43
07-11-2013 дата публикации

METHOD FOR COMPRESSING DIGITAL VALUES OF IMAGE, AUDIO AND/OR VIDEO FILES

Номер: US20130293400A1
Автор: Gervais Than Marc-Eric
Принадлежит: I-CES (INNOVATIVE COMPRESSION ENIGINEERING SOLUTIONS)

A method for differential compression of a sequence of digital values adapted to avoid error propagation during restoration of the values. 1. A method for compressing a sequence (S) of initial digital values (Va , . . . , Vp , Vq , Vr , . . . , Vz) into a compressed sequence (SC) of compressed values (Va , VCp , VCq , VCr , . . . , VCz) , intending to restore these values into a decompressed sequence (S2 ,S4) of decompressed values (Va , . . . , VDp , VDq , VDr , . . . , VDz) , wherein for a first initial value (Va) of the sequence , the compressed value (VCa=Va) of the first initial value is equal to said first initial value (Va) and the decompressed value (VDa=VCa=Va) of said compressed value (VCa) of the first initial value (Va) is equal to said first initial value (Va) , then in that , for each current initial value (Vq) , the following steps are carried out:calculating the difference (Dq=Vq−VDp) between the current initial value (Vq) and the decompressed value (VDp) of the initial value immediately preceding the current value (Vq); then,calculating a compressed value (VCq=f[Dq]) of said difference (Dq) using a complementary compression function (f); then,{'sup': '1', 'calculating the decompressed value (VDq=f[VCq]+VDp) corresponding to said current initial value (Vq); then,'}applying the three preceding steps to the immediately following value (Vr) if there is one; and,constituting the compressed sequence (SC) of the compressed values (Va, . . . , VCp, VCq, VCr, . . . , VCz), each corresponding to a respective initial value (Va, . . . , Vp, Vq, Vr, . . . , Vz).2. The method according to claim 1 , in which the compressed value is rounded to the nearest whole number.3. The method according to claim 1 , further comprising keeping claim 1 , on the compressed value claim 1 , the sign of the difference (if DqO then VCq>O).4. The method according to claim 1 , in which the complementary compression function (f) is an nth root function claim 1 , ...

Подробнее
Номер записи: 44
14-11-2013 дата публикации

ENTROPY ENCODING AND DECODING SCHEME

Номер: US20130300591A1
Автор: MARPE Detlev, NGUYEN Tung, SCHWARZ Heiko, WIEGAND Thomas
Принадлежит:

Decomposing a value range of the respective syntax elements into a sequence of n partitions with coding the components of z laying within the respective partitions separately with at least one by VCL coding and with at least one by PIPE or entropy coding is used to greatly increase the compression efficiency at a moderate coding overhead since the coding scheme used may be better adapted to the syntax element statistics. Accordingly, syntax elements are decomposed into a respective number n of source symbols swith i=1 . . . n, the respective number n of source symbols depending on as to which of a sequence of n partitions into which a value range of the respective syntax elements is sub-divided, a value z of the respective syntax elements falls into, so that a sum of values of the respective number of source symbols syields z, and, if n>1, for all i=1 . . . n−1, the value of scorresponds to a range of the ipartition. 1. Entropy encoding apparatus comprising{'sub': i', 'i', 'i, 'sup': 'th', 'a decomposer configured to convert a sequence of syntax elements comprising a value range which is sub-divided into a sequence of N partitions into a sequence of source symbols by individually decomposing each of at least a subgroup of the syntax elements into a respective number n of source symbols swith i=1 . . . n, the respective number n of source symbols depending on as to which of the sequence of N partitions a value z of the respective syntax elements falls into, so that a sum of values of the respective number of source symbols syields z, and, if n>1, for all i=1 . . . n−1, the value of scorresponds to a range of the ipartition;'}{'sub': x', 'y, 'a subdivider configured to subdivide the sequence of source symbols into a first subsequence of source symbols and a second subsequence of source symbols such that all source symbols swith x being member of a first subset of {1 . . . N} are comprised within the first subsequence and all source symbols swith y being member of a ...

Подробнее
Номер записи: 45
21-11-2013 дата публикации

EFFICIENT TECHNIQUES FOR ALIGNED FIXED-LENGTH COMPRESSION

Номер: US20130307709A1
Автор: Colgrove John, Hayes John, Miller Ethan
Принадлежит: PURE Storage, Inc.

Systems and methods for performing compression of data. A data buffer is separated into equal-sized segments of data. A frequency count is performed to determine how often each segment of data appears in the data buffer. Frequently occurring segments are encoded with unique compression codes, while all other infrequently occurring segments are encoded with a common compression code. The compressed data buffer includes the compression codes, which are all of the same bit-length, and the uncompressed segments. The compression codes and the uncompressed segments are stored in the compressed data buffer in the order in which the corresponding segments appear in the original data buffer. 1. A method comprising:partitioning a data buffer into a plurality of segments;determining how often each distinct segment value occurs within the data buffer; assigning a unique compression code for each value which occurs at least a given number of times; and', 'assigning a common compression code to represent values which occur fewer than the given number of times;, 'generating a fixed-length compression code for each segment of the plurality of segments, wherein said generating comprisesstoring the generated compression codes and values which occur fewer than the given number of times consecutively in a compressed data buffer.2. The method as recited in claim 1 , wherein the compressed data buffer further comprises a table including an identification of at least those values occurring more than the given number of times and corresponding compression codes.3. The method as recited in claim 1 , wherein the compressed data buffer further comprises a header claim 1 , wherein the header comprises:a compression algorithm type indicator;an uncompressed length of the data buffer; anda table identifying at least those values occurring more than the given number of times.4. The method as recited in claim 1 , wherein generated compression codes are placed in the compressed data buffer in an ...

Подробнее
Номер записи: 46
21-11-2013 дата публикации

COMPRESSION MATCH ENUMERATION

Номер: US20130307710A1
Автор: Mickle Benjamin A.
Принадлежит:

In embodiments of compression match enumeration, a trie structure can be searched to enumerate data sequence matches after the trie structure is generated. The trie structure can be generated by overwriting a suffix array of data sequences stored in a memory buffer, where the suffix array includes an array of buffer positions sorted alphabetically by a data string that begins a data sequence at a respective buffer position. The trie structure can then be traversed to determine the data sequence matches from nodes in the trie structure. The trie structure can also be updated while being traversed to bypass multiple enumerations of the data sequence matches that have the same match length. 1. A method , comprising:searching a trie structure to enumerate data sequence matches after the trie structure is generated by overwriting a suffix array of data sequences stored in a memory buffer, the suffix array including an array of buffer positions sorted alphabetically by a data string that begins a data sequence at a respective buffer position; andtraversing the trie structure to determine the data sequence matches from nodes in the trie structure.2. A method as recited in claim 1 , further comprising determining the data sequence matches that have the least compressed data based on a number of matching data bytes in a data sequence match represented by a node of the trie structure.3. A method as recited in claim 1 , further comprising updating the trie structure while said traversing the trie structure to bypass multiple enumerations of the data sequence matches that have the same match length.4. A method as recited in claim 1 , wherein the trie structure is generated by incrementally updating the trie structure from consecutive suffixes of the suffix array as the trie structure is generated in-place of the suffix array in the memory buffer.5. A method as recited in claim 1 , wherein the trie structure comprises nodes that each represent one or more suffixes of the suffix ...

Подробнее
Номер записи: 47
05-12-2013 дата публикации

COMPRESSING AND DECOMPRESSING SIGNAL DATA

Номер: US20130321181A1
Автор: Cheng Xinhao, Li Mingqiang, Lin Yonghua, Wang Qing, Xue Chao, YAN Rong, ZHAN Hai, Zhu Chao
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

The present invention relates to data compression and decompression, and particularly relates to a method and an apparatus for compressing and decompressing signal data. In an embodiment of the present invention, there is disclosed a method for compressing signal data, comprising: obtaining signal data; determining block lengths of a plurality of data blocks into which the signal data are divided, and determining exponents of the data blocks; forming a mantissa sequence of the data block by using the exponent of the data block to compress signal data contained in the data block; and forming a compressed data block by using the block length, the exponent and the mantissa sequence of the data block. By constructing a variable-length data block adapted to dynamic characteristics of signal data, the method for compressing signal data of the present invention increases the compression ratio of signal data. 1. A method for compressing signal data , the method comprising:obtaining signal data;determining block lengths of a plurality of data blocks into which the signal data are divided and determining exponents of the data blocks;forming a mantissa sequence of a data block by using the exponent of the data block to compress signal data contained in the data block; andforming a compressed data block from the block length, the exponent and the mantissa sequence of the data block.3. The method according to claim 1 , wherein the forming a mantissa sequence of the data block by using the exponent of the data block to compress signal data contained in the data block comprises: compressing signal data contained in the data block from the next bit of a sign bit claim 1 , wherein the number of bits by which the signal data is compressed are determined by the exponent of the data block claim 1 , and the compressed data block forms a mantissa sequence of the data block.4. The method according to claim 3 , wherein the forming a compressed data block from the block length claim 3 , the ...

Подробнее
Номер записи: 48
05-12-2013 дата публикации

COMPRESSING AND DECOMPRESSING SIGNAL DATA

Номер: US20130321182A1
Автор: Cheng Xinhao, Li Mingqiang, Lin Yonghua, Wang Qing, Xue Chao, YAN Rong, ZHAN Hai, Zhu Chao
Принадлежит:

The present invention relates to data compression and decompression, and particularly relates to a method and an apparatus for compressing and decompressing signal data. In an embodiment of the present invention, there is disclosed a method for compressing signal data, comprising: obtaining signal data; determining block lengths of a plurality of data blocks into which the signal data are divided, and determining exponents of the data blocks; forming a mantissa sequence of the data block by using the exponent of the data block to compress signal data contained in the data block; and forming a compressed data block by using the block length, the exponent and the mantissa sequence of the data block. By constructing a variable-length data block adapted to dynamic characteristics of signal data, the method for compressing signal data of the present invention increases the compression ratio of signal data. 1. An apparatus for compressing signal data , comprising:an obtainment module configured to obtain signal data;a block length and exponent determination module configured to determine block lengths of a plurality of data blocks into which the signal data are divided and determine exponents of the data blocks;a mantissa sequence formation module configured to form a mantissa sequence of the data block by using the exponent of the data block to compress signal data contained in the data block; anda compressed data block formation module configured to form a compressed data block from the block length, the exponent and the mantissa sequence of the data block.2. The apparatus according to claim 1 , wherein the block length and exponent determination module comprises:an initial data block division module configured to initially divide the signal data into a plurality of data blocks; {'br': None, 'i': E', 'B', 'e', 'd, 'sub': d', {'sub2': 'j'}, '∈B', 'j, '()=min(())'}, 'an exponent calculation module configured to calculate an exponent of a data block according to exponents ...

Подробнее
Номер записи: 49
05-12-2013 дата публикации

RECORDING MEDIUM

Номер: US20130322227A1
Автор: Kobayashi Hideki, OGASAWARA Masakazu, SHIROTO Takuya, SUZUKI Makoto, Tagiri Takao, Yoshida Masayoshi
Принадлежит:

A recording medium is provided with: a guide layer on which a guide track or guide tracks are formed; and recording layers, wherein (i) an information mark group and (ii) a distinctive mark group are formed in the guide layer, the information mark group being formed on each of a plurality of guide tracks, the distinctive mark group distinguishing a center track out of the plurality of guide tracks on each of which the information mark group is formed, the distinctive mark group including a pair of distinctive record marks which are shifted toward a right side and a left side, respectively, from a track center of the center track, a width of each distinctive record mark is twice or more a width of the guide track. 1. A recording medium comprising:a guide layer on which a guide track or guide tracks for tracking are formed; anda plurality of recording layers laminated on the guide layer,an information mark group being formed in the guide layer, the information mark group being formed on each of a plurality of guide tracks which are adjacent to one another,an distinctive mark group being formed in the guide layer, the distinctive mark group distinguishing a center track which is a guide track located near a center out of the plurality of guide tracks on each of which the information mark group is formed, the distinctive mark group including a pair of distinctive record marks which are shifted by a predetermined distance toward a right side and a left side, respectively, from a track center of the center track, a width of each distinctive record mark is twice or more a width of the guide track.2. The recording medium according to claim 1 , wherein the distinctive mark group includes at least one of (i) the pair of distinctive record marks formed in a same rotational phase position and (ii) the pair of distinctive record marks formed in different rotational phase positions.3. The recording medium according to claim 2 , wherein the pair of distinctive record marks formed ...

Подробнее
Номер записи: 50
12-12-2013 дата публикации

OPTICAL INFORMATION RECORDING MEDIUM AND OPTICAL INFORMATION RECORDING DEVICE

Номер: US20130329541A1
Автор: Narumi Kenji
Принадлежит:

Provided are an optical information recording medium and an optical information recording device that enable to accurately form recording marks each having a certain code length and to accurately reproduce information, even in the case where shingled write recording is applied to optical information recording. An optical information recording medium () is provided with a user area () configured such that optical characteristics of a photosensitive recording material are changed by irradiation of laser light for recording information. The user area () includes recording tracks () on which information is recorded by overwriting a part of recording marks (), and a heat insulating area () which is concentrically or spirally formed, and insulates heat generated by irradiation of the laser light. The heat insulating area () is formed between the recording tracks (). 1. An optical information recording medium provided with a user area configured such that optical characteristics of a photosensitive recording material are changed by irradiation of laser light for recording information , recording tracks, on which information is recorded by overwriting a part of recording marks; and', 'a first heat insulating area which is concentrically or spirally formed, and insulates heat generated by irradiation of the laser light, wherein the first heat insulating area is formed between the recording tracks., 'the user area including2. The optical information recording medium according to claim 1 , whereina center of a light spot to be formed by irradiation of the laser light is displaced from a center of the recording track.3. The optical information recording medium according to claim 1 , whereina heat conductivity of the first heat insulating area is set lower than a heat conductivity of a region on the recording track containing the photosensitive recording material.4. The optical information recording medium according to claim 1 , whereina composition and/or a thickness of the ...

Подробнее
Номер записи: 51
26-12-2013 дата публикации

GENERATING A CODE ALPHABET OF SYMBOLS TO GENERATE CODEWORDS FOR WORDS USED WITH A PROGRAM

Номер: US20130342374A1
Автор: Cideciyan Roy D., Jaquette Glen A., Mittelholzer Thomas
Принадлежит:

Provided are a computer program product, system, and method for generating a code alphabet for use by a deployed program to determine codewords for words. A first code alphabet has a first number of symbols that provide variable length codings of the words. A second code alphabet is generated having a second number of symbols formed by merging the symbols in the first code alphabet, wherein the second code alphabet comprises the code alphabet used by the deployed program. 1. A computer program product for generating a code alphabet for use by a deployed program to determine codewords for words used in a computing system , wherein the codewords have an average codeword length less than a length of the words , the computer program product comprising a computer readable storage medium having computer readable program code embodied therein that executes to perform operations , the operations comprising:providing a first code alphabet having a first number of symbols that provide variable length codings of the words; andgenerating a second code alphabet having a second number of symbols formed by merging the symbols in the first code alphabet, wherein the second code alphabet comprises the code alphabet used by the deployed program.2. The computer program product of claim 1 , wherein the operations further comprise:generating a word frequency distribution of frequencies of occurrences of all of the possible words;assigning values to different numbers of groups of merged words based on the word frequency distribution; andselecting one of the numbers of the merged words based on the assigned values, wherein the first number of symbols comprises the selected number of the merged words, wherein each symbol maps to one of the merged words.3. The computer program product of claim 2 , wherein the assigned value for each number of the merged words is calculated based on a probability of occurrence of each alphabet code symbol representing.4. The computer program product of claim ...

Подробнее
Номер записи: 52
26-12-2013 дата публикации

RECORDING APPARATUS, RECORDING METHOD, AND SPARING DESTINATION SELECTING METHOD

Номер: US20130343169A1
Автор: KURAOKA Tomotaka
Принадлежит: SONY CORPORATION

A recording apparatus includes: a recording unit to record information by laser irradiation on a recording medium having multiple recording layers where information is recorded, with a track formed in the layers as a continuous recording area and data recorded within a track, and also multiple tracks set to one layer according to recording purpose; and a control unit to determine a sparing destination where information is recorded on a recording position specified according to a recording request, and if sparing processing occurs, as a first priority the next recording address of a track being recorded is selected as a sparing destination, and as a second priority the next recording address of a track overlapped with a track where recording is performed according to the recording request in a layering direction of the layers is selected as a sparing destination, and to cause the recording unit to execute sparing recording. 1. A recording apparatus comprising:a recording unit configured to perform recording of information by laser irradiation on a recording medium having a plurality of layers serving as recording layers where recording of information is performed by laser irradiation, and a track serving as a continuous recording area is formed in the plurality of layers and recording of data is performed within a track, and also a plurality of tracks are set to one layer according to recording purpose; anda control unit configured to determine a sparing destination by sparing destination selecting processing where recording of information by the recording unit is executed on a recording position on the recording medium specified according to a recording request, and also in the event that sparing processing occurs, as a first priority the next recording address of a track being recorded is selected as a sparing destination, and as a second priority the next recording address of a track overlapped with a track where recording is performed according to the recording ...

Подробнее
Номер записи: 53
26-12-2013 дата публикации

RECORDING MANAGEMENT APPARATUS, RECORDING MANAGEMENT METHOD, AND PROGRAM

Номер: US20130343170A1
Автор: KURAOKA Tomotaka
Принадлежит: SONY CORPORATION

A recording management apparatus includes: a control unit configured to perform track setting processing arranged to set, by recording purpose, a plurality of tracks serving as continuous recording areas to one layer of a recording medium having a plurality of layers serving as recording layers where recording of information is performed by laser irradiation, and closing track processing arranged to set each track to a continuous recording completed state within one layer alone. 1. A recording management apparatus comprising: track setting processing arranged to set, by recording purpose, a plurality of tracks serving as continuous recording areas to one layer of a recording medium having a plurality of layers serving as recording layers where recording of information is performed by laser irradiation, and', 'closing track processing arranged to set each track to a continuous recording completed state within one layer alone., 'a control unit configured to perform'}2. The recording management apparatus according to claim 1 , wherein the control unit performs claim 1 , in the event that according to recoding operation claim 1 , recording to a certain track in a certain layer has advanced claim 1 , and an area of this track within this layer is in an already recorded state claim 1 , the closing track processing regarding this track.3. The recording management apparatus according to claim 1 , wherein the control unit performs claim 1 , in the event of having performed the closing track processing regarding a certain track in a certain layer claim 1 , track setting processing arranged to set a plurality of tracks to another layer by recording purpose.4. The recording management apparatus according to claim 1 , wherein the control unit performs claim 1 , at the time of performing the track setting processing claim 1 , the track setting processing with a layer on the rear-most side as viewed from the laser entry face side as a target claim 1 , of layers which have not been ...

Подробнее
Номер записи: 54
23-01-2014 дата публикации

METHODS FOR ENCODING AND DECODING DATA

Номер: US20140022100A1
Автор: 2nd Carlton J., Fallon James J., Mcerlain Stephen J., Melone, Pickel Paul F.
Принадлежит: Realtime Data LLC dba IXO

The transmission of broadcast data, such as financial data and news feeds, is accelerated over a communication channel using data compression and decompression to provide secure transmission and transparent multiplication of communication bandwidth, as well as reduce the latency. Broadcast data may include packets having fields. Encoders associated with particular fields may be selected to compress those particular fields. 1. A method for compressing data , wherein one or more types of encoding are applied to one or more data blocks containing financial data , with packet independent data encoding being performed , at least in part , based on data residing within data fields in the one or more data blocks , the method comprising:recognizing at least one of any characteristic, attribute, or parameter of the data residing within the data field in the one or more data blocks;selecting an encoder associated with the at least one of the characteristic, attribute, or parameter of the data field;encoding data in the data field utilizing the selected encoder; andassociating a recognizable data token with the encoded data, the recognizable data token being capable of identifying the selected encoder.2. The method of claim 1 , wherein the recognizable data token is associated with one or more encoded data blocks.3. The method of claim 1 , wherein the recognizable data token is associated with a payload portion of a data packet.4. The method of claim 1 , wherein the recognizable data token is appended to an encoded data block.5. The method of claim 1 , wherein the selecting the encoder associated with the recognized any characteristic claim 1 , attribute claim 1 , or parameter of the data residing within the data field is based on a packet type of a data packet.6. The method of claim 1 , further comprising:utilizing numerical difference encoding to encode relative numeric values.7. The method of claim 1 , further comprising:utilizing difference encoding based on an absolute ...

Подробнее
Номер записи: 55
23-01-2014 дата публикации

INFORMATION STORAGE MEDIA, TRACKING METHOD, AND OPTICAL INFORMATION APPARATUS

Номер: US20140022882A1
Автор: Matsuzaki Keiichi, Sano Kousei, Takaoka Tatsuya, Wada Hidenori
Принадлежит:

An optical disc () has a first mark () disposed at the center of a track, a second mark () disposed away from the center of the track in a tracking direction thereof by a distance b and disposed away from the first mark () in the direction along the track by a distance L, and a third mark () disposed away from the center of the track in the tracking direction opposite to that of the second mark () by a distance b and disposed away from the first mark () in the direction along the track by a distance L The second and third marks () and () generate scattered light depending on the distance between a scattering medium () and each of the marks by irradiating the scattering medium () in an optical information apparatus with light. The distances b and b are smaller than 50 nm. 119-. (canceled)20. An information recording medium , comprising:a first mark disposed at a center of a track;a second mark disposed to have an edge at a position away from the center of the track in a tracking direction thereof by a predetermined distance Δ; anda third mark disposed to have an edge at a position away from the center of the track in a tracking direction opposite to the tracking direction of the second mark by the predetermined distance Δ, whereina width of the second mark in the tracking direction thereof and a width of the third mark in the tracking direction thereof are larger than a track pitch,the second mark and the third mark generate scattered light depending on a distance between a scattering medium provided in an optical information apparatus, and each of the second mark and the third mark by irradiating the scattering medium with light, andthe predetermined distance Δ is smaller than 50 nm,each of the second mark and the third mark is formed over a plurality of tracks,one of the edges of the second mark in the tracking direction, and the other of the edges of the second mark in the tracking direction are respectively away from the centers of the tracks different from each ...

Подробнее
Номер записи: 56
23-01-2014 дата публикации

DISC IDENTIFICATION

Номер: US20140022883A1
Автор: BHORANIA Aayaz, LEE Kyunga
Принадлежит: MICROSOFT CORPORATION

The described implementations relate to DVD identification. One method accesses media content from a DVD and identifies a format of the media content. The method also determines a unique identification for the media content based upon the format. 120-. (canceled)21. A method comprising:identifying a first format of a disc by locating a specific sequence of symbols on the disc and matching the specific sequence of symbols on the disc to format data, the format data indicating a plurality of disc formats and corresponding symbols that identify individual disc formats including the first format;referencing content stored on the disc in a first location that is used to generate identifications for the first format, the first location being identified by referencing identification (ID) processing data that also identifies other locations that are used to generate identifications for disc formats other than the first format; andprocessing the content stored on the disc in the first location to generate an identification for the disc.22. The method of claim 21 , further comprising:using the identification for the disc to obtain metadata associated with the disc.23. The method of claim 21 , wherein the processing the content comprises hashing the content.24. The method of claim 21 , wherein the referencing content comprises directly accessing the disc to obtain the content or receiving the content from a disc player that directly accesses the disc.25. The method of claim 21 , further comprising:determining that the specific sequence of symbols is common to a plurality of different discs of the first format; andresponsive to the determining, populating the format data with the specific sequence of symbols mapped to the first format.26. A computing device having a computer-readable storage media storing instructions that claim 21 , when executed by the computing device claim 21 , cause the computing device to perform operations comprising:identifying a first format of a disc ...

Подробнее
Номер записи: 57
30-01-2014 дата публикации

DATA TRANSLATION SYSTEM AND METHOD

Номер: US20140028479A1
Автор: Cheung Frank N.G.
Принадлежит:

A data translation system and method. This invention provides a reverse approach to implement a M bit input to N bit output cumulative/monotonic transfer function, (where M>N) by a (2**N)×M bit memory instead of the conventional (2**M)×N bit memory. The invention offers substantial circuit size savings without compromising on transfer function resolution and is independent of transfer function mapping algorithms. The M bit memory content of the reverse LUT contains input video group information for each output level and the (2**N) addresses of the reverse LUT represent the corresponding transfer function output levels. This data to address representation of the input to output relationship is exactly opposite to the conventional address to data format. Search and compare methods are employed to locate the input video group that the incoming video belongs to and the associated address of the reverse LUT represents the output. 131-. (canceled)32. A system for translating an M-bit input to an N-bit output , where M>N , using a cumulative-monotonic input-output transfer function , comprising:{'sup': 'N', 'memory means for storing 2M-bit digital words defining breakpoints of the input-output transfer function and'}means for comparing; said M-bit input to said breakpoints and providing an output in response thereto.33. The invention of wherein the means for comparing is a hybrid parallel pipeline.34. The invention of wherein said pipeline has jbits determined at each stage and wherein the sum of all of the j's equals N and more than one bit of output is determined in at least one stage.35. The invention of wherein said means for comparing includes comparators.36. The invention of wherein the comparators are disposed in parallel.37. The invention of wherein said means for comparing is comprised of an N-stage pipeline.38. The invention of wherein said pipeline has one bit determined at each stage.39. The invention of wherein said means for comparing includes iterating ...

Подробнее
Номер записи: 58
30-01-2014 дата публикации

METHODS FOR ENCODING AND DECODING DATA

Номер: US20140028480A1
Автор: Fallon James J., II Carlton J., McErlain Stephan J., Melone, Pickel Paul F.
Принадлежит: Realtime Data LLC dba IXO

The transmission of broadcast data, such as financial data and news feeds, is accelerated over a communication channel using data compression and decompression to provide secure transmission and transparent multiplication of communication bandwidth, as well as reduce the latency. Broadcast data may include packets having fields. Encoders associated with particular fields may be selected to compress those particular fields. 1. A method of decoding , on a packet independent basis using a data decoding engine , one or more encoded messages residing in data blocks of a data packet , the encoded messages including financial information transmitted in sequence from a source , internal or external to the decoding engine , wherein at least one of a plurality of decompression techniques are applied to the one or more encoded messages , the method comprising:identifying one or more recognizable data tokens in an encoded message, the one or more recognizable data tokens being associated with the data packet and including any recognizable data token indicative of any characteristic, attribute, or parameter of data residing in the one or more data blocks, and wherein the encoders were selected based on analyses of the content of the data block;applying one or more decoders to a data block from among the one or more data blocks associated with the encoded message based on the one or more recognizable data tokens and a description table, the description table including the characteristics, attributes, or parameters of the data residing in the one or more data blocks and their associated decoders;decoding the data block with an associated decoder when the recognizable data token indicates that the data block was encoded utilizing content dependent data compression; anddecoding the data block with an associated decoder when the recognizable data token indicates that the data block was encoded utilizing content independent data compression.2. The method of claim 1 , wherein the ...

Подробнее
Номер записи: 59
13-02-2014 дата публикации

ACCELEROMETER DATA COMPRESSION

Номер: US20140046990A1
Автор: Da Cruz Gonçalves Nelson Miguel, Kmiecik Marcin Michal, Lai Ying-Lin
Принадлежит:

A method of compressing data output from an acceleration measurement means configured to be transported, carried or worn by a user is provided. Acceleration values indicative of the movement of the user are measured at a first frequency and values representative of the measured acceleration values are generated at a second frequency, which is lower than the first frequency. The step of generating comprises: defining a plurality of time windows, each time window containing a plurality of measured acceleration values; and applying a transformation to the measured acceleration values within each time window to generate a plurality of transformed values. For each time window, storing at least one of said plurality of transformed values and/or one or more parameters associated therewith. 1. A method of compressing data output from an acceleration measurement means configured to be transported , carried or worn by a user , comprising the steps of:measuring acceleration values indicative of the movement of the user at a first frequency; defining a plurality of time windows, each time window containing a plurality of measured acceleration values; and', 'applying a transformation to the measured acceleration values within each time window to generate a plurality of transformed values; and,, 'generating values representative of the measured acceleration values at a second frequency, which is lower than the first frequency, said step of generating comprisingfor each time window, storing at least one of said plurality of transformed values and/or one or more parameters associated therewith.2. A method as claimed in claim 1 , wherein the acceleration values are measured using one or more accelerometers.3. A method as claimed in claim 1 , wherein the first frequency is between 1 Hz and 20 Hz.4. A method as claimed in claim 1 , wherein the acceleration values are stored in a data buffer.5. A method as claimed in claim 1 , further comprising determining an absolute acceleration ...

Подробнее
Номер записи: 60
20-02-2014 дата публикации

Data compression utilizing longest common subsequence template

Номер: US20140049412A1
Автор: Damir A. Jamsek, Kanak B. Agarwal, Michael A. Paolini, Robert B. Tremaine
Принадлежит: International Business Machines Corp

In response to receipt of an input string, an attempt is made to identify, in a template store, a closely matching template for use as a compression template. In response to identification of a closely matching template that can be used as a compression template, the input string is compressed into a compressed string by reference to a longest common subsequence compression template. Compressing the input string includes encoding, in a compressed string, an identifier of the compression template, encoding substrings of the input string not having commonality with the compression template of at least a predetermined length as literals, and encoding substrings of the input string having commonality with the compression template of at least the predetermined length as a jump distance without reference to a base location in the compression template. The compressed string is then output.

Подробнее
Номер записи: 61
20-02-2014 дата публикации

DATA COMPRESSION UTILIZING LONGEST COMMON SUBSEQUENCE TEMPLATE

Номер: US20140049413A1
Автор: Agarwal Kanak B., Jamsek Damir A., PAOLINI MICHAEL A., Tremaine Robert B.
Принадлежит:

In response to receipt of an input string, an attempt is made to identify, in a template store, a closely matching template for use as a compression template. In response to identification of a closely matching template that can be used as a compression template, the input string is compressed into a compressed string by reference to a longest common subsequence compression template. Compressing the input string includes encoding, in a compressed string, an identifier of the compression template, encoding substrings of the input string not having commonality with the compression template of at least a predetermined length as literals, and encoding substrings of the input string having commonality with the compression template of at least the predetermined length as a jump distance without reference to a base location in the compression template. The compressed string is then output. 1. A method of data processing system in a data processing system , comprising:in response to receipt of an input string, an integrated circuit attempting to identify, in a template store, a closely matching template for use as a compression template; encoding, in a compressed string, an identifier of the compression template;', 'encoding, in the compressed string, first substrings of the input string not having commonality with the compression template of at least a predetermined length as literals;', 'in response to identifying first substrings, encoding, in the compressed string, jump lengths in the compression template until a next match between the input string and the compression template;', 'encoding, in the compressed string, second substrings of the input string having commonality with the compression template of at least the predetermined length as a template reference without reference to a base location in the compression template; and, 'in response to identification of the closely matching template as the compression template, the integrated circuit compressing the input ...

Подробнее
Номер записи: 62
20-02-2014 дата публикации

OPTICAL DISC AND OPTICAL DISC DEVICE

Номер: US20140050060A1
Автор: NAKAHARA Hironori, OGAWA Masaharu, Takeshita Nobuo
Принадлежит: Mitsubishi Electric Corporation

In a multilayer optical disc having information layers conforming to a plurality of different optical disc standards, because the type of each information layer is not recorded in the other information layers, in read and write operations by a compatible optical disc device conforming to a plurality of optical disc standards, every time the information layer being accessed changes, it has been necessary to read the type of the information layer and select a method of generating a tracking error signal adapted to the type of information layer, so access has taken time. In order to solve the above problem, in the optical multilayer disc according to the present invention, having information layers conforming to a plurality of different optical disc standards, in an area in one of the information layers, information about the other information layers is recorded. The time required to access the other information layers can be reduced by using this information to select a tracking error signal generating method. 1. An optical data storage medium comprising;at least one recording layer of Blu-ray layer having a track upon which a laser beam is focused during use; anda management area provided on said at least one recording layer of Blu-ray layer, said management area having recorded data representing if another type of recording layer is present in said medium,wherein said recorded data represents if said another type of recording layer is present in a predefined depth of said medium, and said recorded data represents a depth at which said another type of recording layer should be present, and in case that said another type of recording layer is not present in said medium said recorded data indicates that said another type of recording layer is not present at said predetermined depth,said recorded data is provided only on the management area of the Blu-ray layer,said recorded data represents absence of a recording layer by bit values of 00.2. An optical data storage ...

Подробнее
Номер записи: 63
20-02-2014 дата публикации

OPTICAL DISC AND OPTICAL DISC DEVICE

Номер: US20140050061A1
Автор: NAKAHARA Hironori, OGAWA Masaharu, Takeshita Nobuo
Принадлежит: Mitsubishi Electric Corporation

In a multilayer optical disc having information layers conforming to a plurality of different optical disc standards, because the type of each information layer is not recorded in the other information layers, in read and write operations by a compatible optical disc device conforming to a plurality of optical disc standards, every time the information layer being accessed changes, it has been necessary to read the type of the information layer and select a method of generating a tracking error signal adapted to the type of information layer, so access has taken time. In order to solve the above problem, in the optical multilayer disc according to the present invention, having information layers conforming to a plurality of different optical disc standards, in an area in one of the information layers, information about the other information layers is recorded. The time required to access the other information layers can be reduced by using this information to select a tracking error signal generating method. 1. An optical data storage medium comprising:at least one recording layer of Blu-ray layer having a track upon which a laser beam is focused during use; anda management area provided on said at least one recording layer of Blu-ray layer, said management area having recorded data representing if another type of recording layer is present in said medium,wherein in a case that said another type of recording layer is present in said medium said recorded data represents if said another type of said recording layer is read only type or recordable type, and in a case that said another type of recording layer is not present in said medium said recorded data indicates that said another type of recording layer is not present in said medium,said recorded data is provided only on the management area of the Blu-ray layer,said recorded data represents absence of a recording layer by bit values of 00.2. An optical data storage drive for use with an optical data storage medium ...

Подробнее
Номер записи: 64
20-02-2014 дата публикации

OPTICAL DISC AND OPTICAL DISC DEVICE

Номер: US20140050062A1
Автор: NAKAHARA Hironori, OGAWA Masaharu, Takeshita Nobuo
Принадлежит: Mitsubishi Electric Corporation

In a multilayer optical disc having information layers conforming to a plurality of different optical disc standards, because the type of each information layer is not recorded in the other information layers, in read and write operations by a compatible optical disc device conforming to a plurality of optical disc standards, every time the information layer being accessed changes, it has been necessary to read the type of the information layer and select a method of generating a tracking error signal adapted to the type of information layer, so access has taken time. In order to solve the above problem, in the optical multilayer disc according to the present invention, having information layers conforming to a plurality of different optical disc standards, in an area in one of the information layers, information about the other information layers is recorded. The time required to access the other information layers can be reduced by using this information to select a tracking error signal generating method. 1. An optical data storage medium comprising;at least one Blu-ray layer having a track upon which a laser beam is focused during use; anda management area provided on said at least one Blu-ray layer,said management area having recorded data representing if another recording layer of different optical disc standard is present in said medium, wherein said recorded data has a first information section representing presence and absence of a DVD layer and a second information section representing presence and absence of a CD layer, andwhen said DVD layer is present in said medium, said first information section represents if said DVD layer is read-only type or recordable type, andwhen said CD layer is present in said medium, said second information section represents if said CD layer is read-only type or recordable type,said recorded data is provided only on the management area of the Blu-ray layer,said recorded data represents absence of a recording layer by bit ...

Подробнее
Номер записи: 65
20-02-2014 дата публикации

OPTICAL DISC AND OPTICAL DISC DEVICE

Номер: US20140050063A1
Автор: NAKAHARA Hironori, OGAWA Masaharu, Takeshita Nobuo
Принадлежит: Mitsubishi Electric Corporation

In a multilayer optical disc having information layers conforming to a plurality of different optical disc standards, because the type of each information layer is not recorded in the other information layers, in read and write operations by a compatible optical disc device conforming to a plurality of optical disc standards, every time the information layer being accessed changes, it has been necessary to read the type of the information layer and select a method of generating a tracking error signal adapted to the type of information layer, so access has taken time. In order to solve the above problem, in the optical multilayer disc according to the present invention, having information layers conforming to a plurality of different optical disc standards, in an area in one of the information layers, information about the other information layers is recorded. The time required to access the other information layers can be reduced by using this information to select a tracking error signal generating method. 1. An optical data storage medium comprising;at least one recording layer of Blu-ray layer having a track upon which a laser beam is focused during use; anda management area and a user data area provided on said at least one recording layer of Blu-ray layer, said management area having recorded data representing if another type of recording layer is present in said medium, and said management area being located interiorly to said user data area,wherein said recorded data represents if said another type of recording layer is present in a predefined depth of said medium, and said recorded data represents a depth at which said another type of recording layer should be present, and in case that said another type of recording layer is not present in said medium said recorded data indicates that said another type of recording layer is not present at said predetermined depth,said recorded data is provided only on the management area of the Blu-ray layer.2. An optical ...

Подробнее
Номер записи: 66
20-02-2014 дата публикации

OPTICAL DISC AND OPTICAL DISC DEVICE

Номер: US20140050064A1
Автор: NAKAHARA Hironori, OGAWA Masaharu, Takeshita Nobuo
Принадлежит: Mitsubishi Electric Corporation

In a multilayer optical disc having information layers conforming to a plurality of different optical disc standards, because the type of each information layer is not recorded in the other information layers, in read and write operations by a compatible optical disc device conforming to a plurality of optical disc standards, every time the information layer being accessed changes, it has been necessary to read the type of the information layer and select a method of generating a tracking error signal adapted to the type of information layer, so access has taken time. In order to solve the above problem, in the optical multilayer disc according to the present invention, having information layers conforming to a plurality of different optical disc standards, in an area in one of the information layers, information about the other information layers is recorded. The time required to access the other information layers can be reduced by using this information to select a tracking error signal generating method. 1. An optical data storage medium comprising;at least one recording layer of Blu-ray layer having a track upon which a laser beam is focused during use;a management area and a user data area provided on said at least one recording layer of Blu-ray layer,said management area having recorded data representing if another recording layer of a different optical disc format standard with different data capacity is present in said medium, and said management area being located interiorly to said user data area,wherein said another recording layer has different physical structure with different track density, andwherein said recorded data represents presence and absence of each of at least two different recording layers,wherein in a case that said another recording layer is not present in said medium said recorded data indicates said another recording layer is not present in said medium, andin a case that said another recording layer is present in said medium said ...

Подробнее
Номер записи: 67
20-02-2014 дата публикации

OPTICAL DISC AND OPTICAL DISC DEVICE

Номер: US20140050069A1
Автор: NAKAHARA Hironori, OGAWA Masaharu, Takeshita Nobuo
Принадлежит: Mitsubishi Electric Corporation

In a multilayer optical disc having information layers conforming to a plurality of different optical disc standards, because the type of each information layer is not recorded in the other information layers, in read and write operations by a compatible optical disc device conforming to a plurality of optical disc standards, every time the information layer being accessed changes, it has been necessary to read the type of the information layer and select a method of generating a tracking error signal adapted to the type of information layer, so access has taken time. In order to solve the above problem, in the optical multilayer disc according to the present invention, having information layers conforming to a plurality of different optical disc standards, in an area in one of the information layers, information about the other information layers is recorded. The time required to access the other information layers can be reduced by using this information to select a tracking error signal generating method. 1. An optical data storage medium comprising;at least one recording layer of Blu-ray layer having a track upon which a laser beam is focused during use,a management area and a user data area provided on said at least one recording layer of Blu-ray layer, said management area having recorded data representing if another recording layer is present in said medium, and said management area being located interiorly to said user data area,wherein said recorded data represents if another recording layer of different recording type is present in said medium and in a case that said another recording layer of different type is not present in said medium said recorded data indicates that said another recording layer of different recording type is not present in said medium,said recorded data is provided only on the management area of the Blu-ray layer.2. An optical data storage drive for use with an optical data storage medium according to claim 1 , being configured to ...

Подробнее
Номер записи: 68
20-02-2014 дата публикации

OPTICAL DISC AND OPTICAL DISC DEVICE

Номер: US20140050070A1
Автор: NAKAHARA Hironori, OGAWA Masaharu, Takeshita Nobuo
Принадлежит: Mitsubishi Electric Corporation

In a multilayer optical disc having information layers conforming to a plurality of different optical disc standards, because the type of each information layer is not recorded in the other information layers, in read and write operations by a compatible optical disc device conforming to a plurality of optical disc standards, every time the information layer being accessed changes, it has been necessary to read the type of the information layer and select a method of generating a tracking error signal adapted to the type of information layer, so access has taken time. In order to solve the above problem, in the optical multilayer disc according to the present invention, having information layers conforming to a plurality of different optical disc standards, in an area in one of the information layers, information about the other information layers is recorded. The time required to access the other information layers can be reduced by using this information to select a tracking error signal generating method. 1. An optical data storage medium comprising:at least one recording layer of Blu-ray layer having a track upon which a laser beam is focused during use; anda management area and a user data area provided on said at least one recording layer of Blu-ray layer, said management area having recorded data representing if another type of recording layer is present in said medium, and said management area being located interiorly to said user data area,wherein in a case that said another type of recording layer is present in said medium said recorded data represents if said another type of said recording layer is read only type or recordable type, and in a case that said another type of recording layer is not present in said medium said recorded data indicates that said another type of recording layer is not present in said medium,said recorded data is provided only on the management area of the Blu-ray layer.2. An optical data storage drive for use with an optical data ...

Подробнее
Номер записи: 69
20-02-2014 дата публикации

OPTICAL DISC AND OPTICAL DISC DEVICE

Номер: US20140050073A1
Автор: NAKAHARA Hironori, OGAWA Masaharu, Takeshita Nobuo
Принадлежит: Mitsubishi Electric Corporation

In a multilayer optical disc having information layers conforming to a plurality of different optical disc standards, because the type of each information layer is not recorded in the other information layers, in read and write operations by a compatible optical disc device conforming to a plurality of optical disc standards, every time the information layer being accessed changes, it has been necessary to read the type of the information layer and select a method of generating a tracking error signal adapted to the type of information layer, so access has taken time. In order to solve the above problem, in the optical multilayer disc according to the present invention, having information layers conforming to a plurality of different optical disc standards, in an area in one of the information layers, information about the other information layers is recorded. The time required to access the other information layers can be reduced by using this information to select a tracking error signal generating method. 1. An optical data storage medium comprising;at least one recording layer of Blu-ray layer having a track upon which a laser beam is focused during use;a management area provided on said at least one recording layer of Blu-ray layer, said management area having recorded data representing if another recording layer of a different optical disc format standard with different data capacity is present in said medium,wherein said another recording layer has different physical structure with different track density, andwherein said recorded data represents presence and absence of each of at least two different recording layers,wherein in a case that said another recording layer is not present in said medium said recorded data indicates said another recording layer is not present in said medium, andin a case that said another recording layer is present in said medium said recorded data indicates if said another recording layer is read only type or recordable type,said ...

Подробнее
Номер записи: 70
13-03-2014 дата публикации

MULTILAYER INFORMATION RECORDING MEDIUM, AND INFORMATION PLAYBACK METHOD AND INFORMATION RECORDING METHOD EMPLOYING SAME

Номер: US20140071798A1
Автор: Kurokawa Takahiro
Принадлежит: Hitachi Consumer Electronics Co., Ltd.

The purpose of the present invention is to minimize increase in the number of types of medium control information, and increase in time required for OPC, in association with a greater number of recording layers in a multilayer optical information recording medium. Provided is a multilayer optical information recording medium having two or more recording layers, the multilayer optical information recording medium characterized in that the recording layers are classified into layer groups that are fewer in number than the number of recording layers, each of the layer groups so classified being assigned medium control information that is shared within the layer group, and the medium control information assigned to each layer group being pre-registered in an administrative domain. 1. A multilayer optical information recording medium comprising:at least three recording layers, the recording layers being classified into layer groups that are fewer in number than the recording layers, and media control information common in a layer group being provided every layer group generated by the classification; andan administration area where the media control information provided for every layer group is recorded.2. The multilayer optical information recording medium according to claim 1 , whereinthe media control information comprises parameters for specifying maximum playback power with respect to each of the recording layers belonging to the layer group, andthe parameters are different for every layer group.3. The multilayer optical information recording medium according to claim 2 , whereinthe recording layers are respectively provided with consecutive integer layer numbers in order from back when viewed from a light incidence plane of the multilayer optical information recording medium or in order from front,the maximum playback power for each of the recording layers is given by a polynomial function of the layer number, andparameters for specifying maximum playback power for ...

Подробнее
Номер записи: 71
13-03-2014 дата публикации

OPTICAL DISC AND OPTICAL DISC DEVICE

Номер: US20140071800A1
Автор: NAKAHARA Hironori, OGAWA Masaharu, Takeshita Nobuo
Принадлежит: Mitsubishi Electric Corporation

In a multilayer optical disc having information layers conforming to a plurality of different optical disc standards, because the type of each information layer is not recorded in the other information layers, in read and write operations by a compatible optical disc device conforming to a plurality of optical disc standards, every time the information layer being accessed changes, it has been necessary to read the type of the information layer and select a method of generating a tracking error signal adapted to the type of information layer, so access has taken time. In order to solve the above problem, in the optical multilayer disc according to the present invention, having information layers conforming to a plurality of different optical disc standards, in an area in one of the information layers, information about the other information layers is recorded. The time required to access the other information layers can be reduced by using this information to select a tracking error signal generating method. 1. An optical data storage medium comprising;at least one recording layer of Blu-ray layer having a track upon which a laser beam is focused during use;a management area and a user data area provided on said at least one recording layer of Blu-ray layer,said management area having recorded data representing if another recording layer of a different optical disc format standard with different data capacity is present in said medium, and said management area being located interiorly to said user data area,wherein said another recording layer has different physical structure with different track density, andwherein said recorded data represents presence and absence of each of at least two different recording layers,wherein in a case that said another recording layer is not present in said medium said recorded data indicates said another recording layer is not present in said medium, andin a case that said another recording layer is present in said medium said ...

Подробнее
Номер записи: 72
27-03-2014 дата публикации

DATA COMPRESSION USING DICTIONARY ENCODING

Номер: US20140085115A1
Автор: Beier Felix, Caballero Grolimund Carlos J., Raman Vijayshankar, Stolze Knut
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

Embodiments relate to data compression using dictionary encoding. An aspect includes subdividing a table of uncompressed data into a first block and a second block of complete rows. Another aspect includes determining information about a frequency of occurrence of different values for each column of the first block. Another aspect includes selecting a row of the first block to be removed out of the first block using frequency of occurrence-information. Another aspect includes removing the a row out of the first block to form an updated first block and determining information about a frequency of occurrence of different values for each column of the updated first block. Another aspect includes deriving a dictionary containing code-words for encoding the values of the updated first block. Another aspect includes encoding the values of the updated first block based on the code-words. Another aspect includes adding the removed row to the second block. 1. A computer-implemented method for data compression using dictionary encoding , the method comprising:providing at least one table of uncompressed data with values arranged in columns and rows;subdividing the table into at least a first block and a second block of complete rows;selecting the first block of rows to be processed to perform the data compression;determining information about a frequency of occurrence of different values for each column of the first block;evaluating and selecting at least one row of the first block to be removed out of the first block using frequency of occurrence-information to reduce code-word length;removing the at least one row out of the first block to form an updated first block;determining information about a frequency of occurrence of different values for each column of the updated first block;deriving at least one dictionary containing code-words for encoding the values of the updated first block;encoding the values of the updated first block based on the code-words of the at least ...

Подробнее
Номер записи: 73
10-04-2014 дата публикации

DATA COMPRESSION

Номер: US20140097974A1
Автор: Denhez Alain Ad
Принадлежит:

An exemplary encoder device includes a data storage comprising an indication of a coordinate system and a set of symbols, each having at least one coordinate position in the coordinate system. A processor associated with the data storage is configured to encode at least one symbol within information comprising a plurality of symbols using the coordinate position of the at least one symbol relative to the coordinate position of another symbol within the information. 1. (canceled)2. An encoder device , comprising:a data storage comprising an indication of a coordinate system and a set of symbols, each having at least one coordinate position in the coordinate system; and determine a primary coordinate position of a selected one of the symbols of the information, and', 'determine a sequence of movements within the coordinate system corresponding to a sequence of the plurality of symbols of the information, wherein at least a beginning of the sequence of movements is determined based on the primary coordinate position., 'a processor associated with the data storage, the processor being configured to encode at least one symbol within information comprising a plurality of symbols using the coordinate position of the at least one symbol relative to the coordinate position of another symbol within the information, wherein the processor is configured to'}3. The device of claim 2 , wherein the sequence of movements comprises:a first movement from the primary coordinate position of the selected one of the symbols to the coordinate position of a sequentially adjacent one of the symbols of the information; anda plurality of next movements to the coordinate position of a next sequentially adjacent one of the symbols from the coordinate position of the previous adjacent one of the symbols.4. An encoder device claim 2 , comprising:a data storage comprising an indication of a coordinate system and a set of symbols, each having at least one coordinate position in the coordinate system ...

Подробнее
Номер записи: 74
10-04-2014 дата публикации

RECORDING CONTROL DEVICE AND METHOD

Номер: US20140098653A1
Автор: KURAOKA Tomotaka
Принадлежит: SONY CORPORATION

Provided is a recording control device including a recording control section which controls data recording to a recording medium by irradiating laser light to the recording medium, and an alternate processing section which sets, in a case where recording of data to a specific address of a prescribed sequential recording range is instructed and an alternate process is generated, a next writable address having a shortest distance between a position of a next writable address and a position of the specific address from a center of the recording medium in an outer peripheral direction, from among next writable addresses of the sequential recording ranges of each of the recording layers, as an alternate destination of the specific address. 1. A recording control device , comprising:a recording control section which controls data recording to a recording medium by irradiating laser light to the recording medium, the recording medium having a plurality of recording layers on which data recording is performed, and having a number of sequential recording ranges for different recording purposes on each of the recording layers; andan alternate processing section which sets, in a case where recording of data to a specific address of a prescribed sequential recording range is instructed and an alternate process is generated, a next writable address having a shortest distance between a position of a next writable address and a position of the specific address from a center of the recording medium in an outer peripheral direction, from among next writable addresses of the sequential recording ranges of each of the recording layers, as an alternate destination of the specific address.2. The recording control device according to claim 1 ,wherein in the case where the alternate process is generated, at a time when there is a next writable address in the sequential recording range including the specific address, the alternate processing section sets the next writable address as the ...

Подробнее
Номер записи: 75
01-01-2015 дата публикации

ENCODING METHOD, INFORMATION PROCESSING APPARATUS, AND RECORDING MEDIUM

Номер: US20150002320A1
Автор: Kataoka Masahiro, Murata Takahiro, OHTA Takafumi
Принадлежит:

A first encoding unit encodes, within the compression target data, each part with a sequence of the same value into the number of consecutive runs of the value. A decomposing unit decomposes the number of consecutive runs of the same value into an addition of integers belonging to a predetermined integer group. A calculating unit calculates the probability of occurrence of each integer obtained by the decomposition. A second encoding unit encodes each integer by assigning shorter codes to integers with higher probabilities of occurrence. 1. A non-transitory computer-readable recording medium storing therein an encoding program that causes a computer to execute a process comprising:encoding, within compression target data, each part with a sequence of a same value into a count of consecutive runs of the value;decomposing the count of consecutive runs of the value into an addition of integers belonging to a predetermined integer group;calculating a probability of occurrence of each of the integers obtained by the decomposing; andencoding each of the integers by assigning a shorter code to an integer with a higher probability of occurrence.2. The non-transitory computer-readable recording medium according to claim 1 , wherein:the integer group includes 0 and powers of a specific integer, andthe encoding each of the integers includes using, for the encoding, a coding tree having leaves each corresponding to a different one of the integers.3. The non-transitory computer-readable recording medium according claim 1 , wherein:the compression target data is a set of bit strings each indicating whether a corresponding one of a plurality of characters is present or absence in each of a plurality of records including character strings,the process further includes classifying each of the characters into one of a plurality of groups according to a proportion of bit values indicating the presence of the character in the corresponding bit string,the calculating includes calculating ...

Подробнее
Номер записи: 76
07-01-2016 дата публикации

COMPRESSION DEVICE, COMPRESSION METHOD, DECOMPRESSION DEVICE, DECOMPRESSION METHOD, INFORMATION PROCESSING SYSTEM, AND RECORDING MEDIUM

Номер: US20160006454A1
Автор: Kataoka Masahiro, OHTA Takafumi, Sakai Masanori
Принадлежит: FUJITSU LIMITED

A compression device includes a processor configured to execute a process. The process includes: storing, in a storage, a first compressed code in association with a first element, the first compressed code corresponding to a combination of a first element and a first delimiter, the first element being one of a plurality of elements constituting input data, the first delimiter being one of delimiters delimiting the plurality of elements and succeeding the first element in the input data; acquiring, from the storage, the first compressed code in response to reading a sequence of the first element and the first delimiter from the input data; and writing the first compressed code into a storage area that stores therein compressed data of the input data. 1. A compression device comprising:a processor configured to execute a process including:storing, in a storage, a first compressed code in association with a first element, the first compressed code corresponding to a combination of a first element and a first delimiter, the first element being one of a plurality of elements constituting input data, the first delimiter being one of delimiters delimiting the plurality of elements and succeeding the first element in the input data;acquiring, from the storage, the first compressed code in response to reading a sequence of the first element and the first delimiter from the input data; andwriting the first compressed code into a storage area that stores therein compressed data of the input data.2. The compression device according to claim 1 , whereinthe storing includes storing, in the storage, a first control code corresponding to a combination of a control symbol indicating an instruction to delete the first delimiter and the first delimiter,the acquiring includes acquiring, from the storage, the first compressed code and the first control code in response to reading the first element from the input data, andthe writing includes writing the first control code at a position ...

Подробнее
Номер записи: 77
07-01-2016 дата публикации

Compression device, compression method, dictionary generation device, dictionary generation method, decompression device, decompression method, information processing system, and recording medium

Номер: US20160006456A1
Автор: Chiori MURAMATSU, Masahiro Kataoka, Masao ldeuchi, Shinichiro Nishizawa
Принадлежит: Fujitsu Ltd

A compression device includes a processor configured to execute a process. The process includes: storing dictionary information in which a first compressed code assigned to a plurality of pieces of character information different from one another is associated with the pieces of character information; acquiring, when a first piece of character information among the pieces of character information is acquired, the first compressed code associated with the first piece of character information from the dictionary information; and writing the acquired first compressed code in a storage area to store compressed data.

Подробнее
Номер записи: 78
04-01-2018 дата публикации

Adaptive Stochastic Entropy Coding

Номер: US20180007361A1
Автор: Mukherjee Debargha
Принадлежит:

Adaptive stochastic entropy encoding may include identifying a current portion of an input video stream, and identifying a current probability distribution, which may be an adapted probability distribution associated with a previously encoded portion of the video stream. Adaptive stochastic entropy encoding may include identifying a forward update probability distribution based on the current portion, generating a modified probability distribution for the current portion based on the forward update probability distribution and the current probability distribution, generating an encoded portion based on the current portion and the modified probability distribution, and generating an adapted probability distribution based on the current probability distribution and the forward update probability distribution. 1. An apparatus for use in decoding a video stream using adaptive stochastic entropy coding , the apparatus comprising:a non-transitory computer-readable memory including instructions for adaptive stochastic entropy coding; and identifying a current probability distribution;', 'decoding a modified probability distribution from an encoded video stream using the current probability distribution;', 'generating a decoded current portion of a video stream by decoding the current portion from the encoded video stream using the modified probability distribution;', 'identifying a forward update probability distribution for the current portion;', 'generating an adapted probability distribution based on the current probability distribution and the forward update probability distribution; and', 'including the decoded current portion in an output for presentation., 'a processor, operatively coupled to the non-transitory computer-readable memory, for receiving the instructions from the non-transitory computer-readable memory and executing the instructions for adaptive stochastic entropy coding comprising2. The apparatus of claim 1 , wherein the processor executes the ...

Подробнее
Номер записи: 79
08-01-2015 дата публикации

Data Compression Systems and Methods

Номер: US20150009051A1
Автор: James J. Fallon
Принадлежит: REALTIME DATA LLC

Data compression using a combination of content independent data compression and content dependent data compression. In one aspect, a system for compressing data comprises: a processor; one or more content dependent data compression encoders; and a single data compression encoder. The processor is configured to analyze data within a data block to identify one or more parameters or attributes of the data wherein the analyzing of the data within the data block to identify the one or more parameters or attributes of the data excludes analyzing based solely on a descriptor that is indicative of the one or more parameters or attributes of the data within the data block; to perform content dependent data compression with the one or more content dependent data compression if the one or more parameters or attributes of the data are identified; and to perform data compression with the single data compression encoder, if the one or more parameters or attributes of the data are not identified.

Подробнее
Номер записи: 80
12-01-2017 дата публикации

Apparatuses, methods and systems for efficient ad-hoc querying of distributed data

Номер: US20170011093A1
Автор: Andrew Steele, Ryan LeCompte
Принадлежит: Quantifind Inc

The APPARATUSES, METHODS AND SYSTEMS FOR EFFICIENT AD-HOC QUERYING OF DISTRIBUTED DATA (“RTC”) provides a platform that, in various embodiments, is configurable to provide fast ad-hoc querying against large volumes of data. In one embodiment, the RTC is configurable to select a subset of fields from raw data in association with a domain and compact the corresponding data. Such packed records may be distributed to one or more worker nodes, which maintain the records and associated indexes. A master server facilitates query processing across the worker nodes.

Подробнее
Номер записи: 81
08-01-2015 дата публикации

Model calculation unit and control unit for calculating a data-based function model having data in various number formats

Номер: US20150012574A1
Автор: Bannow Nico, Fischer Wolfgang, Gunturo Andre
Принадлежит: ROBERT BOSCH GMBH

A model calculation unit for calculating a data-based function model, in particular a Gaussian process model, in a control unit, including: a processor core to carry out a strictly hardware-based calculation of an algorithm for a data-based function model, the data-based function model being calculated using provided calculation data, in particular hyperparameters and node data; and a strictly hardware-based conversion unit to provide the processor core with at least a portion of the calculation data, in particular the provided node data, in a predefined number format. 1. A model calculation unit for calculating a data-based function model in a control unit , comprising:a processor core configured to carry out a strictly hardware-based calculation of an algorithm for a data-based function model, the data-based function model being calculated using provided calculation data; anda strictly hardware-based conversion unit configured to provide the processor core with at least a portion of the calculation data in a predefined number format.2. The model calculation unit of claim 1 , wherein the conversion unit is configured to carry out claim 1 , as a function of a selection signal claim 1 , a conversion of at least a portion of the provided calculation data of one number format which differs from the predefined number format claim 1 , into the predefined number format.3. The model calculation unit of claim 1 , wherein the conversion unit includes at least one conversion block for converting a first number format of data into the predefined number format claim 1 , as well as a multiplexer claim 1 , in order claim 1 , as a function of the selection signal claim 1 , to forward to the processor core either the provided calculation data or the calculation data converted by one of the at least one conversion blocks into the predefined number format.4. The model calculation unit of claim 3 , wherein the predefined number format corresponds to a 32-bit floating point number ...

Подробнее
Номер записи: 82
27-01-2022 дата публикации

Data encoding method, decoding method, related device, and storage medium

Номер: US20220029635A1
Автор: Fuyi Wang
Принадлежит: TCL China Star Optoelectronics Technology Co Ltd

The present disclosure provides a data encoding method, a decoding method, a related device, and a storage medium. The data encoding method first passes a first bit stream of an original encoded data through a logical operation to obtain a second bit stream. Then, through signal determination, negating processing, and insertion of corresponding flag bit, encoded data having a certain jump amplitude is obtained. A problem that signal is prone to error in transmission process is solved, reliability of coding is improved, and signal transmission is facilitated.

Подробнее
Номер записи: 83
11-01-2018 дата публикации

SUPPORTING DATA COMPRESSION USING MATCH SCORING

Номер: US20180011656A1
Автор: Cutter Daniel F., Gopal Vinodh, Guilford James D., Wolrich Gilbert M.
Принадлежит:

A processing system is provided that includes a memory for storing an input bit stream and a processing logic, operatively coupled to the memory, to generate a first score based on: a first set of matching data related to a match between a first bit subsequence and a candidate bit subsequence within the input bit stream, and a first distance of the candidate bit subsequence from the first set of matching data. A second score is generated based on a second set of matching data related to a match between a second bit subsequence and the candidate bit subsequence, and a second distance of the candidate bit subsequence from the second set of matching data. A code to replace the first or second bit subsequence in an output bit stream is identified. Selection of the one of the bit subsequences to replace is based on a comparison of the scores. 120.-. (canceled)21. A processing device comprising: determine a first score for a first bit subsequence based on a location of the first bit subsequence in an input bit stream;', 'determine a second score for a second bit subsequence based on a location of the second bit subsequence in the input bit stream with respect to the first bit subsequence; and', 'update data associated with one of the first bit subsequence or the second bit subsequence in an output bit stream based on the first score and the second score., 'a data stream compression circuit to22. The processing device of claim 21 , wherein the data stream compression circuit is further to generate a binary code for the updated data based on a greater corresponding score of the first score and second score.23. The processing device of claim 22 , wherein the data stream compression circuit is further to replace in the output bit stream a bit subsequence associated with the greater corresponding score with the binary code.24. The processing device of claim 22 , wherein the greater corresponding score reflects a length of matching data between the first bit subsequence or the ...

Подробнее
Номер записи: 84
11-01-2018 дата публикации

HIGH-DENSITY COMPRESSION METHOD AND COMPUTING SYSTEM

Номер: US20180011869A1
Автор: Makris Kristis, Senthil Kumar M.
Принадлежит: CROSS COMMERCE MEDIA, INC.

Certain implementations of the disclosed technology may include methods and computing systems for performing high-density data compression, particularly on numerical data that demonstrates various patterns, and patterns of patters. According to an example implementation, a method is provided. The method may include extracting a data sample from a data set, compressing the data sample using a first compression filter configuration, and calculating a compression ratio associated with the first compression filter configuration. The method may also include compressing the data sample using a second compression filter configuration and calculating a compression ratio associated with the second compression filter configuration. A particular compression filter configuration to utilize in compressing the entire data set may be selected based on a comparison of the compression ratio associated with the first compression filter configuration and a compression ratio associated with the second compression filter configuration. 1. A method comprising:extracting, by a processor, a data sample from a data set;compressing, by the processor, the data sample using a first compression filter configuration comprising a first plurality of different compression filters arranged in a first sequence;calculating, by the processor, a first compression ratio associated with the first compression filter configuration;compressing, by the processor, the data sample using a second compression filter configuration comprising a second plurality of different compression filters arranged in a second sequence;calculating, by the processor, a second compression ratio associated with the second compression filter configuration;comparing, by the processor, the first compression ratio with the second compression ratio;selecting, by the processor, the first compression filter configuration or the second compression filter configuration based on the comparison of the first and second compression ratios to ...

Подробнее
Номер записи: 85
14-01-2021 дата публикации

System and method for hash-based entropy calculation

Номер: US20210011894A1
Автор: Istvan Gonczi, Ivan Basov, Philip Shilane, Philippe Armangau, Sorin Faibish, Vamsi Vankamamidi
Принадлежит: EMC IP Holding Co LLC

A method, computer program product, and computing system for receiving a candidate data portion; calculating a distance-preserving hash for the candidate data portion; and performing an entropy analysis on the distance-preserving hash to generate a hash entropy for the candidate data portion.

Подробнее
Номер записи: 86
14-01-2016 дата публикации

SYSTEMS AND PROCESSES FOR EFFICIENTLY STORING AND RETRIEVING VIDEO CONTENT

Номер: US20160012843A1
Автор: Major Darren, Major Robert Drew, Paul John Michael
Принадлежит:

Methods, systems and devices are described to improve the storage and retrieval of video content. The general concepts set forth herein could be used in any video storage system that uses disk drives to store video content, including remote or local storage digital video recorders (DVRs) and the like. 1. A system to manage storage of video content , the system comprising:an interface configured to receive the video content;a disk drive configured to store the video content on a spinning disk having an inner portion and an outer portion; and during a peak demand period, to direct the storage of the received video content along the outer portion of the spinning disk; and', 'during an off-peak demand period, to direct the transfer of video content stored along the outer portion of the spinning disk to the inner portion of the spinning disk so that the outer portion retains contiguous available storage space at the beginning of a subsequent peak demand period., 'a processor configured to control the reception of the video content via the interface and to direct the storage of the received video content on the disk drive, wherein the processor is configured2. The system of wherein the processor is further configured to direct the storage of the received video content along the inner portion of the spinning disk during the off-peak demand period.3. The system of wherein the processor is further configured to process reads of the video content during at least the peak demand period by aggregating multiple read operations into a single read session.4. The system of wherein the system further comprises a memory and wherein the video content obtained during the single read session is buffered in the memory.5. The system of wherein at least one of the read operations is a predicted read operation that predicts a future read operation that has not yet been received based upon a previously-received read operation.6. The system of wherein the system further comprises a memory and ...

Подробнее
Номер записи: 87
09-01-2020 дата публикации

Method and system for compressing and/or encrypting data files

Номер: US20200014399A1
Автор: Bruce Parker
Принадлежит: Pacbyte Solutions Pty Ltd

A method of transforming a data file, the method executed by a processor. The method includes segmenting the data file into data segments and creating a bit index for each data segment having a size that is based on a configurable or preset data group unit. The method then involves indexing each data segment into its corresponding bit index by reading all data group unit values within the data segment and updating the bit index based on the read values, and generating an output data file or files comprising the bit indexes that represent the original data file.

Подробнее
Номер записи: 88
21-01-2021 дата публикации

EFFICIENT STORAGE AND RETRIEVAL OF TEXTUAL DATA

Номер: US20210019340A1
Автор: Gupta Vipul
Принадлежит: Microsoft Technology Licensing, LLC

A method of and system of efficient storage of data entries containing textual data is disclosed. The method may include accessing a plurality of data entries in a dataset, arranging the plurality of data entries in the dataset in a lexical order, placing a predetermined number of the plurality of data entries in each of a plurality of subblocks, performing data compression on the plurality of data entries in each of the plurality of subblocks to reduce redundancy in the plurality of data entries and create compressed data entries, placing one or more subblocks in each of a plurality of page blocks, and storing each of the plurality of page blocks in a storage device to provide efficient searching and improved functionality for the dataset. 1. A data processing system comprising:a processor; and accessing a plurality of data entries in a dataset;', 'arranging the plurality of data entries in the dataset in a lexical order;', 'placing a predetermined number of the plurality of data entries in each of a plurality of subblocks;', 'performing data compression on the plurality of data entries in each of the plurality of subblocks to reduce redundancy in the plurality of data entries and create compressed data entries;', 'placing one or more subblocks in each of a plurality of page blocks; and', 'storing each of the plurality of page blocks in a storage device to provide efficient searching and improved functionality for the dataset., 'a memory in communication with the processor, the memory comprising executable instructions that, when executed by the processor, cause the data processing system to perform functions of2. The data processing system of claim 1 , wherein the plurality of subblocks are in a lexical order.3. The data processing system of claim 2 , wherein the plurality of page blocks are in a lexical order.4. The data processing system of claim 1 , wherein performing data compression on the plurality of data entries in each of the plurality of subblocks to ...

Подробнее
Номер записи: 89
17-04-2014 дата публикации

Data compression apparatus, data compression method, and memory system including the data compression apparatus

Номер: US20140108362A1
Автор: Dae-Wook Kim, Jpng-Rak Son, Jun-Jin Kong, Man-keun Seo, Tae-hwan Kim
Принадлежит: SAMSUNG ELECTRONICS CO LTD

Provided are data compression method, data compression apparatus, and memory system. The data compression method includes receiving input data and generating a hash key for the input data, searching a hash table with the generated hash key, and if it is determined that the input data is a hash hit, compressing the input data using the hash table; and searching a cache memory with the input data, and if it is determined that the input data is a cache hit, compressing the input data using the cache memory.

Подробнее
Номер записи: 90
26-01-2017 дата публикации

Decomposition of Decimal Floating Point Data

Номер: US20170024207A1
Автор: Lundvall Shawn D, Schwarz Eric M, Smith, SR. Ronald M, Yeh Phil C
Принадлежит:

A decimal floating point finite number in a decimal floating point format is composed from the number in a different format. A decimal floating point format includes fields to hold information relating to the sign, exponent and significand of the decimal floating point finite number. Other decimal floating point data, including infinities and NaNs (not a number), are also composed. Decimal floating point data are also decomposed from the decimal floating point format to a different format. 1. A method of decomposing a decimal floating point datum , said method comprising:obtaining, by a processor of an emulated processing environment, a datum in a decimal floating point format;converting a significand of the datum in the decimal floating point format to the significand in a first format; andconverting an exponent of the datum in the decimal floating point format to the exponent in a second format, wherein in response to converting the significand and converting the exponent the datum is provided in a format other than the decimal floating point format.2. The method of claim 1 , wherein the first format comprises a packed decimal format and the second format comprises a binary integer format.3. The method of claim 1 , further comprising providing a sign for the datum.4. The method of claim 1 , wherein the converting the significand comprises:converting a number of least significant digits of the significand into a packed decimal format and storing the result in a first register pair;shifting the significand of a first floating point register pair a specified number of places;converting remaining digits of the significand into a packed decimal format and storing the result in a second register pair;combining a plurality of digits of the second register pair and contents of the first register pair to provide a decomposed value.5. The method of claim 4 , wherein the combining comprises concatenating the plurality of digits and the contents of the first register pair in ...

Подробнее
Номер записи: 91
25-01-2018 дата публикации

TECHNIQUES TO PROVIDE A MULTI-LEVEL MEMORY ARCHITECTURE VIA INTERCONNECTS

Номер: US20180024958A1
Автор: Kumar Mohan J., Nachimuthu Murugasamy K.
Принадлежит:

Various embodiments are generally directed to an apparatus, method and other techniques to enable memory interfaces to communicate read request, write requests, and data via an interconnect. Embodiments, include processing write requests to write data into memory coupled via an interconnect and processing read requests to read data from memory coupled via an interconnect. In embodiments, the data may be compressed data based on a compression mechanism and communicated in a fabric packet including a compression mechanism indicator, the compressed data, and an address, the compression mechanism indicator to indicate which compression mechanism is applied to the data. 1. An apparatus , comprising: generate compressed data based on a compression mechanism to be applied to data, and', 'generate a fabric packet including a compression mechanism indicator, the compressed data, and an address to write the data in at least one of a second level memory and a third level memory, the compression mechanism indicator to indicate which compression mechanism is applied to the data., 'a memory interface coupled to a memory controller, the memory interface to2. The apparatus of claim 1 , the compression mechanism indicator to indicate the compression mechanism is one of a byte pattern repeat claim 1 , a word pattern repeat claim 1 , a double word (Dword) pattern repeat claim 1 , a quad word (Qword) pattern repeat claim 1 , and a compression alogrithm.3. The apparatus of claim 1 , the second level memory comprising one or more volatile memory devices and the third level memory comprising one or more byte addressable write-in-place non-volatile memory devices.4. The apparatus of claim 1 , the memory interface to send the compressed data to the at one of the second level memory and the third level memory via an interconnect comprising one of an optical interconnect and an electrical interconnect.5. The apparatus of claim 1 , the memory interface to:receive another fabric packet ...

Подробнее
Номер записи: 92
25-01-2018 дата публикации

GRAPH-BASED COMPRESSION OF DATA RECORDS

Номер: US20180025381A1
Автор: "LHuillier Gaston", Arroyo Garcia Herman Enrique, Frisbie Joe, Larrain Francisco Jose, Zilleruelo-Ramos Ricardo A.
Принадлежит:

In general, embodiments of the present invention provide systems, methods and computer readable media for data record compression using graph-based techniques. 130-. (canceled)31. A computer-implemented method for generating a compressed list of impression data records , the method comprising:receiving, by a processor, a set of impression data records describing a sequence of consumer behavior instances collected during a time window, wherein the set of impression data records is associated with a particular consumer;generating, by the processor, a directed link graph representing the consumer behavior instances; andgenerating, by the processor, the compressed list of the impression data records based at least in part on properties of the directed link graph.32. The method of claim 31 , wherein each impression data record of the set of impression data records comprises a plurality of data components.33. The method of claim 31 , wherein the graph nodes respectively represent the consumer behavior instances and each of the graph edges connecting a pair of the nodes represents a hyperlink between the nodes.34. The method of claim 31 , further comprising:determining a first component of the set of impression data records to be an index component;generating a sorted list of the set of impression data records by ordering the set of impression data records using a respective value of the index component within each impression data record;identifying a set of unique index component values within the sorted list of the set of impression data records; andgenerating an ordered list of the set of unique index component values using the sorted list of the set of impression data records.35. The method of claim 34 , further comprising generating an index value list by replacing each impression data record of the set of impression data records with its respective position in the ordered list of the set of unique index component values.36. The method of claim 35 , further comprising ...

Подробнее
Номер записи: 93
26-01-2017 дата публикации

DATA COMPRESSION DEVICE AND METHOD

Номер: US20170026054A1
Автор: Nagata Jun-ichi
Принадлежит: FUJITSU LIMITED

A data compression device including a processor to perform a procedure comprising: obtaining data of a predetermined number (Z) of digits in a time series; and performing a compression process on the data. The data is obtained by encoding a vibration state of a measurement target. The compression process includes: deleting upper digits when the upper digits do not include significant information; and adding a unique code to a top of the upper digits when the upper digits include significant information. A digit number (X) of the upper digits is smaller than the predetermined number (Z). 1. A data compression device including a processor to perform a procedure , the procedure comprising:obtaining data of a predetermined number (Z) of digits in a time series, the data being obtained by encoding a vibration state of a measurement target; andperforming a compression process on the data,wherein the compression process includes:deleting upper digits when the upper digits do not include significant information, a digit number (X) of the upper digits being smaller than the predetermined number (Z); andadding a unique code to a top of the upper digits when the upper digits include significant information.2. The data compression device according to claim 1 , wherein the processor performs the compression process on a difference between items of the data adjacent in the time series.3. The data compression device according to claim 1 , wherein the processor sets the digit number (X) based on a variance value of the data in the time series.4. The data compression device according to claim 2 , wherein the processor sets the digit number (X) based on a variance value of the data in the time series.5. The data compression device according to claim 3 , wherein the processor estimates the variance value based on a number of times that the difference between the items of the data adjacent in the time series is less than a predetermined value.6. The data compression device according to ...

Подробнее
Номер записи: 94
26-01-2017 дата публикации

Methods and Systems for Storing and Retrieving Data

Номер: US20170026172A1
Автор: Ignomirello Brian
Принадлежит:

Through use of the technologies of the present invention, one is able to store and to retrieve data efficiently. One may realize these efficiencies by coding the data and storing coded data that is of a smaller size than original data. 119.-. (canceled)20. A method for storing data on a non-cache recording medium comprising:i. receiving an I/O stream of N Bytes;ii. fragmenting the N Bytes into fragmented units of X Bytes;iii. applying a cryptographic hash function to each fragmented unit of X Bytes to form a generated hash function value for each fragmented unit of X Bytes;iv. encoding each hash function value for storage through use of a bit marker table to generate a bit marker for each hash function value for storage and storing each bit marker in the non-cache recording medium; (a) if the generated hash function value for a fragmented unit of X Bytes is in the correlation file, using the stored hash function value of Y bits for storage on a non-cache recording medium; and', '(b) if the generated hash function value for the fragmented unit of X Bytes is not in the correlation file, then storing the generated hash function value of Y bits with the fragmented unit of X Bytes in the correlation file and using the generated hash function value for storage on the non-cache recording medium., 'v. accessing a correlation file, wherein the correlation file associates a stored hash function value of Y bits with each of a plurality of stored sequences of X Bytes and'}21. The method according to claim 20 , wherein in (iii) the cryptographic hash function is the MD5 Message-Digest Algorithm.22. The method according to further comprising storing a plurality of hash function values on the non-cache recording medium.23. The method according to further comprising encoding each hash function value for storage through use of a frequency of occurrence converter claim 20 , wherein for each hash function value for storage claim 20 , a converted string of bits is generated claim 20 , ...

Подробнее
Номер записи: 95
26-01-2017 дата публикации

SIGNAL PROCESSING METHOD

Номер: US20170026222A1
Автор: Butussi Matteo, ROSATI Stefano, Tomasin Stefano
Принадлежит: ALi Europe Sarl

A signal method of processing in a receiver a signal that has been encoded and interleaved in a transmitter comprising: receiving a signal, process the signal to obtain a stream of soft metrics representing bit probability of symbols in a predetermined constellation; applying to said soft metric a compression operation that preserves the total length of each group of soft metrics relative to a same constellation symbol; rearranging the stream of compressed soft metrics so as to inverse the interleaving done in the transmitter. 1. A method of compressing a stream of fixed-point representations of soft metrics in a receiver , comprisingdemultiplexing the soft metrics so as to obtain a plurality sub-streams having distinct statistics distributions.applying to each sub-stream an entropy code adapted to its statistic distribution.2. The method of claim 1 , further comprisingreconstruct a transmitted message according to each of the sub-stream which is applied with the entropy code adapted to its statistic distribution.3. The method of claim 1 , comprising a step of quantizing the soft metrics prior to the step of demultiplexing the soft metrics.4. The method of claim 1 , wherein said soft metrics are represented as fixed-point numbers.5. The method of claim 3 , wherein the quantizing operation generates a constant number of bits for each group of soft metrics relative to a same constellation symbol.6. The method of claim 3 , wherein the quantizing operation generates different number of bits for each soft metric relative to a same constellation symbol. This application is a divisional application of and claims the priority benefits of U.S. non-provisional application Ser. No. 14/422,149, filed on Feb. 17, 2015, now allowed. The prior U.S. non-provisional application Ser. No. 14/422,149 is a 371 application of the International PCT application serial no. PCT/EP2012/066286, filed on Aug. 21, 2012. The entirety of each of the above-mentioned patent applications is hereby ...

Подробнее
Номер записи: 96
25-01-2018 дата публикации

METHOD FOR DATA COMPRESSION

Номер: US20180026649A1
Автор: Harik Georges
Принадлежит:

A data compression system includes: (a) a data compression module that receives a sequence of input vectors and that provides a sequence of compressed vectors; (b) a data decompression module that receives the compressed vectors to provide a sequence of output vectors; and (c) a parameter update module that receives the sequence of input vectors and the sequence of output vectors, and which learns the data compression module and data decompression module based on evaluating a loss function of the input vectors, the output vectors, and the parameters controlling the compression module and the decompression module. Each input vector and its corresponding output vector may represent digitized time-domain signals (e.g., speech, audio or video signals) over a predetermined time period. The loss function may be evaluated for each of a sequence of predetermined time periods. 1. A data compression system , comprising:a data compression module that receives a sequence of input vectors and that provides a sequence of compressed vectors, wherein the total number of data bits representing the input vectors is greater than the number of data bits representing the compressed vectors and wherein the data compression module implements a computational model characterized by a first set of parameters;a data decompression module that receives the compressed vectors to provide a sequence of output vectors, wherein the total number of data bits representing the output vectors is greater than the total number of data bits representing the compressed vectors and wherein the data decompression module implements a computational model characterized by a second set of parameters; anda parameter update module that receives the sequence of input vectors and the sequence of output vectors, wherein the parameter update module updates values of the first set of parameters and the second set of parameters based on a loss function of the input vectors, the output vectors, the first set of parameters ...

Подробнее
Номер записи: 97
25-01-2018 дата публикации

TECHNOLOGIES FOR PERFORMING LOW-LATENCY DECOMPRESSION WITH TREE CACHING

Номер: US20180026651A1
Автор: Cutter Daniel F., Gopal Vinodh, Guilford James D., Yap Kirk S.
Принадлежит:

Technologies for performing low-latency decompression include a managed node to parse, in response to a determination that a read tree descriptor does not match a cached tree descriptor, the read tree descriptor to construct one or more tables indicative of codes in compressed data. Each code corresponds to a different symbol. The managed node is further to decompress the compressed data with the one or more tables and store the one or more tables in association with the read tree descriptor in a cache memory for subsequent use. 1. A managed node for efficiently decompressing data , the managed node comprising:a cache memory; and parse, in response to a determination that a read tree descriptor does not match a cached tree descriptor, the read tree descriptor to construct one or more tables indicative of codes in compressed data, wherein each code corresponds to a different symbol;', 'decompress the compressed data with the one or more tables; and', 'store the one or more tables in association with the read tree descriptor in the cache memory for subsequent use., 'a data manager to2. The managed node of claim 1 , wherein the data manager is further to:obtain the compressed data, wherein the data is compressed with one or more trees indicative of frequencies of the symbols in an uncompressed form of the data;read a tree descriptor from the compressed data, wherein the tree descriptor is a variable length sequence of values indicative of a structure of the one or more trees; anddetermine whether the read tree descriptor matches a cached tree descriptor in the cache memory.3. The managed node of claim 2 , wherein the data manager is further to:select, in response to a determination that the read tree descriptor matches a cached tree descriptor, one or more tables stored in the cache memory in association with the cached tree descriptor; anddecompress the compressed data with the selected one or more tables.4. The managed node of claim 2 , wherein to obtain the ...

Подробнее
Номер записи: 98
25-01-2018 дата публикации

TECHNOLOGIES FOR HIGH-PERFORMANCE SINGLE-STREAM LZ77 COMPRESSION

Номер: US20180026654A1
Автор: Cutter Daniel F., Gopal Vinodh, Guilford James D., Yap Kirk S.
Принадлежит:

Technologies for high-performance single-stream data compression include a computing device that updates an index data structure based on an input data stream. The input data stream is divided into multiple chunks. Each chunk has a predetermined length, such as 136 bytes, and overlaps the previous chunk by a predetermine amount, such as eight bytes. The computing device processes multiple chunks in parallel using the index data to generate multiple token streams. The tokens include literal tokens and reference tokens that refer to matching data from earlier in the input data stream. The computing device thus searches for matching data in parallel. The computing device merges the token streams to generate a single output token stream. The computing device may merge a pair of tokens from two different chunks to generate one or more synchronized tokens that are output to the output token stream. Other embodiments are described and claimed. 1. A computing device for data compression , the computing device comprising:updater circuitry to update an index data structure based on an input data stream, wherein the index data structure includes index data associated with offsets in the input data stream, and wherein the input data stream is divided into a plurality of chunks, wherein each chunk has a first length;a plurality of search slice circuitry, wherein respective search slice circuitry is to process a disjoint subset of the plurality of chunks of the input data stream to generate a corresponding token stream, wherein respective search slice circuitry uses the index data to process the disjoint subset of the plurality of chunks; andmerger circuitry to merge the plurality of token streams to generate an output token stream.2. The computing device of claim 1 , wherein each chunk overlaps a previous chunk by a second length.3. The computing device of claim 2 , wherein the first length comprises 136 bytes and the second length comprises eight bytes.4. The computing device ...

Подробнее
Номер записи: 99
25-01-2018 дата публикации

TECHNOLOGIES FOR PERFORMING SPECULATIVE DECOMPRESSION

Номер: US20180026655A1
Автор: Gopal Vinodh, Guilford James D., Yap Kirk S.
Принадлежит:

Technologies for performing speculative decompression include a managed node to decode a variable size code at a present position in compressed data with a deterministic decoder and concurrently perform speculative decodes over a range of subsequent positions in the compressed data, determine the position of the next code, determine whether the position of the next code is within the range, and output, in response to a determination that the position of the next code is within the range, a symbol associated with the deterministically decoded code and another symbol associated with a speculatively decoded code at the position of the next code. 1. A managed node for speculatively decompressing data , the managed node comprising:a deterministic decoder;one or more speculative decoders; and decode a variable size code at a present position in compressed data with the deterministic decoder and concurrently perform speculative decodes over a range of subsequent positions in the compressed data with the one or more speculative decoders, wherein the range of subsequent positions are determined as a function of the present position and a determined smallest code size;', 'determine a position of a next code by adding a size of the deterministically decoded code to the present position;', 'determine whether the position of the next code is within the range; and', 'output, in response to a determination that the position of the next code is within the range, a first symbol associated with the deterministically decoded code and a second symbol associated with a speculatively decoded code at the position of the next code., 'a decompression manager to2. The managed node of claim 1 , wherein the decompression manager is further to:output, in response to a determination that the position of the next code is not within the range, the first symbol without a second symbol.3. The managed node of claim 1 , wherein the decompression manager is further to:obtain the compressed data, ...

Подробнее
Номер записи: 100