Abstract: Systems and methods for transforming a logical data object for storage in a storage device operable with at least one storage protocol, creating, reading, writing, optimization and restoring thereof. Transforming the logical data object comprises creating in the storage device a transformed logical data object comprising and one or more allocated storage sections with a predefined size; processing one or more sequentially obtained chunks corresponding to the transforming logical data object, wherein at least one of said processed data chunks comprises transformed data resulting from said processing; sequentially storing the processed data chunks into said storage sections in accordance with an order the chunks received. The method further includes reading a data range from the transformed logical object in response to a read request specifying desired point in time to be read.

Abstract: Systems and methods for compressing a raw logical data object (201) for storage in a storage device operable with at least one storage protocol, creating, reading, writing, optimizatic in and restoring thereof. Compressing the raw logical data object (201) comprises creating in the storage device a compressed logical data object (203) comprising a header (204) and one or more allocated compressed sections with predefined size (205-1-205-2); compressing one or more sequentially obtained chunks of raw data (202-1-202-6) corresponding to the raw logical data object (201) thus giving rise to the compressed data chunks (207-1-207-6); and sequentially accommodating the processed data chunks into: said compressed sections (205-1-205-2) in accordance with an order said chunks received, wherein said compressed sections serve as atomic elements of compression/decompression operations during input/output transactions on the logical data object.

Abstract: A method and system for transforming a logical data object for storage in a storage device operable with at least one storage protocol, creating, reading, writing, optimization and restoring thereof.

Abstract: A cross system secure logon in a target system by using a first authentication system and a second authentication system. A correct password may be valid on the first authentication system and the second authentication system. An aspect includes receiving an input password, generating a first hash key by using the first authentication system, and/or generating a second hash key by using the second authentication system, wherein each authentication system uses a system unique non-collision free hash algorithm. Further, in one aspect, comparing the first hash key with a first predefined hash key of the correct password stored in the first authentication system, and/or comparing the second hash key with a second predefined hash key of the correct password stored in the second authentication system. Furthermore, granting access to the target system based on at least one of the comparisons.

Abstract: Systems and methods for transforming a logical data object for storage in a storage device operable with at least one storage protocol, creating, reading, writing, optimization and restoring thereof. Transforming the logical data object comprises creating in the storage device a transformed logical data object comprising one or more allocated storage sections with a predefined size; transforming one or more sequentially obtained chunks of obtained data corresponding to the transforming logical data object; and sequentially storing the processed data chunks into said storage sections in accordance with a receive order of said chunks, wherein said storage sections serve as atomic elements of transformation/de-transformation operations during input/output transactions on the logical data object.

Abstract: Systems and methods for compressing a raw logical data object (201) for storage in a storage device operable with at least one storage protocol, creating, reading, writing, optimizatic in and restoring thereof. Compressing the raw logical data object (201) comprises creating in the storage device a compressed logical data object (203) comprising a header (204) and one or more allocated compressed sections with predefined size (205-1-205-2); compressing one or more sequentially obtained chunks of raw data (202-1-202-6) corresponding to the raw logical data object (201) thus giving rise to the compressed data chunks (207-1-207-6); and sequentially accommodating the processed data chunks into: said compressed sections (205-1-205-2) in accordance with an order said chunks received, wherein said compressed sections serve as atomic elements of compression/decompression operations during input/output transactions on the logical data object.

Abstract: Disclosed are systems, apparatus, and methods for encoding data transmitted in a data line. In various embodiments, a device may include a first input port operative to receive a first data value. In some embodiments, the device may further include a first memory device operative to look up a second data value based on the first data value, where the second data value is a representation of the first data value encoded according to an encoding scheme that allows clock recovery, and where the memory device is operative to be configured according to a plurality of line encoding schemes. In various embodiments, the device may further include a first output port operative to provide an output signal, where the output signal comprises one or more data values including the second data value.

Abstract: A particular implementation receives geometry data of a 3D mesh, and represents the geometry data with an octree. The particular implementation partitions the octree into three parts, wherein the symbols corresponding to the middle part of the octree are hierarchical entropy encoded. To partition the octree into three parts, different thresholds are used. Depending on whether a symbol associated with a node is an S1 symbol, the child node of the node is included in the middle part or the upper part of the octree. In hierarchical entropy encoding, a non-S1 symbol is first encoded as a pre-determined symbol ‘X’ using symbol set S2={S1, ‘X’} and the non-S1 symbol itself is then encoded using symbol set S0 (S2?S0), and an S1 symbol is encoded using symbol set S2. Another implementation defines corresponding hierarchical entropy decoding. A further implementation reconstructs the octree and restores the geometry data of a 3D mesh from the octree representation.

Abstract: One embodiment of the present invention is a method for increasing the speed of a computer in identifying occurrences of strings in a character stream that match a string pattern involving repetitions of characters of a particular character class. The method uses a parallel bit stream processing module of the computer, which processing module includes a processor equipped with parallel processing instructions, to form a plurality of parallel property bit streams Pj.

Abstract: A coding method, a decoding method, a coder, and a decoder are disclosed herein. A coding method includes: obtaining the pulse distribution, on a track, of the pulses to be encoded on the track; determining a distribution identifier for identifying the pulse distribution according to the pulse distribution; and generating a coding index that includes the distribution identifier. A decoding method includes: receiving a coding index; obtaining a distribution identifier from the coding index, wherein the distribution identifier is configured to identify the pulse distribution, on a track, of the pulses to be encoded on the track; determining the pulse distribution, on a track, of all the pulses to be encoded on the track according to the distribution identifier; and reconstructing the pulse order on the track according to the pulse distribution.

Abstract: A binary allocation in a hierarchical coding/decoding comprising a coding/decoding of a digital signal enhancement layer. The signal comprises a succession of L samples, each sample being represented by a mantissa and an exponent. The method comprises the allocation of a predetermined number Nb of enhancement bits to a part at least of the L samples of highest exponent values. In particular, the method comprises the steps: a) enumerating the exponents of the L samples each having a given value, b) calculating at least one aggregate of enumerations of exponents by decreasing values of exponent until the predetermined number Nb is approximated from above, for c) determining a threshold value of largest exponent iexp0 of sample for which no more enhancement bit is available, and allocating the Nb enhancement bits, according to chosen rules, to the samples whose exponent is greater than the aforesaid threshold value iexpo.

Abstract: Methods and circuits are described for creating low-weight codes, encoding of data as low-weight codes for communication or storage, and efficient decoding of low-weight codes to recover the original data. Low-weight code words are larger than the data values they encode, and contain a significant preponderance of a single value, such as zero bits. The resulting encoded data may be transmitted with significantly lower power and/or interference.

Abstract: A data processing apparatus that is capable of reducing the garbling of characters caused by the difference among the character codes when setting data are transferred to another apparatus by the import-export function. A storage unit stores setting data for the data processing apparatus. A receiving unit receives an instruction for exporting the setting data stored in the storage unit. A converting unit converts Unicode data included in the setting data into character code data of language, which is set to the data processing apparatus. An export unit exports the character code data converted by the converting unit and the Unicode data.

Abstract: A method and apparatus for symbol-space based compression of patterns are provided. The method comprises receiving an input sequence, the input sequence being of a first length and comprising a plurality of symbols; extracting all common patterns within the input sequence, wherein a common pattern includes at least two symbols; generating an output sequence responsive of the extraction of all common patterns, wherein the output sequence has a second length that is shorter than the first length; and storing in a memory the output sequence as a data layer, wherein the output sequence is provided as a new input sequence for a subsequent generation of a data layer.

Abstract: An integrated circuit includes an array of memory cells and a digital flag generator circuit configured to generate a data inversion flag based on whether a number of logical zero bits contained in a data word to be transmitted from the memory cells is greater than a threshold number. The digital flag generator circuit includes a first digital stage including a first plurality of binary logic circuits. Each of the binary logic circuits is configured to receive a subset of the data word.

Abstract: An apparatus for upmixing a downmix audio signal describing one or more downmix audio channels into an upmixed audio signal describing a plurality of upmixed audio channels includes an upmixer configured to apply temporally variable upmixing parameters to upmix the downmix audio signal in order to obtain the upmixed audio signal. The apparatus also includes a parameter interpolator, wherein the parameter interpolator is configured to obtain one or more temporally interpolated upmix parameters to be used by the upmixer on the basis of a first complex-valued upmix parameter and a subsequent second complex-valued upmix parameter.

Abstract: A data processing apparatus and a data processing method thereof are provided. The data processing apparatus includes a register and a processor electrically connected to the register. The register is stored with a plurality of data. The plurality of data each includes a first sub-datum and a second sub-datum. The plurality of first sub-data corresponds to a first column and the plurality of second sub-data corresponds to a second column. The processor compresses the first sub-data by a first compression algorithm according to a first characteristic of the plurality of first sub-data and compresses the second sub-data by a second compression algorithm according to a second characteristic of the plurality of second sub-data.

Abstract: A system reads a metadata byte in a compressed data fragment. The metadata byte includes information pertaining to a sequence of instruction sets to decode data in the compressed data fragment. The sequence of instruction sets follows the metadata byte and one or more literal data sets corresponding to the sequence of instruction sets follows the sequence of instruction sets. The system determines a location of the one or more literal data sets in the compressed data fragment using the metadata byte prior to reading the sequence of instruction sets. The system determines the lengths of the one or more literal data sets based on the sequence of instruction sets and copies the one or more literal data sets, as a batch job for the sequence of instruction sets, to an in-memory data store based on the location and using the lengths.

Abstract: Embodiments relate to table compression in a database. The database is organized in tables including rows and columns An aspect includes defining a range partition of a table of the database according to a first attribute of the table. Internal ranges of the table of the database are defined according to a second attribute of the table. A target internal range of the internal ranges is determined to insert a row as a new entry into the table. A determination is made as to whether an internal range compression directory exists for the target internal range. Based on determining that no internal range compression directory exists for the target internal range and a predefined threshold value of a number of rows is exceeded in the target internal range, the internal range compression directory for the target internal range is created.

Abstract: Methods and devices for efficient encoding/decoding of a time segment of an audio signal. Methods comprise deriving an indicator, z, of the position in a frequency scale of a residual vector associated with the time segment of the audio signal, and deriving a measure, ?, related to the amount of structure of the residual vector. The methods further comprise determining whether a predefined criterion involving the measure ?, the indicator z and a predefined threshold ?, is fulfilled, which corresponds to estimating whether a change of sign of at least some of the non-zero coefficients of the residual vector would be audible after reconstruction of the audio signal time segment. The amplitude of the coefficients of the residual vector is encoded, and the signs of the coefficients of the residual vector are encoded only when it is determined that the criterion is fulfilled, and thus that a change of sign would be audible.

Abstract: A transmitter (TX) for transmitting a pulse density modulated signal comprises means (SDM) for generating a pulse density modulated input signal (SI) and an encoder (ENC). The encoder (ENC) comprises a first input for receiving the pulse density modulated input signal (SI) and a second input for receiving additional information (AI) comprising at least one data bit. The encoder (ENC) is configured to generate a multi-bit telegram (TG) on the basis of the additional information (AI), the telegram (TG) comprising a predefined bit-sequence, and to replace an appropriate number of consecutive bits of the input signal (SI) with the telegram (TG) in order to generate an output signal (SO).

Abstract: A particular implementation receives geometry data of a 3D mesh, and represents the geometry data with an octree. The particular implementation partitions the octree into three parts, wherein the symbols corresponding to the middle part of the octree are hierarchical entropy encoded. To partition the octree into three parts, different thresholds are used. Depending on whether a symbol associated with a node is an S1 symbol, the child node of the node is included in the middle part or the upper part of the octree. In hierarchical entropy encoding, a non-S1 symbol is first encoded as a pre-determined symbol ‘X’ using symbol set S2={S1, ‘X’} and the non-S1 symbol itself is then encoded using symbol set S0 (S2?S0), and an S1 symbol is encoded using symbol set S2. Another implementation defines corresponding hierarchical entropy decoding. A further implementation reconstructs the octree and restores the geometry data of a 3D mesh from the octree representation.

Abstract: A method and apparatus for low complexity combinatorial coding and decoding of signals is described herein. During operation, an encoder and a decoder will utilize a first function in determining a codeword or vector when the size of the function is small. The encoder and the decoder will also utilize a second function in determining the codeword or vector when the size of the function is large.

Abstract: A data transfer method multiplexes a data character having a bit width M (M is a natural number greater than or equal to 3) and a control character having a bit width N (N is a natural number greater than or equal to 1), and adds a control character valid signal indicating whether the control character is valid, in order to generate a symbol code having a bit width M+1 or N+3, whichever is greater, and converts the symbol code from parallel data into serial data to be output to a transmission line.

Abstract: A method and apparatus for encoding structured data by fragmenting the structured data into fragments according to a configuration of the structured data and encoding the fragments to generate encoded fragments using a string table including strings contained in the structured data.

Abstract: A management module registers a request to convert code from a first code set to a second code set, identifies a code set converter (CSC), determines whether a most recently used CSC is the identified CSC and, in response to determining that the most recently used CSC is not the identified CSC, locates a user-preferred CSC pool comprising a subset of locally stored CSCs each corresponding to a preference index. The management module, in response to determining that the identified CSC is located within the user-preferred CSC pool, searches the user-preferred CSC pool for the identified CSC, loads the identified CSC, initiates the identified CSC that converts the code from the first code set to the second code set, modifies usage data for the identified CSC, and orders the user-preferred CSC pool based on a preference index for each CSC stored in the CSC pool.

Abstract: A system and method for sending binary data via a short message service (SMS) over a wireless communication system. The method provides the capability to send and receive binary data to a vehicle telematics unit using a text SMS message. The binary data is converted to encoded text according to an encoding scheme supported by a wireless communication system. Then, the encoded text is sent as an SMS message over the wireless communication system. Once, the SMS message containing the encoded text is received at its destination, it is converted back to binary data.

Abstract: The present invention relates to data compression using compression dictionary. A compression method according to the invention comprises obtaining an initial compression dictionary and a separate secondary dictionary SD; determining at least one subpart of the secondary dictionary that correlates with a block of data DB to compress; updating the initial compression dictionary by inserting the determined at least one subpart therein, to obtain an updated compression dictionary used for compressing the block of data; and compressing the block of data using one or more references to entries of the obtained updated compression dictionary.

Abstract: Disclosed are systems, apparatus, and methods for encoding data transmitted in a data line. In various embodiments, a device may include a first input port operative to receive a first data value. In some embodiments, the device may further include a first memory device operative to look up a second data value based on the first data value, where the second data value is a representation of the first data value encoded according to an encoding scheme that allows clock recovery, and where the memory device is operative to be configured according to a plurality of line encoding schemes. In various embodiments, the device may further include a first output port operative to provide an output signal, where the output signal comprises one or more data values including the second data value.

Abstract: A method for encoding an input sequence of symbols to produce a bitstream and a method of decoding the bitstream to generate a reconstructed binary sequence. Encoding employs an encoding tree having primary codewords associated with leaf nodes and secondary codewords associated with internal nodes. A flush event may cause output of secondary codewords. A context model is used to select an encoding tree corresponding to an estimated probability at the encoder. The same context model is used by the decoder to select a decoding tree. The decoder interleaves bits from decoded bit sequences associated with different estimated probabilities based on the context model.

Abstract: Methods and apparatus for compressing data for network transport in support of continuous availability of applications are described. One computer-implemented method of compressing data includes receiving a current instance of data in an input buffer. A candidate chunk of data is selected from the input buffer. A signature hash is computed from a signature length range of data within the candidate chunk. A matching dictionary entry having a matching signature hash from a multi-tiered dictionary is identified. The matching dictionary entry prospectively identifies a location of a prior occurrence of a selected range of consecutive symbols including the signature length range of data within at least one of the current instance of data and a prior instance of data in the input buffer. A dedupe processed representation of the instance of data is formed wherein a dedupe item is substituted for the selected range of consecutive symbols if the selected range is verified as recurring.

Abstract: A method for delivering media content over a network includes transcoding the media content to generate multiple copies of the media content, each of the multiple copies having a different destination type or a different source type or both, storing the multiple copies in a cache, receiving requests for the media content, and selecting and delivering a copy of one of the multiple copies in response to each of the requests. A further method for providing media content transcoding services includes fetching media content, selecting one of multiple transcoders for transcoding from multiple source types to multiple destination types, wherein the one transcoder is selected based at least on the destination type, sending the media content to the selected transcoder, transcoding the media content to the destination type, thereby generating transcoded media content, and transmitting the transcoded media content.

Abstract: Disclosed are systems and methods used in motion estimation and particularly for data compression. Embodiments of the invention may store and operate on an n-bit value in less than n bits. In one embodiment, if the multi-bit value is less than a threshold, then the multi-bit value is stored in the reduced-bit storage directly, with no loss of precision. If the multi-bit value is greater than the threshold, then the Most Significant Bits (MSBs) of the multi-bit value are shifted onto the reduced-bit storage, and a compression flag set. To decompress, if the compression flag was not set, the bits stored in the reduced-bit storage are merely copied back into the multi-bit value directly. If the compression flag was set, then the bits stored in the reduced-bit storage are shifted (left) by the same amount they were shifted (right) during compression, and an error-minimizing value is added.

Abstract: A data processing apparatus that is capable of reducing the garbling of characters caused by the difference among the character codes when setting data are transferred to another apparatus by the import-export function. A storage unit stores setting data for the data processing apparatus. A receiving unit receives an instruction for exporting the setting data stored in the storage unit. A converting unit converts Unicode data included in the setting data into character code data of language, which is set to the data processing apparatus. An export unit exports the character code data converted by the converting unit and the Unicode data.

Abstract: A data encoding scheme for transmission of data from one circuit to another circuit combines DBI encoding and non-DBI encoding and uses a data mask signal to indicate the type of encoding used. The data mask signal in a first state indicates that the data transmitted from one circuit to said another circuit is to be ignored, and the data mask signal in a second state indicates that the data transmitted from one circuit to said another circuit is not to be ignored. If the data mask signal is in the second state, a first subset of the data is encoded with data bus inversion and a second subset of the data is encoded differently from data bus inversion. Such encoding has the advantage that SSO noise is dramatically reduced when the encoded data is transmitted from one circuit to another circuit.

Abstract: The present invention relates to a signal modulation device, a transmission method, and a code generation method. The signal modulation device includes a code storage unit including a plurality of n-bit members and storing a code with a number n or n?1 of different bits between two neighboring members, and a mapper for mapping data on symbols according to the code.

Abstract: Systems and methods for decoding data using a hybrid decoder are provided. A data signal that includes a codeword is received. A signal quality indicator for the data signal is computed. One of a plurality of decoders is selected based on the computed signal quality indicator. Each of the plurality of decoders is configured to decode information based on a different decoding technique. The codeword included in the data signal is decoded using the selected one of the plurality of decoders.

Abstract: Methods and apparatuses for nucleic aced sequencing using a compacted code technique are disclosed. In one embodiment, a method includes providing a nucleic acid to be sequenced, determining the identity of each base in a subsequence of bases in the nucleic acid, encoding the identity of the subsequence in a format having a number of bytes that is less than the number of bases, and storing the encoded identity.

Abstract: The present invention provides a method and apparatus for compressing or decompressing data in Fiber Channel (FC) services. In the solution of the present invention, when compressing FC data, a K code indicator bit and an ERR code indicator bit are compressed into a K/ERR code indicator bit, and 8b codes and the K/ERR code indicator bit are compressed into 9b codes; when decompressing FC data, the 9b code is decompressed into 8b codes and a K/ERR code indicator bit, and the K/ERR code indicator bit is decompressed into a K code indicator bit and an ERR code indicator bit. The solution provided by the present invention overcomes the disadvantages that in conventional art, when processing FC service, the K code indicator bit and the ERR code indicator bit must be retained, and the K code and the ERR code are processed separately, which lead to a high bandwidth utilization ratio and a complex processing procedure.

Abstract: Embodiments of a circuit are described. In this circuit, a receive circuit includes M input nodes that receive a set of M symbols on M links during a time interval, where the set of M symbols are associated with a codeword. Moreover, the receive circuit includes a decoder, coupled to the M input nodes, that determines the codeword in a code space based on the set of M symbols and that decodes the codeword to a corresponding set of N decoded symbols. Additionally, the receive circuit may include a detector that detects an imbalance in a number of instances of a first value in the set of M symbols and a number of instances of a second value in the set of M symbols, and, if an imbalance is detected, that asserts an error condition.

Abstract: There are provided a digital signal converter and a method of converting a digital signal. The digital signal converter includes: a signal reception unit analyzing a digital input signal received according to a first form; a signal output unit transmitting a digital output signal according to a second form, different from the first form; and a controller converting the digital input signal received according to the first form into a digital output signal to be transmitted according to the second form, wherein the controller controls a power level of the digital output signal according to power supply methods of the first and second forms. Signal transmission and reception methods according to various interfaces may be provided in a limited form factor by adjusting the standard and coding of a digital signal transmitted and received through different interfaces and as to whether to supply power.

Abstract: A method includes receiving a first plurality of parallel data; generating a first plurality of encoded data, with each of the first plurality of encoded data same as a respective one of the first plurality of parallel data; and transmitting the first plurality of encoded data simultaneously to a plurality of parallel bus lines, with each of the first plurality of encoded data transmitted by a respective one of the plurality of parallel bus lines. The method further includes receiving a second plurality of parallel data; generating a second plurality of encoded data, with each of the second plurality of encoded data inverted from a respective one of the second plurality of parallel data; and transmitting the second plurality of encoded data simultaneously to the plurality of parallel bus lines, with each of the second plurality of encoded data transmitted by a respective one of the plurality of parallel bus lines.

Abstract: An encoder comprises a first and a second input, and a first and a second output, and the encoder comprises a selection block suitable for selecting a more significant bit and a less significant bit. The encoder comprises a switching block suitable for connecting the first input to the first output, and the second input to the second output, the switching block being suitable for being switched in order to connect the first input to the second output and the second input to the first output, when the selection block has selected a less significant bit and a more significant bit. A decoder, a storage medium and an electronic system is also disclosed.

Abstract: A configuration management system that uses a data compression method to compress entries in a data set. An entry is selected as a prefix value and prefix compression of the data set is performed. The entry to serve as the prefix value is quickly selected using an iterative approach. In each iteration, subgroups of entries are formed from groups formed in prior iterations based on the values of characters at successive positions in the entries. The approach is readily implemented using data structures represented as lists.

Abstract: In one embodiment, a data encoder for a component (such as an integrated circuit) may encode data to be transmitted from the component to another component in a system. The encoder may avoid one or more data patterns that, if transmitted by the component, may cause noise to occur at one or more specified frequencies (or frequency bands). The specified frequencies may be frequencies that are in use for wireless communication by the device. By avoiding noise at the specified frequencies, the desense that might otherwise occur may be reduced or eliminated. Quality and speed of the wireless communication may be increased.

Abstract: A method includes receiving a first plurality of parallel data; generating a first plurality of encoded data, with each of the first plurality of encoded data same as a respective one of the first plurality of parallel data; and transmitting the first plurality of encoded data simultaneously to a plurality of parallel bus lines, with each of the first plurality of encoded data transmitted by a respective one of the plurality of parallel bus lines. The method further includes receiving a second plurality of parallel data; generating a second plurality of encoded data, with each of the second plurality of encoded data inverted from a respective one of the second plurality of parallel data; and transmitting the second plurality of encoded data simultaneously to the plurality of parallel bus lines, with each of the second plurality of encoded data transmitted by a respective one of the plurality of parallel bus lines.

Abstract: Provided is an information processing apparatus including a distributor that distributes input data in units of M bits and generates N M-bit bit sequences, an encoder that converts each of the N bit sequences distributed by the distributor into a binary symbol sequence of K symbols and generates N binary symbol sequences, a signal generator that generates N transmission signals Sj synchronized with a specific symbol clock and having, as an amplitude value, each symbol value included in the N binary symbol sequences, a signal delay unit that delays, with regard to j, the transmission signals Sj generated by the signal generator by a (j?1)/N-symbol period and generates delay signals Rj, a signal addition unit that adds the delay signals Rj generated by the signal delay unit and generates an added signal, and a signal transmitter that transmits the added signal generated by the signal addition unit.

Abstract: Disclosed are systems and methods used in motion estimation and particularly for data compression. Embodiments of the invention may store and operate on an n-bit value in less than n bits. In one embodiment, if the multi-bit value is less than a threshold, then the multi-bit value is stored in the reduced-bit storage directly, with no loss of precision. If the multi-bit value is greater than the threshold, then the Most Significant Bits (MSBs) of the multi-bit value are shifted into the reduced-bit storage, and a compression flag set. To decompress, if the compression flag was not set, the bits stored in the reduced-bit storage are merely copied back into the multi-bit value directly. If the compression flag was set, then the bits stored in the reduced-bit storage are shifted (left) by the same amount they were shifted (right) during compression, and an error-minimizing value is added.

Abstract: A method comprising receiving a syntax element to be encoded as a code word of a set of code words, determining a mapping between the syntax element and the code word on the basis of a hierarchy level in a tree structure, using the mapping to obtain the code word, and updating the mapping is disclosed.

Abstract: Methods and apparatus for entropy decoding are disclosed. Compressed input data representing one or more signals is loaded into one or more registers. A first candidate value for a most probable signal case is prepared from the input data. A second candidate value for a least probable signal case is prepared from the input data. A final signal value for the one or more signals is selected from the first and second candidate values and an output bin value is generated based on the final signal value. A processor readable medium having embodied therein processor readable instructions for implementing the method for entropy decoding is also disclosed. In addition, a method of avoiding a branch instruction in an electronic processing algorithm is disclosed.