Abstract: A modem is described having a transceiver assembly, a non-transitory processor readable medium coupled to the transceiver assembly, transceiver electronics coupled to the transceiver and the non-transitory processor readable medium, and a power supply supplying power to the transceiver assembly and the transceiver electronics. The transceiver electronics are configured to calculate a size of an output bit stream based on an encoding scheme to encode for transmission data stored in the non-transitory processor readable medium, decimate the data if the size of the output bit stream exceeds a predetermined size, recalculate the size of the output bit stream, after decimation of the data, based on the encoding scheme to encode for transmission the decimated data, and encode the data using the encoding scheme.

Abstract: A Ternary Content-Addressable Memory (TCAM) system is disclosed. In the system, writes to the memory are performed over several cycles. In order to ensure full visibility of all entries within the TCAM, a cache memory is provided. At the start of the TCAM write, the cache is written with the contents of the new entry. The cache entry is activated for the period of time that the corresponding entry in the TCAM is deactivated for rewriting. For each input value provided to the system, both the TCAM and the cache are checked for potential matches. The results of these checks are compared at output. In this manner, all entries within the TCAM can maintain full visibility even throughout a write period.

Abstract: A technique that reduces the startup time of a processing system authenticates a proxy for an image stored in tracked memory instead of authenticating the image stored in the tracked memory. A controller generates an alteration log authentication code based on an alteration log that is updated prior to programming the image stored in tracked memory. The controller records an alteration log authentication code in secure memory. The alteration log is indirectly related to a most recent image stored in the tracked memory. Authentication of the image of the alteration log is used as a proxy for authentication of the image stored in tracked memory, which is performed only when the tracked memory is modified. Use of the contents of the alteration log as a proxy for the contents of tracked memory accelerates the startup time of the system.

Abstract: Example data compressors disclosed herein include a hash unit to identify a hash table entry matching a hash index determined for a current position of a data stream undergoing data compression, the hash table entry identifying one or more prior positions of the data stream. Disclosed example data compressors also include a match engine to perform data matching based on the current position of the data stream and the one or more prior positions of the data stream to determine a primary match result and a backward match result for the current position of the data stream. Disclosed example data compressors further include a results evaluator to determine an output match result for the current position of the data stream based on the primary match result for the current position of the data stream and a backward match result determined for a subsequent position of the data stream.

Abstract: Embodiments of the present invention provide a method, computer program product and system for increasing sorting efficiency by utilizing a determined crossover point. Initially, a set of data, containing a number of tuples, to be sorted is received. A determination is made as to the number of radix sort iterations to perform based on the number of tuples of the received data. A countdown timer is set based on the determined number of radix sort iterations. Radix sorts iterations are performed recursively. After each iteration, the countdown timer is decreased. Upon the countdown timer reaching zero, one or more comparison sorts is performed on the remainder of the set of data not sorted by the radix sorting.

Abstract: Droop caused by a filter may be compensated by applying a pre-filter to the audio signal that cancels out, at least in part, the droop caused by the filter. The pre-filter may implement magnitude compensation that causes an approximately flat passband response when the pre-filtered signal is passed through the filter. The pre-filter may be applied to one-bit wide data streams, such as high-fidelity direct stream digital (DSD) audio data or other one-bit wide data such as pulse-density modulation (PDM) encoded data. The pre-filtering and filtering may be implemented in components of an audio processor, such as in a digital-to-analog converter (DAC). The pre-filtering may include upsampling the one-bit wide data to form symbols and substituting an eighth bit of the symbol with an inverted version of an earlier-received bit.

Abstract: Disclosed herein are techniques for improving compression ratio for dictionary-based data compression. A method includes receiving a data block to be compressed, selecting an initial compression dictionary from a plurality of initial compression dictionaries based on a characteristic of the data block, loading the initial compression dictionary into an adaptive compression dictionary in a buffer, and compressing the data block using the adaptive compression dictionary. The method also includes updating the adaptive compression dictionary based on data in the data block that has been compressed, while compressing the data block.

Abstract: Methods and apparatuses relating to data decompression are described. In one embodiment, a hardware processor includes a core to execute a thread and offload a decompression thread for an encoded, compressed data stream comprising a literal code, a length code, and a distance code, and a hardware decompression accelerator to execute the decompression thread to selectively provide the encoded, compressed data stream to a first circuit to serially decode the literal code to a literal symbol, serially decode the length code to a length symbol, and serially decode the distance code to a distance symbol, and selectively provide the encoded, compressed data stream to a second circuit to look up the literal symbol for the literal code from a table, look up the length symbol for the length code from the table, and look up the distance symbol for the distance code from the table.

Abstract: Described herein are techniques for providing data compression and decompression within the bounds of hardware constraints. In some embodiments, the disclosure provides that a processing entity may load a portion of a data stream into a memory buffer. In some embodiments, the size of the portion of data loaded into the memory buffer may be determined based on a capacity of the memory buffer. The processing entity may determine whether the portion of data loaded into the memory buffer includes matching data segments. Upon determining that the portion of data does not include matching data segments, the processing entity may generate a sequence that includes uncompressed data and an indication that the sequence contains no matching data segments.

Abstract: Disclosed herein are system, method, and computer program product embodiments for rollover strategies in an n-bit dictionary compressed column store. An embodiment operates by receiving a new value for addition to a compressed column store. It is determined that a maximum storage capacity for tokens in the compressed column store has been reached for the data dictionary. The compressed column store is converted into a composite store including the existing compressed column store and a newly created flat store. The new value is stored in the flat storage portion of the composite store.

Abstract: In one embodiment, an apparatus comprises a memory; and a compression engine comprising circuitry, the compression engine to assign weights to a plurality of first symbols of a data set, a weight representing a frequency of a corresponding first symbol in the data set; perform a partial sort of the first symbols based on the assigned weights; generate at least a portion of a Huffman tree based on the partial sort; and create a plurality of Huffman codes for the plurality of first symbols based on the Huffman tree.

Abstract: Various systems and methods for lossless data compression are described herein. A process for lossless data compression includes hashing an input byte stream to produce a hash key; identifying a set of dictionary entries in a hash table using the hash key, the hash key associated with a word from a compact dictionary; identifying a set of candidate words from the compact dictionary based on the identified set of dictionary entries, the compact dictionary being a subset of a standard dictionary; determining a best match of the set of candidate words with the input byte stream; and encoding the best match of the set of candidate words as a compressed output of the input byte stream, the encoding including an operation to determine an index into the standard dictionary of the best match and using the index in the encoding operation.

Abstract: Parallel processing concepts such as wavefront parallel processing, are realized with a reduced end-to-end delay by giving up the usual slice concept according to which slices are either coded/decoded completely independent from areas of the picture outside of the respective slice, or at least independent from areas outside the respective slice as far as the entropy coding is concerned, namely in favor of slices of different modes, namely ones called dependent slices which allow for interdependencies across slice boundaries, and others which do not, called normal slices, for example. Combined with the aspect or not, WPP processing concept is made more efficiently by using the slices' start syntax portions to locate WPP entry points.

Abstract: A case management system includes a case database storing case records in association with respective internal case identifiers. Operation includes automatically generating memorable case identifiers and providing them to users for use in identifying respective case records, the memorable case identifiers being generated by encoding the internal case identifiers with respective user identifiers as respective sequences of words (e.g., 3-word sequences) of a natural language of the users according to an encoding function. Case records are retrieved from the case database and provided to the users based on memorable case identifiers received from the users, by decoding received memorable case identifiers into respective internal case identifiers and accessing the case database using the respective internal case identifiers from the decoding.

Abstract: A method and an apparatus determine a precoding matrix indicator, user equipment, and a base station. The method includes: determining a precoding matrix indicator PMI, where the PMI corresponds to a precoding matrix W, and the precoding matrix W satisfies a first condition, a second condition, or a third condition; and sending the PMI to a base station. Embodiments of the present invention further provide a corresponding apparatus, and the corresponding user equipment and base station. Technical solutions provided in the embodiments of the present invention can effectively control a beam, especially a beam shape and a beam orientation, in a horizontal direction and a perpendicular direction.

Abstract: Systems and methods to manage a tokenization manifest that can be used for managing a redaction through tokenization of a set of field level tokenization values applied to an arbitrary information object of an arbitrary file (e.g., database cells, XML, and other document elements, areas of graphics images, etc.). The methods and system extend the use of tokenization to the protection of arbitrary fields or information objects of any type or format. This allows the tokenized components of the information object to be located and provided to a Tokenization Service Provider that can recover, for an authorized requestor, the original content protected by the token. The tokenization schema processes the unrestricted content into a corresponding restricted token. The token can include an embedded URL, where the URL is a link to submit a request to the Tokenization Service Provider to view the token as the unrestricted content.

Abstract: Various embodiments are described of a system and method for improved SCL decoder operation. In particular, various embodiments are described which improve the efficiency of the buffer management based on updated path metric statistics. In some embodiments, the SCL decoder may perform selective replacement to limit the extent of LLR updates per row only to the statistics that have changed since the previous update cycle. In some embodiments, the SCL decoder may perform deferred updates, which may involves in-place calculation of both û?=0 and û?=1 bit estimate (LLR) updates based on the row from which the updated row will be derived.

Abstract: The present invention relates to a method for storing image data, and a method for parsing image data, and an apparatus for using the same, which method includes the steps of encoding the image data, and storing an NAL (Network Abstraction Layer) unit containing the encoded image data in the decoder set register in which NAL units may be stored according to the type of NAL unit.

Abstract: A system for equalizing the pixels in an array of pixels that include semiconductor devices that age differently under different ambient and stress conditions. The system extracts at least one pixel parameter from the array; creates a stress pattern for the array, based on the extracted pixel parameter; stresses the pixels in accordance with the stress pattern; extracts the pixel parameter from the stressed pixels; determines whether the pixel parameter extracted from the stressed pixels is within a preselected range and, when the answer is negative, creates a second stress pattern for the array, based on the pixel parameter extracted from the stressed pixels, stresses the pixels in accordance with the second stress pattern, extracts the pixel parameter from the stressed pixels, and determines whether the pixel parameter extracted from the stressed pixels is within the preselected range.

Abstract: Embodiments relate to policy-based, multi-scheme data reduction for a computer memory. An aspect includes receiving a plurality of policy rules by a policy engine of the computer memory, wherein a first policy rule specifies applying a first data reduction scheme to data in the computer memory based on the data matching first characteristics, wherein a second policy rule specifies applying a second data reduction scheme to data in the computer memory based on the data matching second characteristics, wherein the first data reduction scheme is different from the second data reduction scheme. Another aspect includes determining, by the policy engine, that first data in the computer memory matches the first characteristics, and that second data in the computer memory matches the second characteristics. Yet another aspect includes applying the first data reduction scheme to the first data, and applying the second data reduction scheme to the second data.

Abstract: A method and an apparatus determine a precoding matrix indicator, user equipment, and a base station. The method includes: determining a precoding matrix indicator PMI, where the PMI corresponds to a precoding matrix W, and the precoding matrix W satisfies a first condition, a second condition, or a third condition; and sending the PMI to a base station. Embodiments of the present invention further provide a corresponding apparatus, and the corresponding user equipment and base station. Technical solutions provided in the embodiments of the present invention can effectively control a beam, especially a beam shape and a beam orientation, in a horizontal direction and a perpendicular direction.

Abstract: Multiple reads of memory cells of a flash memory device are initiated at different read levels to obtain raw data. For each different read level, multiple decoding operations are initiated to decode the raw data, each decoding operation using a different one of a plurality of sets of decoding information associated with the different read level. Decoding success rates are determined for one or more of the plurality of sets based on the one or more of the plurality of sets being used to successfully decode data and, for each different read level, an order of the plurality of sets is determined based on the determined success rates. A selected set of decoding information is selected for use in decoding raw data obtained from a read performed at a respective read level based on the respective read level and the set order of the plurality of sets for the respective read level.

Abstract: String hashing using a random number generator is disclosed. A method of implementations includes dividing an input stream provided to a hashing module into a plurality of subsets of bits, wherein each subset comprises a same number of bits and wherein each of the subsets of bits comprises an overlapping subset, augmenting a subset of the subsets of bits with a constant, entangling, by a mixer of the hashing module, the subset by an output of a number generator, adding a result of the entangling to an accumulator of the hashing module, repeating the augmenting, the entangling, and the adding on at least a portion of a next sequential subset of the subset of bits, and when all of the subsets of bits have been processed, returning a value in the accumulator as a hash result value.

Abstract: A method and apparatus for encoding and decoding a motion vector of a current block. The method of encoding including: generating information about the motion vector based on a motion vector of a current block and a motion vector predictor of the current block by estimating the motion vector and determining a first motion vector predictor candidate from among a plurality of motion vector predictor candidates as the motion vector predictor based on a result of the estimating; and generating a virtual motion vector by using a second motion vector predictor candidate and the information about the motion vector, generating vector differences between the virtual motion vector and the plurality of motion vector predictor candidates, comparing the vector differences with the information about the motion vector, and selectively excluding the second motion vector predictor candidate according to the comparing.

Abstract: A character recognition device comprising: a storage means storing a plurality of dictionary databases corresponding to each of a plurality of degradation levels, said databases being generated from images wherein an original character image has been degraded using a plurality of different degradation levels; an image input means that receives input of images; an extraction means that extracts character images from said images; a usage order determination means that determines an usage order for dictionary databases on the basis of degradation degrees for extracted character images; and a character recognition means that uses dictionary databases in accordance with said usage order, recognizes characters included in the extracted character image and, if recognition results for the character recognition fulfill prescribed conditions, outputs the recognition results without performing recognition using the dictionary database next in said usage order.

Abstract: A network system that facilitates financial transactions. A software defined network may operate to provide a variety of trading related services to a variety of customers with a low latency. Core or processor affinity for routing processes may improve speeds of routing. Data capture through a shared memory space may allow for a variety of analytics without introducing unacceptable delay.

Abstract: Technologies for efficiently compressing data with run detection include a compute device. The compute device is to produce a hash as a function of a symbol at a present position and a predefined number of symbols after the present position in an input stream, determine whether the symbol at the present position is part of a run, obtain, from a hash table, a chain of pointers to previous positions in the input stream associated with the hash, determine, as a function of whether the symbol is part of a run and to identify a matched string, a number of strings referenced by the chain of pointers to compare to a string associated with the present position in the input stream, and output, in response to an identification of a matched string, a reference to the matched string in a set of compressed output data.

Abstract: A method and system for securing data transmitted between a client device and a server by obtaining input text at an intermediate module, processing the input text to obtain processed text, deciding whether to transform the input text deterministically or non-deterministically, or a combination of deterministically and non-deterministically, and based on that decision, transforming the input text accordingly, using at least one key to obtain processed text, and transmitting the processed text to the server. Other embodiments and features of the invention include searching for processed text, allowing for sorting of processed text records by applying an order-preserving transformation, storing unabridged processed elements in a storage device managed by the intermediate module, providing a function by the intermediate module on the input data in lieu of the server, and processing the processed text so as to determine by the intermediate module a transformation applied by the server on input text.

Abstract: A computing system includes a network interface, a processor, and a decompression circuit. In response to a compression request from the processor the decompression circuit compresses data to produce compressed data and transmits the compressed data through the network interface. In response to a decompression request from the processor for compressed data the decompression circuit retrieves the requested compressed data, speculatively detects codewords in each of a plurality of overlapping bit windows within the compressed data, selects valid codewords from some, but not all of the overlapping bit windows, decodes the selected valid codewords to generate decompressed data, and provides the decompressed data to the processor.

Abstract: A system for data decompression may include a processor coupled to a remote memory having a remote dictionary stored thereon and coupled to a decompression logic having a local memory with a local dictionary. The processor may decompress data during execution by accessing the local dictionary, and if necessary, the remote dictionary.

Abstract: Methods of encoding a near-symbol balanced (NSB) sequence may include selecting, with a controller, a constraint based on an amount of bits, determining, with the controller, a plurality of sections in a codebook based on permutations defined by the selected constraint, and partitioning, with the controller, a section among the plurality of sections into a plurality of partitions until each of the plurality of partitions include a number of entries equal to or less than a predetermined number of entries.

Abstract: A computer-implemented method for generating code for real-time stream processing, where data is streamed in tuples, and where each tuple has a timestamp and a value. One or more processors receive source code. The source code includes: code to be applied in a sequential series to one or more tuples; a definition of a size of a sequence of tuples to be processed as a processing window; and a size of a sequence of earlier tuples that a current tuple depends upon as a dependence window. Processor(s) generate the code for real-time stream processing by: buffering received time sequence tuples in a buffer in accordance with the processing window and the dependence window; and converting the code to be sequentially applied to the one or more tuples into code for buffered tuples with a loop construct.

Abstract: A mechanism to activate an original object (12S) so that statistical objects (14S) generated from the original object can be recognized using statistical object identification is disclosed. An object activation agent (48) with a clock (47) and at least one original object (12S) communicates the original object (12S) and time from the clock (47) to an object activation service (50). The object activation service (50) provides and communicates keying information (61) and expiration criterion (63) for at least one of said original objects (12S) back to the object activation agent (48).

Abstract: A method for determining a mapping between two code spaces is disclosed. The method may include receiving first and second plurality of data words. The least-significant-bits (LSBs) of a first data word of a first subset of the first plurality of data words may be compared to the LSBs of each data word of a second subset of the second plurality of data words. The first data word may then be mapped to a second data word of the second subset. A number of LSBs of the second data word matching LSBs of the first data word may be greater than a respective number of LSBs of each data word of a third subset of the second subset matching the LSBs of the first data word, where the third subset excludes the second data word and a most-significant-bit (MSB) of the second data word may be the same as a MSB of the first data word.

Abstract: Techniques are provided for encoding/decoding binary XML data in a client program before sending/receiving the XML to/from a database server. By encoding the binary XML at the client, the overhead of parsing the XML text is avoided by the database server, thus improving database server scalability. Also, the XML data is sent by the server to the client in the binary form, and the binary format is decoded by the client program to perform the necessary operations.

Abstract: A computer-implemented method for generating code for real-time stream processing, where data is streamed in tuples, and where each tuple has a timestamp and a value. One or more processors receive source code. The source code includes: code to be applied in a sequential series to one or more tuples; a definition of a size of a sequence of tuples to be processed as a processing window; and a size of a sequence of earlier tuples that a current tuple depends upon as a dependence window. Processor(s) generate the code for real-time stream processing by: buffering received time sequence tuples in a buffer in accordance with the processing window and the dependence window; and converting the code to be sequentially applied to the one or more tuples into code for buffered tuples with a loop construct.

Abstract: In general, this disclosure describes techniques of enabling devices to download only current portions of email messages without downloading historical portions of the email messages. For instance, when an email client generates a reply email message to an original email message, the reply email message includes a current portion and a historical portion. The current portion of the reply email message includes new information and the historical portion of the reply email message includes the original email message. The techniques of this disclosure enable devices to download the current portions of email messages without downloading the historical portions of the email messages.

Abstract: The present disclosure provides computer implemented methods and systems for analyzing datasets, such as large data sets output from nucleic acid sequencing technologies. In particular, the present disclosure provides for data analysis comprising computing the BWT of a collection of strings in an incremental, character by character, manner. The present disclosure also provides compression boosting strategies resulting in a BWT of a reordered collection of data that is more compressible by second stage compression methods compared to non-reordered computational analysis.

Abstract: Technologies for data decompression include a computing device that reads a symbol tag byte from an input stream. The computing device determines whether the symbol can be decoded using a fast-path routine, and if not, executes a slow-path routine to decompress the symbol. The slow-path routine may include data-dependent branch instructions that may be unpredictable using branch prediction hardware. For the fast-path routine, the computing device determines a next symbol increment value, a literal increment value, a data length, and an offset based on the tag byte, without executing an unpredictable branch instruction. The computing device sets a source pointer to either literal data or reference data as a function of the tag byte, without executing an unpredictable branch instruction. The computing device may set the source pointer using a conditional move instruction. The computing device copies the data and processes remaining symbols. Other embodiments are described and claimed.

Abstract: A system and method of updating automatic speech recognition parameters on a mobile device are disclosed. The method comprises storing user account-specific adaptation data associated with ASR on a computing device associated with a wireless network, generating new ASR adaptation parameters based on transmitted information from the mobile device when a communication channel between the computing device and the mobile device becomes available and transmitting the new ASR adaptation data to the mobile device when a communication channel between the computing device and the mobile device becomes available. The new ASR adaptation data on the mobile device more accurately recognizes user utterances.

Abstract: A method for providing a web service may include generating an XML-based schema based on a service description of said web service, which generated XML-based schema defines XML-based messages to be interpreted by the respective web service, generating a binary XML processor code for encoding and decoding said XML-based messages based on the generated XML based schema, transforming said service description of said web service into a procedure skeleton code comprising one or more skeleton procedures each becoming an application procedure by implementing an application logic for the respective skeleton procedure, and generating a dispatcher code based on the service description, said dispatcher code configured to interpret a byte stream produced by said binary XML processor code to invoke one of the implemented application procedures. This provides an innovative approach to generate source code for developing XML-based web services for small embedded devices with constraint resources.

Abstract: A data compression/decompression methodology and system stores in a compression-side dictionary the data that has been transmitted and additionally applies to such data in the compression-side dictionary a status of being “invalid” for purposes of use as a reference in data compression until an acknowledgement signal has been received from the decompression side indicating that such data has been received. Once the compression side has received the acknowledgement signal indicating that the data in the form of a compressed data packet has been received on the decompression side, the status is changed from being “invalid” into being “valid”, i.e., into being usable as reference data for use in compressing further data elements in the data stream. Each data packet includes a stream index which is representative of the memory location in the compression-side dictionary where the first data element of the uncompressed data set of the data packet is stored.

Abstract: Provided are a method and an apparatus for transmitting uplink control information (UCI), which is carried out by a terminal in a wireless communication system. If the number of information bits of the UCI falls inside a specific range when different types of UCI are transmitted through the same PUCCH format, a bit sequence of each of the UCI are channel-coded by aligning/interleaving, wherein the aligning/interleaving is carried out so that the UCI having high importance are channel-coded so as to have better decoding performance.

Abstract: The disclosure is related to encoding a message or portions of the message to be exchanged between a pair of users. Messages can be exchanged between a pair of users in multiple ways, e.g., electronic mail, short messaging service (SMS), messenger applications. The computing resource, e.g., network bandwidth consumed in transmission of the messages, can be minimized by encoding/compressing at least portions of a message prior to transmission. A server analyzes messages exchanged between a pair of users to identify message portions, e.g., a word or a phrase, that are commonly exchanged and generates a set of codes for those message portions. The pair of users can use the set of codes for encoding and/or decoding the messages exchanged between them. The codes are generated using a specified coding technique, e.g., Huffman coding.

Abstract: Systems and methods are disclosed for conserving power consumption in a memory system. One such system comprises a system on chip (SoC) and an encoder. The SoC comprises one or more memory clients for accessing a dynamic random access memory (DRAM) memory system coupled to the SoC. The encoder resides on the SoC and is configured to reduce a data activity factor of memory data received from the memory clients by encoding the received memory data according to a compression scheme and providing the encoded memory data to the DRAM memory system. The DRAM memory system is configured to decode the encoded memory data according to the compression scheme into the received memory data.

Abstract: Embodiments of the invention provide a method and system for comparing a given number and a target number. The method comprises: generating a current index associated with the given number based on a current digit pair including a first current digit from the given number and a second current digit from the target number, and a current state information associated with the given number; looking up the generated current index in a preset state transition table to identify a next state information, wherein the preset state transition table maintains a plurality of mappings, each mapping is between an index and a next state information; if the current digit pair includes a last digit of any of the two numbers, determining a final comparison result based on the next state information; otherwise, taking on the next state information as the current state information for comparison of a next digit pair.

Abstract: There is provided a graphics processing system that allows decompression of a compressed texture with high efficiency. The graphics processing system includes: a main memory; and a graphics processing unit, in which the graphics processing unit includes a run length decoding section adapted to run-length-decode a compressed texture, and a reciprocal spatial frequency conversion section adapted to restore the texture by performing reciprocal spatial frequency conversion on the run-length-decoded texture, and the main memory includes a texture pool adapted to partially cache the restored texture.

Abstract: A data compression method using the range variant of asymmetric numeral systems to encode a data stream, where the probability distribution table is constructed using a Markov model. This type of encoding results in output that has higher compression ratios when compared to other compression algorithms and it performs particularly well with information that represents gene sequences or information related to gene sequences.

Abstract: An encoder includes a plurality of registers and is configured to: sequentially receive an array of coefficients, each of the coefficients being decomposed into a plurality of bits located at a plurality of corresponding bit positions of the coefficient; and concurrently operate on the plurality of bits of each of the coefficients.

Abstract: A geographic database may include binary data including list portions and/or non-list portions. A computing device may identify a list in a first binary large object (BLOB) for navigation data including road segments and road attributes. The first BLOB is segmented based on the byte list portion into a plurality of elements each having a predetermined size. The computing device may define a series of operations for the multiple elements to transform the first BLOB to a second BLOB.