Abstract: Video coding systems or apparatus utilizing context-based adaptive binary arithmetic coding (CABAC) during encoding and/or decoding, are configured according to the invention with an enhanced binarization of non-zero Delta-QP (dQP). During binarization the value of dQP and the sign are separately encoded using unary coding and then combined into a binary string which also contains the dQP non-zero flag. This invention capitalizes on the statistical symmetry of positive and negative values of dQP and results in saving bits and thus a higher coding efficiency.

Abstract: Systems and methods for utilizing a mnemonic to communicate sensitive data to an agent are disclosed. In aspects, a computer-implemented method comprises: establishing a telephone connection between a caller and an agent; entering an encryption key received from the agent into a mnemonic application of the computer device to permute an algorithm of the mnemonic application; receiving sensitive data in the form of one or more alphabetic, numeric or alpha-numeric sequence; initiating the mnemonic application to generate a mnemonic of the sensitive data using the encryption key, wherein the mnemonic is a sequence of words representing the sensitive data; displaying the mnemonic to the caller; and conveying audio communication of the mnemonic to the agent through the telephone connection to enable remote decoding of the mnemonic back into the at least one sensitive number sequence.

Abstract: The present disclosure relates to methods for feeding back channel state information, user equipment, and base stations. One example method includes receiving a reference signal sent by a base station, selecting a precoding matrix W from a codebook according to the reference signal, where a column vector of the precoding matrix W may be expressed as ?[vej?v]T, v=[1 ej?], and sending a precoding matrix indicator (PMI) to the base station, where the PMI corresponds to the precoding matrix W.

Abstract: Techniques are disclosed for generating a sequence of symbols based on input data for a neuro-linguistic model. The model may be used by a behavior recognition system to analyze the input data. A mapper component of a neuro-linguistic module in the behavior recognition system receives one or more normalized vectors generated from the input data. The mapper component generates one or more clusters based on a statistical distribution of the normalized vectors. The mapper component evaluates statistics and identifies statistically relevant clusters. The mapper component assigns a distinct symbol to each of the identified clusters.

Abstract: Video coding systems or apparatus utilizing context-based adaptive binary arithmetic coding (CABAC) during encoding and/or decoding, are configured according to the invention with an enhanced binarization of non-zero Delta-QP (dQP). During binarization the value of dQP and the sign are separately encoded using unary coding and then combined into a binary string which also contains the dQP non-zero flag. This invention capitalizes on the statistical symmetry of positive and negative values of dQP and results in saving bits and thus a higher coding efficiency.

Abstract: A system described herein may provide a technique for the compression of query terms and search data against which the query terms may be evaluated. The compression may be dynamic, in that a quantity of bits used to compress the search data and query terms may be based on a quantity of unique characters included in a given query term. The compression may further include reducing the volume of search data by compressing entire words, that do not include any of the unique characters of the query term, to one particular code.

Abstract: The generation of symbol-encoded data from digital data, as part of the compression of the digital data into a compressed digital data, can be performed with reference to multiple alternative alphabets. A selection of a specific alphabet is made based on the digital data being compressed, the compression parameters, or combinations thereof. Information indicative of the selected alphabet is encoded into one or more headers of the resulting compressed digital data. A single alphabet can be selected for all of a set of digital data being compressed, or multiple different alphabets can be selected, with different ones of the multiple different alphabets being utilized to compress different portions of the digital data. Additionally, rather than explicitly specifying a specific selected alphabet, the header information can comprise information from which a same alphabet can be independently selected heuristically by both the compressor and the corresponding decompressor.

Abstract: The present disclosure relates to methods for feeding back channel state information, user equipment, and base stations. One example method includes receiving a reference signal sent by a base station, selecting a precoding matrix W from a codebook according to the reference signal, where a column vector of the precoding matrix W is expressed as ?[v ej?v]T, v=[1 ej?], and sending a precoding matrix indicator (PMI) to the base station, where the PMI corresponds to the selected precoding matrix W.

Abstract: A memory device includes a first plurality of program lines of a first group, a second plurality of program lines of a second group, and a plurality of address lines. The second plurality of program lines are disposed next to and are parallel to the first plurality of program lines. The plurality of address lines are coupled to the first plurality of program lines and the second plurality of program lines respectively. The plurality of address lines are twisted and are intersected with the first plurality of program lines and the second plurality of program lines in a layout view. At least two adjacent program lines of the first plurality of program lines or the second plurality of program lines have lengths different from each other. A method is also disclosed herein.

Abstract: A plurality of data blocks stored at a plurality of solid-state storage devices are identified. A portion of data is read from each data block of the plurality of data blocks. A corresponding property is determined for each data block of the plurality of data blocks based on reading the portion of the data. A set of data blocks from the plurality of data blocks is identified, wherein each data block of the set of data blocks is associated with a first corresponding property. The set of data blocks is stored at a data segment.

Abstract: A system and method for random-access manipulation of compacted data files, utilizing a reference codebook, a random-access engine, a data deconstruction engine, and a data deconstruction engine. The system may receive a data query pertaining to a data read or data write request, wherein the data file to be read from or written to is a compacted data file. A random-access engine may facilitate data manipulation processes by accessing a reference codebook associated with the compacted data file, a frequency table used to construct the reference codebook, and data query details. A data read request is supported by random-access search capabilities that may enable the locating and decoding of the bits corresponding to data query details. A random-access engine facilitates data write processes. The random-access engine may encode the data to be written, insert the encoded data into a compacted data file, and update the codebook as needed.

Abstract: An information processing apparatus, includes a computation processing device that includes a memory and a processor coupled to the memory; and a storage device that stores a program, and wherein the processor is configured to: store, in the memory, a first storage area for first data that is assigned to a computation target by data definition for the computation target written in the program and a second storage area for second data that is assigned to the computation target instead of the first data, simplify the program, when the data definition for the computation target is omitted by executing the simplified program, output the second data, and perform the computation by using the output second data.

Abstract: A method and system are provided for streaming a video game from a server to a client. One example system includes the server configured to generate video frames for the video game responsive to input received from the client. An encoder that processes the video frames to generate compressed video frames and storing past encoder states in memory associated with the encoder. The server is configured to transmit the compressed video frames to the client. The server is configured to receive a feedback signal from the client to determine when one or more of the compressed video frames that were sent were not been received by the client. The encoder is configured to generate one or more next video frames as compressed video frames that are dependent on compressed video frames that are known to have been successfully received based on the feedback signal.

Abstract: Technologies are described for storing and reporting user activities within a computing environment. For example, bitsets (e.g., compressed and/or uncompressed bitsets) can be used to store activities (e.g., where each activity is a bit in the bitset in chronological order). Separate bitsets can be maintained for followable aspects of the activities (e.g., a separate bitset for each unique followable). Activity streams can be produced from the compressed bitsets (e.g., custom streams reflecting followables designated by users).

Abstract: A highly programmable device, referred to generally as a data processing unit, having multiple processing units for processing streams of information, such as network packets or storage packets, is described. The data processing unit includes one or more specialized hardware accelerators configured to perform acceleration for various data processing functions. This disclosure describes a programmable hardware-based data compression accelerator that includes a pipeline for performing static dictionary-based and dynamic history-based compression on streams of information, such as network packets. The search block may support single and multi-thread processing, and multiple levels of compression effort. To achieve high-compression, the search block may operate at a high level of effort that supports a single thread and use of both a dynamic history of the input data stream and a static dictionary of common words.

Abstract: A method encoding data values of a data set, including: selecting one of plural complementary sub-ranges of a code values set according to a current input data value, the code values set defined by a range variable; assigning the current input data value to a code value within the selected sub-range; modifying the code values set depending on the assigned code value and size of the selected sub-range; detecting whether the range variable is less than a predetermined minimum size and if so, successively increasing the range variable to increase the code values set size to at least the predetermined minimum size; outputting an encoded data bit in response to each size-increasing operation; after encoding a group of input data values, setting the range variable to a value selected from a predetermined subset of available range variable values, each subset value having at least one least significant bit of zero.

Abstract: Late encoding binding can be applied to data added to a data set according to the encoding history for the data set. When a request to add data is received, an evaluation of the encoding history can determine whether a currently specified encoding for the data can be changed. If changeable, a different encoding scheme for the data may be identified and the data added to the data set according to the different encoding scheme.

Abstract: Techniques are disclosed for generating a sequence of symbols based on input data for a neuro-linguistic model. The model may be used by a behavior recognition system to analyze the input data. A mapper component of a neuro-linguistic module in the behavior recognition system receives one or more normalized vectors generated from the input data. The mapper component generates one or more clusters based on a statistical distribution of the normalized vectors. The mapper component evaluates statistics and identifies statistically relevant clusters. The mapper component assigns a distinct symbol to each of the identified clusters.

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: Video coding systems or apparatus utilizing context-based adaptive binary arithmetic coding (CABAC) during encoding and/or decoding, are configured according to the invention with an enhanced binarization of non-zero Delta-QP (dQP). During binarization the value of dQP and the sign are separately encoded using unary coding and then combined into a binary string which also contains the dQP non-zero flag. This invention capitalizes on the statistical symmetry of positive and negative values of dQP and results in saving bits and thus a higher coding efficiency.

Abstract: Techniques for data processing may include: receiving a data chunk; determining a metric value denoting a degree of compressibility of the data chunk; selecting, in accordance with the metric value denoting the compressibility of the data chunk, a first size of a plurality of sizes, wherein each of the plurality of sizes denotes a different size of an amount of storage used for storing a value of said each size; and performing the data deduplication processing for the data chunk, wherein the data deduplication processing includes using a first hash value for the data chunk to determine whether the data chunk is a duplicate of another data chunk of a hash table, wherein the first hash value is stored in a storage location of the first size.

Abstract: Innovations in range asymmetric number system (“RANS”) coding and decoding are described herein. Some of the innovations relate to hardware implementations of RANS decoding that organize operations in two phases, which can improve the computational efficiency of RANS decoding. Other innovations relate to adapting RANS encoding/decoding for different distributions or patterns of values for symbols. For example, RANS encoding/decoding can adapt by switching a default symbol width (the number of bits per symbol), adjusting symbol width on a fragment-by-fragment basis for different fragments of symbols, switching between different static probability models on a fragment-by-fragment basis for different fragments of symbols, and/or selectively flushing (or retaining) the state of a RANS decoder on a fragment-by-fragment basis for different fragments of symbols. In many cases, such innovations can improve compression efficiency while also providing computationally efficient performance.

Abstract: One example provides, on a scanning mirror display system, a method for communicating timing information for light samples that are scanned to form a displayed image. The method comprises, for a line of light samples, encoding timing information for a first light sample of the line of light samples using a first, greater number of bits to form encoded timing information for the first light sample. The method further comprises encoding timing information for a subsequent light sample of the line of light samples by computing a derivative based upon a timing of the subsequent light sample compared to a prior light sample, encoding the derivative using a second, lesser number of bits to form encoded timing information for the subsequent light sample, and sending the information for the first light sample and the subsequent light sample across the communications channel.

Abstract: Disclosed are an electronic device and a data compression method thereof. According to a data compression method of an electronic device of the present invention, the method comprises the steps of: compressing a page; determining whether data included in the compressed page is stored in a memory; and merging the compressed page with data previously stored in the memory when a result of the determination shows that the data included in the compressed page is the same as the previously stored data. Therefore, the electronic device can prevent a page including the same or similar data from being stored a multiple number of times in a swap area, thereby raising memory securing efficiency.

Abstract: An encoder includes circuitry and memory. The circuitry performs: obtaining first motion vector information of a first partition; obtaining second motion vector information of a second partition; deriving a set of prediction samples for the first partition; and encoding the first partition using the set. When the difference between the motion vector information is not greater than a value, the circuitry reflects a second set of samples to a first set of samples. The first set has been predicted for the first partition using the first motion vector information, and the second set has been predicted for a first range using the second motion vector information. When the difference is greater than the value, the circuitry reflects, to the first set of samples, a third set of samples predicted for a second range larger than the first range using the second motion vector information.

Abstract: A texture decompression method is described. The method comprises receiving a compressed texture block, determining a partition of pixels used for the compressed texture block, wherein the partition includes one or more disjoint subsets into which data in the compressed texture block is to be unpacked, unpacking data for each subset based on the determined partition, and decompressing each of the one or more disjoint subsets to form an approximation of an original texture block.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for compressing and decompressing data. In one aspect, an encoder neural network processes data to generate an output including a representation of the data as an ordered collection of code symbols. The ordered collection of code symbols is entropy encoded using one or more code symbol probability distributions. A compressed representation of the data is determined based on the entropy encoded representation of the collection of code symbols and data indicating the code symbol probability distributions used to entropy encode the collection of code symbols. In another aspect, a compressed representation of the data is decoded to determine the collection of code symbols representing the data. A reconstruction of the data is determined by processing the collection of code symbols by a decoder neural network.

Abstract: A system for managing graph data and methods for making and using same. A loading plan can be generated according to a loading job. Source data can be loaded into the graph model based on the loading plan. The loading job can be defined declaratively. An interpreter can encode the loading job to generate the loading plan having a tree structure. The loading plan can instruct a loading engine to load the source data. The loading engine can be compiled independent of the loading plan. Advantageously, the loading engine can be compiled no more than once. The compiled loading engine can interpret any loading plan. The compiled loading engine can filter or transform the source data at runtime of the loading. Advantageously, time for compiling the loading engine and reading source data can be saved. Graph data loading can have high flexibility and high performance.

Abstract: Embodiments herein describe using compression engines in a processor subsystem to compress only the data fragments stored locally. That is, an application may be allocated a buffer where the physical memory of that buffer is spread across multiple processor subsystems. Rather than asking a single actor (e.g., a single host processor or compression engine) to compress all the fragments of the buffer, a compression library can instead instruct the individual compression engines in each of the processor subsystems to compress only the fragments stored in local memory in the same processor subsystem. Doing so leverages the memory affinity between the compression engines in the local memory which can reduce the overall time required to perform compression.

Abstract: Techniques are disclosed for the improvement of vector quantization (VQ) codebook generation. The improved codebooks may be used for compression in cloud-based video applications. VQ achieves compression by vectorizing input video streams, matching those vectors to codebook vector entries, and replacing them with indexes of the matched codebook vectors along with residual vectors to represent the difference between the input stream vector and the codebook vector. The combination of index and residual is generally smaller than the input stream vector which they collectively encode, thus providing compression. The improved codebook may be generated from training video streams by grouping together similar types of data (e.g., image data, motion data, control data) from the video stream to generate longer vectors having higher dimensions and greater structure. This improves the ability of VQ to remove redundancy and thus increase compression efficiency.

Abstract: Systems and methods can be implemented to conduct searches based on images used as queries in a variety of applications. In various embodiments, a set of visual words representing a query image are generated from features extracted from the query image and are compared with visual words of index images. A set of candidate images is generated from the index images resulting from matching one or more visual words in the comparison. A multi-level ranking is conducted to sort the candidate images of the set of candidate images, and results of the multi-level ranking are returned to a user device that provided the query image. Additional systems and methods are disclosed.

Abstract: A method of converting 10-bit pixel data (e.g. 10:10:10:2 data) into 8-bit pixel data involves converting the 10-bit values to 8-bits using a technique that is selected dependent upon the values of the MSBs of the 10-bit values and setting the value of an HDR flag dependent upon the values of the MSBs. The HDR flag is appended to the 3-bit channel.

Abstract: A storage module is configured to store data segments, such as error-correcting code (ECC) codewords, within an array comprising a plurality of columns. The ECC codewords may comprise ECC codeword symbols. The ECC symbols of a data segment may be arranged in a horizontal arrangement, a vertical arrangement, a hybrid channel arrangement, and/or vertical stripe arrangement within the array. The individual ECC symbols may be stored within respective columns of the array (e.g., may not cross column boundaries). Data of an unavailable ECC symbol may be reconstructed by use of other ECC symbols stored on other columns of the array.

Abstract: A database-management system evaluates a query that retrieves and transforms encoded symbols stored in a database. If the stored symbols assume a relatively small set of distinct values, the system initially performs the transformation on every value in the set. During execution of subsequent queries, rather than performing the transformation upon every stored symbol fetched from the database, the system merely returns the previously derived encoded transformation results that correspond to the decoded value of each fetched symbol. If the symbols stored in the database span a relatively large set of distinct values, the system does not initially perform the transformation upon every value in the set. Instead, the first time the system fetches a symbol that has a particular value, it saves that symbol's encoded transformation result and reuses that result the next time it fetches an encoded symbol with the same value.

Abstract: Systems and methods for stream-based compression include an encoder of a first device that may receive an input stream of bytes including a first byte preceded by one or more second bytes. The encoder may determine to identify a prefix code for the first byte. The encoder may select a prefix code table using the one or more second bytes. The encoder may identify, from the selected prefix code table, the prefix code of the first byte. The encoder may generate an output stream of bytes by replacing the first byte in the input stream with the prefix code of the first byte. The encoder may transmit the output stream from the encoder of the first device to a decoder of a second device. The output stream may have a fewer number of bits than the input stream.

Abstract: A system for video encoding is described herein. The system includes a processor to execute a multi-pass palette search and mapping on a video frame to generate palette candidates. The processor is to execute an intra block copy prediction on the video frame to generate intra-block-copy candidates. The processor is to also calculate a rate distortion optimization (RDO) cost for a set of generated residuals, the palette candidates, and the intra-block-copy candidates. The processor is to further also execute a final mode decision based on a comparison of the rate distortion optimization (RDO) costs.

Abstract: The present disclosure discloses a method and apparatus for operating on a file. A specific embodiment of the method comprises: receiving a request of an operation on a target file, acquiring index information associated with a storage space address of a data page based on a file name and a data page identifier, the index information being stored in an on-chip memory of a processor for executing a machine instruction corresponding to the operation; and finding the data page based on the index information, and performing the operation on the data page. Accordingly, the operation on the file is implemented depending on an index stored in the on-chip memory, so that memory overheads of accessing the index are equivalent to 0, and memory resources are saved, thereby reducing system overheads.

Abstract: A method for detecting faults in substring search operations using a processor unit including vector registers of M vector elements each. A non-limiting example of the method includes providing an M×M matrix of comparators for characterwise comparison of the elements of a reference string and a target string. A first zero detect vector having value indicative of terminating element of the target string and a second zero detect vector having a value indicative of terminating element of the reference string are generated. A resulting bit vector is generated using comparison performed by the M×M matrix. The resulting bit vector indicates characters of the target string that fully match the reference string and indicate characters of the target string that partially match the reference string. Fault detection in the substring search operations is performed by comparing the generated zero detect vectors with operands.

Abstract: Documents are compressed. A partially compressed document is obtained. The partially compressed document includes one or more code words that replace one or more common tokens of a document to be compressed. The one or more common tokens are tokens common to a plurality of documents, and included in a common dictionary. The common dictionary provides a mapping of code words to common tokens. A document associated dictionary is created from non-common tokens of the document to be compressed. The document associated dictionary provides another mapping of other code words to the non-common tokens. A compressed document is created. The creating of the compressed document includes replacing one or more non-common tokens of the partially compressed document with one or more other code words of the document associated dictionary. The compressed document includes the one or more code words of the partially compressed document and the one or more other code words of the document associated dictionary.

Abstract: A data processing system is provided including a processing element and a storage. The storage stores code portions that, when executed by the processing element, cause the data processing system to obtain a plurality of variable length codes. Each variable length code has a first portion of a variable length and a second portion. The variable length codes are separated into first portions of the variable length codes and second portions of the variable length codes. The data processing system forms a processed stream in chunks using a set of control rules so that, for each chunk of the processed stream containing data from the first portions of the variable length codes, the data from the first portions forms a sub-stream within the chunk of the processed stream that has a size that is determined in accordance with the control rules.

Abstract: The present technology relates to a signal processing apparatus, a signal processing method, and a program that make it possible to cope with an output of a PCM signal using one DSD signal. A distribution apparatus includes an extraction section that, in a case where a PCM signal having a predetermined sampling frequency is generated from a DSD signal, extracts a predetermined number of samples from the DSD signal around samples at a predetermined interval determined by the predetermined sampling frequency, and a filtering section that generates the PCM signal having the predetermined sampling frequency by filtering the extracted predetermined number of samples. The present technology is applicable to, for example, a distribution apparatus, etc., that distributes the PCM signal to a client apparatus.

Abstract: Methods, apparatuses, and computer-readable media for compressing data for storage or transmission. Input data is compressed in a first stage utilizing a first compression algorithm and the frequencies of occurrence of symbols and symbol pairs in the output from the first stage is calculated. The output from the first stage is then encoded to a final compressed bit string in a second stage utilizing a second compression algorithm based on the calculated frequencies of occurrence of the symbols and the symbol pairs.

Abstract: The present disclosure includes systems and methods for supporting polar codewords with variable polar codeword lengths. Variable codeword length codewords are communicated using an n-bit encoder/n-bit decoder having n inputs and n corresponding outputs. Each input and each corresponding output is associated with a bit index. A set of bit indices to be shortened are selected. The encoder encodes n input bits to obtain n output bits. Each output bit that is associated with a bit index from the set of bit indices to be shortened is ignored. A codeword is generated from all of the remaining output bits.

Abstract: Systems and methods for utilizing a mnemonic to communicate sensitive data to an agent are disclosed. In aspects, a computer-implemented method comprises: establishing a telephone connection between a caller and an agent; entering an encryption key received from the agent into a mnemonic application of the computer device to permute an algorithm of the mnemonic application; receiving sensitive data in the form of one or more alphabetic, numeric or alpha-numeric sequence; initiating the mnemonic application to generate a mnemonic of the sensitive data using the encryption key, wherein the mnemonic is a sequence of words representing the sensitive data; displaying the mnemonic to the caller; and conveying audio communication of the mnemonic to the agent through the telephone connection to enable remote decoding of the mnemonic back into the at least one sensitive number sequence.

Abstract: A method is provided for rule creation that includes receiving (i) a MDP model with a set of states, a set of actions, and a set of transition probabilities, (ii) a policy that corresponds to rules for a rule engine, and (iii) a set of candidate states that can be added to the set of states. The method includes transforming the MDP model to include a reward function using an inverse reinforcement learning process on the MDP model and on the policy. The method includes finding a state from the candidate states, and generating a refined MDP model with the reward function by updating the transition probabilities related to the state. The method includes obtaining an optimal policy for the refined MDP model with the reward function, based on the reward policy, the state, and the updated probabilities. The method includes updating the rule engine based on the optimal policy.

Abstract: A dynamic dictionary-based data symbol encoder. A dynamic dictionary data structure is populated with evictable dictionary entries. The evictable dictionary entries are encoded with a dictionary index that is shorter than an original representation of the input symbols. A reference count evicts dictionary indices when eligible for eviction. Through building a dynamic symbol dictionary which is much smaller than (global) alphabet size, locally repetitive symbols can be effectively compressed using dictionary. The dictionary is also dynamically built along with the compression/decompression process and therefore does not carry overhead. However, tables/trees might be appended to enable entropy decoding. The method is also readily combined with the popular LZ77 and its variant encoding methods into composite one-pass encoding algorithms to achieve superior performance.

Abstract: The present disclosure is directed to a method of utilizing a lookup table (LUT) where the index to the LUT does not need to be modified or changed in cases where the LUT is larger than a single register or larger than a set of available registers. In another embodiment, a processor instruction is disclosed that can take in one or more indices to a LUT and return the lookup results, without modifying the indices, when the LUT is larger than the available register data element space. In another embodiment, a SIMD processor system is disclosed that can implement a processor instruction to utilize a LUT that is larger than the available register data element space without needing to modify the parameterized index when a different subset of the LUT is swapped into the available registers.

Abstract: Methods and apparatus are described. A method, implemented in a decoder, includes receiving two or more signals from an encoder over two or more respective wires. At least one of the two or more signals includes at least one code that was recoded by the encoder. The decoder receives a recoding table. The recoding table provides a mapping indicating the recoding for each code that was recoded by the encoder in the received two or more signals. The decoder decodes the two or more received signals using the received recoding table.

Abstract: Methods, devices and systems for a compressor and a decompressor for encoding and decoding data in the cache/memory/data transferring subsystem in a computer system or in a communication network are described herein. An example variable-length compressor is able to compress blocks of data values and the compressed blocks may include mixes of compressed and uncompressed values, wherein metadata in the form of a unique special-meaning codeword (UUIC) indicates uncompressed values. An example variable-length decompressor is able to decompress the compressed data blocks. The compressor and decompressor are able to support compression and decompression of common compression scenarios that are used in combination with variable-length compression to improve compressibility in the cache/memory/data transferring subsystem in a computer system or in a communication network.

Abstract: Provided are an electronic device and a page merging method therefor. The electronic device may include: a memory manager that initializes pages and determines a page as a target to be merged if the page is initialized to a preset specific value; and a memory for merging multiple pages determined as a target to be merged and storing the merged page. The electronic device can determine whether to merge pages with a small amount of computation and merge the pages according to the determination result. Hence, the electronic device can manage the memory in an efficient manner.