Abstract: Systems and methods are disclosed for improving data channel design by applying transform domain analytics to more reliably extract user data from a signal. In certain embodiments, an apparatus may comprise a channel circuit configured to receive an analog signal at an input of the channel circuit, and sample the analog signal to obtain a set of signal samples. The channel circuit may further apply a filter configured to perform transform domain analysis to the set of signal samples to generate a first subset of samples, the first subset including fewer transitions and having a higher signal to noise ratio (SNR) than the set of signal samples. The channel circuit may detect first bit transform domain representation values from the first subset, and determine channel bit values encoded in the analog signal based on the set of signal samples and using the first bit transform domain representation values detected from the first subset as side information.

Abstract: A data compressor includes a zero-value remover, a zero bit mask generator and a non-zero values packer. The zero-value remover receives 2N bit streams of values and outputs 2N non-zero-value bit streams having zero values removed from each respective bit stream based on a selected granularity of compression for values contained in the bit streams. The zero bit mask generator receives the 2N bit streams of values and generates a zero bit mask corresponding to the selected granularity of compression. Each zero bit mask indicates a location of a zero value based on the selected granularity of compression. The non-zero values packer receives the 2N non-zero-value bit streams and forms at least one first group of packed non-zero values.

Abstract: A memory device includes a data path having a data bus. The memory device further includes a first one-hot communications interface communicatively coupled to the data bus, and a second one-hot communications interface communicatively coupled to the data bus. The memory device additionally includes at least one memory bank, and an input/output (I/O) interface communicatively coupled to the at least one memory bank via the first one-hot communications interface and the second one-hot communications interface, wherein the first one-hot communications interface is configured to convert a first data pattern received by the I/O interface into one-hot signals transmitted via the data bus to the second one-hot communications interface, and wherein the second one-hot communications interface is configured to convert the one-hot signals into the first data pattern to be stored in the at least one memory bank.

Abstract: Embodiments include applying neural network technologies to encoding/decoding technologies by training and encoder model and a decoder model using a neural network. Neural network training is used to tune a neural network parameter for the encoder model and a neural network parameter for the decoder model that approximates an objective function. The common objective function may specify a minimized reconstruction error to be achieved by the encoder model and the decoder model when reconstructing (encoding then decoding) training data. The common objective function also specifies for the encoder and decoder models, a variable f representing static aspects of the training data and a set of variables z1:T representing dynamic aspects of the training data. During runtime, the trained encoder and decoder models are implemented by encoder and decoder machines to encode and decoder runtime sequences having a higher compression rate and a lower reconstruction error than in prior approaches.

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 examples of retrieving values represented by one or more previous symbols needed for decoding a current symbol before or in parallel with the insertion of the values represented by the one or more previous symbols in the data stream.

Abstract: The method involves sequentially encoding the plurality of data packets, which involves, for a data packet, obtaining a reference data packet, obtaining a mask packet indicative of which of the bits in the data packet are predictable and which of the bits in the data packet are not predictable obtaining change history data indicative of previously changed bits of the mask packet, determining an updated mask packet based on the mask packet, the data packet, and the reference data packet, determining updated change history data based on the change history data, the mask packet, and the updated mask packet, determining, as unpredictable bits, all those bits of the data packet that are indicated as not predictable by the updated mask packet, and generating an encoded data packet including a representation of the updated change history data and a representation of values of the unpredictable bits of the data packet.

Abstract: Stream-based data deduplication is provided in a multi-tenant shared infrastructure but without requiring “paired” endpoints having synchronized data dictionaries. Data objects processed by the dedupe functionality are treated as objects that can be fetched as needed. As such, a decoding peer does not need to maintain a symmetric library for the origin. Rather, if the peer does not have the chunks in cache that it needs, it follows a conventional content delivery network procedure to retrieve them. In this way, if dictionaries between pairs of sending and receiving peers are out-of-sync, relevant sections are then re-synchronized on-demand. The approach does not require that libraries maintained at a particular pair of sender and receiving peers are the same. Rather, the technique enables a peer, in effect, to “backfill” its dictionary on-the-fly. On-the-wire compression techniques are provided to reduce the amount of data transmitted between the peers.

Abstract: An arithmetic logic unit, comprising an addition unit for determining a sum of a first input and a second input; and a logarithmic addition unit for determining an output using the sum and a third input. The output is a multiply-accumulate output represented in a logarithmic domain when the first, second and third inputs are represented in the logarithmic domain.

Abstract: Methods and systems for optimizing a routing of audio data to audio transmitting devices using a Bluetooth network are disclosed. One method includes receiving an encoded audio bitstream at a first speaker of the audio rendering system comprising a first and a second audio channels, separating a first set of spectral components of the first audio channel and a second set of spectral components of the second audio channel from the encoded audio bitstream, without decoding the audio bitstream, generating a first encoded bitstream from the first set of spectral components, and forwarding the first encoded bitstream to a second speaker of the audio rendering system over the wireless link.

Abstract: Technologies directed to digital active interference cancellation (d-AIC) for full duplex transmit-receive (TX-RX) concurrency. An integrated circuit can include first and second analog front-ends (AFE) and digital front-end (DFE) circuits and a digital AIC circuit that generates a scaled and delayed replica of a first quadrature (IQ) sample corresponding to first data transmitted by the first AFE circuit which is being coupled into the receiver as aggressor. The digital AIC circuit receives a second IQ sample from the second AFE circuit, the second IQ sample corresponding to second data being received by the second AFE circuit. The digital AIC circuit subtracts the scaled and delayed replica of the first IQ sample from the second IQ sample to obtain a third IQ sample and sends the third IQ sample to the second DFE circuit. Third IQ sample is the desired signal when d-AIC cancels the self-interference.

Abstract: A network controller can register WAN edge routers and WAN optimizers distributed across a WAN. The controller can receive a request to establish a WAN optimized connection between first and second hosts. The controller can identify a first WAN optimizer to perform first services (e.g., de-duplication, compression, application acceleration, caching, etc.) for first traffic from the first host to the second host and first complementary services for second traffic from the second host to the first host, and a second WAN optimizer for the second traffic and second complementary services for the first traffic. The controller can establish the optimized connection comprising a first path including the first host, WAN optimizer, and router; a second path including the first router and a second router, and a third path including the second router, WAN optimizer, and host. The controller can route the first and second traffic through the optimized connection.

Abstract: A card is provided with a light sensor operable to receive information via light emitted from a display screen or another source of light. Accordingly, a mobile telephonic device or portable computer (e.g., tablet computer) may communicate information to a card via light pulses. Information communicated via light may include, for example, points balances, credit balances, debit balances, transaction history, software updates, coupons, promotions, advertisements or any other type of information.

Abstract: The system may capture an image comprising an original image size. The system may further determine an optimal size for the image based on a connection bandwidth and/or connection latency. The system may also compress the image to reduce an image size locally until the image size is less than or equal to the optimal size, before transmitting the image with the optimal size to the receiver while controlling latency in image transmission.

Abstract: An apparatus and method for performing efficient lossless compression.

Abstract: A method for content transformation using a transformation node cluster. The transformation node cluster may comprise a plurality of nodes including a plurality of transformation nodes configured to execute one or more content transformation types. A request may be received from a client machine for a content item stored in a repository associated with a server machine that is associated with the transformation node cluster. A current content format of the content item and a target content format of the content item may be identified. The target content format may differ from the current content format. A chain of transformations may be determined as including a first transformation type for transforming the content item from the current content format to an intermediate content format.

Abstract: The present invention provides channel interleaving method of a polar (Polar) code. The method includes: determining an M_r-row and M_c-column matrix used for interleaving, and permutating, based on permutation patterns of the column sequence numbers and/or permutation patterns of the row sequence numbers, the matrix into which the to-be-interleaved bits are written. The permutation patterns of the column sequence numbers are represented by: [Pc(0), Pc(1), . . . , Pc(ic), . . . , Pc(M_c?1)]. Pc(ic) is obtained by performing pruned bit reverse (PBR, pruned bit reverse)-based mapping on the column sequence number ic. The permutation patterns of the row sequence numbers are represented by: [Pr(0), Pr(1), . . . , Pr(ir), . . . , Pr(M_r?1)]. Pr(ir) is obtained by performing pruned bit reverse (PBR, pruned bit reverse)-based mapping on the row sequence number ir; and reading interleaved bits from the permutated matrix.

Abstract: A data processing method and device, where the method includes obtaining a usage frequency value of software, compressing a target file of the software to obtain a compressed file when the usage frequency value is less than a preset usage frequency value, receiving a startup instruction for starting the software, querying the compressed file of the software, and decompressing the compressed file using a high-priority process to obtain the target file, where the high-priority process is performed as an essential highest-priority process relative to another process, and starting the software based on the target file.

Abstract: Coding efficiency is improved. A motion compensation filter unit acts on a motion vector applied image obtained by acting a motion vector on a reference image. The motion compensation filter unit causes filter coefficients mcFilter[i][k] designated by a phase i and a filter coefficient position k to act on the motion vector applied image. The filter coefficients mcFilter[i][k] includes filter coefficients calculated by using filter coefficients mcFilter[p][k] (p?i) and filter coefficients mcFilter[q][k] (q?i).

Abstract: A data compression system includes an encoder for receiving a binary string of data which is partitioned into one or more binary segments and assigned Variable Length Codewords (VLCs) to be stored to a file or transmitted over a medium, such as a wired network or a wireless network. The system can also include a decoder for receiving the VLCs from a file or network and reproducing a binary string of data substantially identical to that which was input to the encoder. The system can also include a processor, a memory and/or a coder/decoder (CODEC) for compressing/decompressing a raw or compressed data stream received from a file or network.

Abstract: A decoder including a main memory, a flag memory and a decoding logic is provided. The flag memory is configured to store flag data and the decoding logic configured to perform an iteration. Further, the decoding logic is configured to: perform an ith operation using first data, wherein i is a natural number, flag-encode second data that is results obtained by performing the ith operation on the first data, store results obtained by performing the flag encoding on the second data in the flag memory as first flag data if the flag encoding succeeds, and store predetermined second flag data that is different from the first flag data of the second data in the flag memory if the flag encoding fails.

Abstract: A scalable hierarchical coreference method that employs a homomorphic compression scheme that supports addition and partial subtraction to more efficiently represent the data and the evolving intermediate results of probabilistic inference. The method may encode the features underlying conditional random field models of coreference resolution so that cosine similarities can be efficiently computed. The method may be applied to compressing features and intermediate inference results for conditional random fields. The method may allow compressed representations to be added and subtracted in a way that preserves the cosine similarities.

Abstract: The present discloaure relates to a transmission apparatus, a transmission method, a reception apparatus, and a reception method which make it possible to control redundancy of a header in packet communication. A region representing a packet length in a header of a packet is set according to a size of a payload of an input packet. A header of a baseband packet includes a minimum fixed length header including type identification information for identification of a type of the input packet or the stream and information of a packet length of the input packet or the stream stored in a payload of the baseband flame packet.

Abstract: The present application discloses a detection method and a detection device for the audio signal, the detection method comprising one or multiple times of audio detection, the audio signal is a SPDIF signal, and each time of the audio detection comprises: a statistical sampling step, sampling the SPDIF signal based on Biphase Mark Code, and counting according to the sampled data to obtain the number of state changes or the number of state unchanges of the SPDIF signal; and a determination step, determining whether the SPDIF signal is a muted SPDIF signal according to whether the number of state changes or the number of state unchanges of the SPDIF signal is within a predetermined range. The purpose of this application is at least to achieve the music detection function of the audio signal without performing full signal decoding on the SPDIF signal.

Abstract: A method of encoding an image into a coded image, the method comprising: writing a quantization offset parameter into the coded image, determining a prediction mode type for coding a block of image samples of the image into a coding unit of the coded image, determining a quantization parameter for the block of image samples, and determining if the prediction mode type is of a predetermined type, wherein if the prediction mode type is of the predetermined type, the method further comprises: modifying the determined quantization parameter using the quantization offset parameter, and performing a quantization process for the block of image samples using the modified quantization parameter, and wherein if the prediction mode type is not of the predetermined type, the method further comprises: performing a quantization process for the block of image samples using the determined quantization parameter.

Abstract: A two-stage technique for compressing radar data is disclosed in which, in the first stage, Constant False Alarm Rate (CFAR) compression is conducted using a median calculated from at least one dimension of radar data, which is then used to determine filtering threshold values for all dimensions of the radar data. The radar data is then compressed by filtering the radar data based on the filtering threshold values. In the second stage, peak detection is then performed on the compressed data to identify detected objects (targets). These and other embodiments are described herein.

Abstract: Generating encoded image data using adjustable per-symbol entropy coding probability updating may include generating a portion of the encoded image data in accordance with a value of a probability update indicator for the portion indicating whether per-symbol entropy coding probability updating is disabled for the portion, and including the value of the probability update indicator and the entropy coded image data in an output bitstream. Generating decoded image data using adjustable per-symbol entropy coding probability updating may include obtaining a value of a probability update indicator for a portion of the decoded image data, the value of the probability update indicator for the portion indicating whether per-symbol entropy coding probability updating is disabled for the portion, and generating decoded image data for the portion in accordance with the value of the probability update indicator for the portion.

Abstract: One example method includes receiving a mixed data stream that was created using a first data stream and a second data stream, the mixed data stream having a compressibility of N, where N is a compressibility merging parameter, and the mixed data stream has a compressibility that is between a compressibility of the first data stream and a compressibility of the second data stream, providing the mixed data stream to an application and/or hardware, observing and recording a response of the application and/or hardware to the mixed data stream, and analyzing the response of the response of the application and/or hardware to the mixed data stream.

Abstract: A system includes a memory and a node. The memory stores first and second linear string correlithm objects. The node receives first and second real-world numerical values, and identifies a first sub-string correlithm object from the first linear string correlithm object that corresponds to the first real-world numerical value. The node aligns the first and second linear string correlithm objects such that the first sub-string correlithm object aligns with a sub-string correlithm object from the second linear string correlithm object that corresponds to zero. The node identifies a second sub-string correlithm object from the second linear string correlithm object that corresponds to the second real-world numerical value, and determines which sub-string correlithm object from the first linear string correlithm object aligns with the second sub-string correlithm. The node outputs the determined sub-string correlithm object from the first linear string correlithm object.

Abstract: A system includes a memory and a node. The memory stores first and second linear string correlithm objects. The node receives first and second real-world numerical values, and identifies a first sub-string correlithm object from the first linear string correlithm object representing the first real-world numerical value and a second sub-string correlithm object from the second linear string correlithm object representing the second real-world numerical value. The node aligns the first and second linear string correlithm objects such that the first sub-string correlithm object aligns with a sub-string correlithm object. The node identifies a sub-string correlithm object from the second linear string correlithm object that represents zero and determines which sub-string correlithm object from the first linear string correlithm object aligns with the identified sub-string correlithm object from the second linear string correlithm object.

Abstract: A device configured to link correlithm objects in a correlithm object processing system, includes a link node and a memory. The link node receives a first string correlithm object comprising a first plurality of sub-string correlithm objects and a second string correlithm object comprising a second plurality of sub-string correlithm objects. Each of the second plurality of sub-string correlithm objects are unrelated to each of the first plurality of sub-string correlithm objects in n-dimensional space. The memory is communicatively coupled to the link node and stores a node table that associates at least one of the first plurality of sub-string correlithm objects with at least one of the second plurality of sub-string correlithm objects.

Abstract: A device configured to emulate a node in a correlithm object processing system includes a memory and a node. The memory stores a node table that links source correlithm objects to target correlithm objects. The node receives an input correlithm object and determines n-dimensional distances between it and the source correlithm objects, and determines that it is not within an n-dimensional distance threshold from any of the source correlithm objects in the node table. The node adds the input correlithm object to the node table as a new source correlithm object in response to determining that it is not within the n-dimensional distance threshold from any of the source correlithm objects in the node table. The node then links a new target correlithm object to the new source correlithm object in the node table.

Abstract: A device configured to associate data to a multiple string correlithm object in a correlithm object processing system includes a bidirectional string correlithm object generator, a node, and a memory. The bidirectional string correlithm object generator outputs multiple bidirectional string correlithm objects that intersect at a central sub-string correlithm object. The node receives data elements, including a common data element. The memory stores a node table that associates the central sub-string correlithm object with the common data element. The node table associates sub-string correlithm objects of a first bidirectional string correlithm object with a first plurality of data elements, and associates sub-string correlithm objects of a second bidirectional string correlithm object with a second plurality of data elements.

Abstract: Examples include selection of a remote object storage system for a deduplication data item. Some examples may include determination of an expected usage frequency for the deduplication data item, selection of a remote object cloud storage system based on the expected usage frequency for the data item, and provision of the deduplication data item to the selected remote object storage system for storage as an object in the selected remote object storage system.

Abstract: A method and apparatus are disclosed from the perspective of a UE. In one embodiment, the method includes the UE receiving a configuration which indicates functionalities of each symbol within a set of symbols. The method also includes the UE determining a slot structure for a slot according to a group common PDCCH associated with the slot and the configuration.

Abstract: Host data can be received at a memory sub-system. A determination can be made that the host data exceeds a threshold size associated with an encryption operation. The host data can be separated into segments based on the threshold size associated with the encryption operation. Each of the segments can be encrypted based on the encryption operation. Furthermore, the encrypted segments can be stored at the memory sub-system.

Abstract: Image coding and decoding technologies are described. For example, a sample adaptive offset (SAO) type parameter is decoded from a bitstream, and an SAO type for an SAO value to be added to a pixel value of a reconstructed image is determined from the SAO type parameter. A plurality of bins with variable length coding is decoded from the bitstream using bypass arithmetic coding with a fixed probability. The plurality of bins represents an integer indicating a magnitude of the SAO value. The integer indicating the magnitude of the SAO value is determined based on the plurality of bins decoded using bypass arithmetic coding with a fixed probability. The SAO value is determined using the determined integer.

Abstract: An image processing apparatus includes a visible code area searching unit and a color replacement processing unit. The visible code area searching unit searches for a visible code area in a color document image corresponding to a document, and the visible code area includes a visible code. The color replacement processing unit (a) generates as a local color histogram a color histogram of the visible code area in a predetermined color space and determines whether removal of a stain image should be performed or not on the basis of a ratio of a pixel classified into a bin that includes a color of the stain image in the local color histogram, and (b) replaces the color of the stain image in the visible code area with a background color of the document if it is determined that the removal of the stain image should be performed.

Abstract: A device which can be implemented on a single packaged integrated circuit or a multichip includes a plurality of non-volatile memory cells, and logic to use a physical unclonable function to produce an initial key and to store the initial key in a set of non-volatile memory cells in the plurality of non-volatile memory cells. The device can include logic to use a random number generator to generate a random number, and logic to combine the initial key and the random number to produce an enhanced key. The physical unclonable function can use entropy derived from non-volatile memory cells in the plurality of non-volatile memory cells to produce the initial key. Logic is described to disable changes to data in the set of non-volatile memory cells, and thereby freeze the key after it is stored in the set.

Abstract: Allocation of physical storage capacity within a storage array may be managed in standard size allocation units, e.g. 128 kb tracks, and smaller sub-allocation units, e.g. 32 kb quarter tracks. Data associated with sub-allocation units that match a known pattern may be represented by a hint rather than data in storage. The hint may be used to mitigate overhead associated with accessing backend storage. The hint may also mitigate the need for performing compression/decompression of the corresponding sub-allocation unit if the data is compressed. In response to a read or write request associated with an allocation unit organized into sub-allocation units, only those sub-allocation units that are required to service the read or write request and fail to match a pattern are accessed, decompressed or compressed.

Abstract: A transcoding service is described that is capable of transcoding or otherwise processing content, such as video, audio or multimedia content, by utilizing one or more pipelines. A pipeline can enable a user to submit transcoding jobs (or other processing jobs) into an available pipeline, where a transcoding service (or other such service) assigns one or more computing resources to process the jobs received to each pipeline. The transcoding service and the pipelines can be provided by at least one service provider (e.g., a cloud computing provider) or other such entity to a plurality of customers. A service provider can also provide the computing resources (e.g., servers, virtual machines, etc.) used to process the transcoding jobs from the pipelines.

Abstract: A control device for controlling switching elements in a power conversion circuit includes a pattern generation unit for generating a frequency change pattern, and a controller. Using n first frequencies fc and a second frequency fdef smaller than the smallest one of differences between the n first frequencies fc, the pattern generation unit determines a shift order of the 2n switching frequencies f determined by adding/subtracting the second frequency fdef to/from the first frequencies fc, such that the middle value between two switching frequencies f before and after shifting does not overlap the value of each switching frequency f, thereby generating a frequency change pattern. The controller generates a control signal G for each switching element by using the 2n switching frequencies f for respective different duration times in accordance with the frequency change pattern.

Abstract: Various embodiments relate generally to data science and data analysis, computer software and systems, and wired and wireless network communications to interface among repositories of disparate datasets and computing machine-based entities configured to access datasets, and, more specifically, to a computing and data storage platform to identify and match equivalent subsets of data between an ingested dataset, such as in a tabular data arrangement, and one or more graph-based data arrangements, according to at least some examples. For example, a method may include identifying a tabular data arrangement including a subset of data as a column, computing a compressed data representation for a column of data, correlating a compressed data representation to a reference compressed data representations, detecting a link between a column of data associated with a correlated compressed data representation to a dataset stored in a graph data arrangement, and forming an expanded tabular data arrangement.

Abstract: Provided are a method and a device for decoding a Picture Order Count (POC), and a method and a device for coding a POC, and electronic equipment. The method for decoding the POC includes that: parameters for Most Significant Bit (MSB) and Least Significant Bit (LSB) used in an alignment operation on the POC are acquired; an MSB value and an LSB value of a POC value of a current picture are determined according to the parameters for MSB and LSB; and the POC value of the current picture is calculated according to the MSB value and the LSB value. By means of the technical solution, the problems in the related art that the accuracy in decoding and outputting a multilayer video bitstream cannot be ensured and an extra overhead of network resources is increased in multilayer video coding and decoding processes are solved.

Abstract: A method and system is provided for encoding video data according to target decoding device complexity. One embodiment is evidenced by a method of encoding video data for decoding on a target decoding device having parallel processing, comprising: receiving uncoded video data, computing a relationship between each of a plurality of encoding parameters and target decoding device decoding costs, selecting encoding parameters to minimize encoding costs, wherein the encoding costs include the target decoding device decoding costs, and encoding the uncoded video data according to the selected encoding parameters.

Abstract: A technique for selecting context models (CMs) for a CM ensemble (CME) in a context mixing compressor includes measuring compression ratios (CRs) of the compressor on a dataset for each CM included in a base set of CMs. A first CM that has a maximum CR for the dataset is added to the CME. In response to a desired number of the CMs not being in the CME, subsequent CRs for the compressor are measured on the dataset for each of the CMs in the base set of CMs that are not in the CME in conjunction with one or more CMs in the CME. In response to a desired number of the CMs not being in the CME, subsequent CMs that in conjunction with the one or more CMs in the CME result in a maximum subsequent CR for the dataset are added to the CME.

Abstract: Systems and methods are provided for decoding a codeword having a first codeword length using a decoding system. The systems and methods include receiving a vector corresponding to the codeword at the decoding system, wherein the decoding system comprises a first decoder and a second decoder, the first decoder is available to concurrently process codewords up to the first codeword length, and the second decoder is available to concurrently process codewords up to a second codeword length. The systems and methods further include determining that the received vector is to be decoded using the second decoder, partitioning the received vector of the first codeword length into a plurality of segments having a size no larger than the second codeword length, and decoding the plurality of segments using the second decoder.

Abstract: An information processing method includes obtaining text information and a sentence set; encoding a sentence in the sentence set using a first encoder to obtain a first encoded vector, and encoding the sentence using a second encoder to obtain a second encoded vector. The first encoded vector is determined according to the sentence, and the second encoded vector is determined according to a feature of the sentence. The method also includes determining a sentence encoded vector according to the first and second encoded vectors; encoding the sentence encoded vector using a third encoder to obtain global information; decoding the global information using a decoder; and determining a probability value corresponding to the sentence. Accordingly, when a deep learning method is used, a manually extracted sentence is further added to perform feature training, to effectively improve a learning capability of a model, thereby improving an information processing capability and effect.

Abstract: Aspects of dynamic data compression selection are presented. In an example method, as uncompressed data chunks of a data stream are compressed, at least one performance factor affecting selection of one of multiple compression algorithms for the uncompressed data chunks of the data stream may be determined. Each of the multiple compression algorithms may facilitate a different expected compression ratio. One of the multiple compression algorithms may be selected separately for each uncompressed data chunk of the data stream based on the at least one performance factor. Each uncompressed data chunk may be compressed using the selected one of the multiple compression algorithms for the uncompressed data chunk.

Abstract: The embodiments herein provide a mobile device comprising a display, and a processor configured to receiving a texture to be rendered on the display, checking at least one rendering parameter for the received texture wherein the rendering parameter comprises at least one of a device resolution, available memory, rendering path, and texture type, selecting at least one memory optimization technique based on the at least one rendering parameter, wherein the memory optimization technique is at least one of Dynamic Texture Scaling (DTS), Content Adaptive Compression (CAC), and On Device Texture Compression (ODTC) and performing the selected texture optimization technique on the received texture.

Abstract: Various embodiments of the invention provide systems, devices, and methods for decompressing encoded electronic data to increase decompression throughput using any number of decoding engines. In certain embodiments, this is accomplished by identifying and processing a next record in a pipeline operation before having to complete the decompression of a current record. Various embodiments take advantage of the knowledge of the method of how the records have been encoded, e.g., in a single long record, to greatly reduce delay time, compared with existing designs, when decompressing encoded electronic data.