Abstract: Speech encoders and methods of speech encoding are disclosed that encode inactive frames at different rates. Apparatus and methods for processing an encoded speech signal are disclosed that calculate a decoded frame based on a description of a spectral envelope over a first frequency band and the description of a spectral envelope over a second frequency band, in which the description for the first frequency band is based on information from a corresponding encoded frame and the description for the second frequency band is based on information from at least one preceding encoded frame. Calculation of the decoded frame may also be based on a description of temporal information for the second frequency band that is based on information from at least one preceding encoded frame.

Abstract: A computer implemented method of performing data compression includes applying, with a computing device, a hash function to a selected part of a character string to calculate a hash value; searching, using the hash value, through entries in a bucket chain having the hash value previously registered in a hash table, and finding a longest matching character string; acquiring, an index indicating that a longest matching character string cannot be found in the search through the entries and thus the search operation is wasted; and switching the hash function to a different hash function for expanding the selected part of the character string, without reconstructing the hash table, when the index exceeds a predetermined threshold.

Abstract: Methods and apparatus teach a digital spectrum of a file for use in determining positional relationships between groups of files. The digital spectrum is used to reveal distances between the files to sort into groups of related files. Representatively, files determined by a nearest neighbor method to be related are sorted into groups of related files. In turn, the groups of related files are determined to be related, or not, according to positional location in N-dimensional space. A centroid location for each group of related files is determined, and a distance value from that centroid location to each member file of the group of related files is determined. In turn, centroid-to-centroid distance values are determined between each group of related files and rank-ordered. Comparing the centroid-to-centroid distance values and the distance values between centroid locations and files of the groups of related files reveals relatedness, or not, of groups of files.

Abstract: Various exemplary embodiments relate to a method performed by a pulsewidth modulation (PWM) controller, the method including: receiving a control input including PWM parameters; producing inputs to a digital serializer, wherein the inputs result in a digital serializer output that is pulsewidth modulated according to the PWM parameters; receiving a feedback control input; and modifying inputs to a digital serializer based upon the feedback control input.

Abstract: A plurality of line interfaces is configured to receive a spread signal over the plurality of line interface. The spread signal carrying symbols with guaranteed symbol-to-symbol state transitions between consecutive symbols. The spread signal is defined by a plurality of transition signals including a first signal over a first line interface. A clock signal is extracted based on a comparison between a first instance of the first signal and a delayed second instance of the first signal. The delayed second instance of the first signal is sampled based on the clock signal to provide a symbol output. The clock extraction circuit is further adapted to generate the clock signal based on additional comparisons between a first instance of a second signal, within the plurality of transition signals, and a delayed second instance of the second signal, where the first and second signals are concurrent signals received over different line interfaces.

Abstract: Method, apparatus, and systems for Link Transfer, bit error detection and link retry using flit bundles asynchronous to link Fabric Packets. A first type of packet comprising a Fabric Packet is generated and its data content is divided into multiple data units called “flits.” The flits are then bundled into a second type of packet comprising Link Transfer Packets (LTPs). The LTPs are then sent over single link segments in a fabric comprising many point-to-point links. Each LTP includes a CRC that is used to ensure that data transmitted over each link segment is error free, and comprises a unit of retransmission. The size of the fabric packets may vary, and they may be larger or smaller than an LTP. The transfer scheme enabled flits from multiple fabric packets to be bundled into a single LTP. Upon receipt at a fabric endpoint, the flits from the LTPs are extracted and reassembled to regenerate the Fabric Packets.

Abstract: B-Tree data is serialized to existing data for all types of workloads. The serialized B-Tree data, that has been split, sorted and classified into identified data ranges, is then compressed.

Abstract: Techniques are provided for storing files in a parallel computing system based on a user-specification. A plurality of files generated by a distributed application in a parallel computing system are stored by obtaining a specification from the distributed application indicating how the plurality of files should be stored; and storing one or more of the plurality of files in one or more storage nodes of a multi-tier storage system based on the specification. The plurality of files comprise a plurality of complete files and/or a plurality of sub-files. The specification can optionally be processed by a daemon executing on one or more nodes in a multi-tier storage system. The specification indicates how the plurality of files should be stored, for example, identifying one or more storage nodes where the plurality of files should be stored.

Abstract: The present disclosure is directed to a system and method for encoding k input symbols, using a Reed-Solomon erasure correction code, into a longer stream of n output symbols for transmission over an erasure channel. The present disclosure is further directed to a system and method for recovering the original k input symbols from only (and any) k output symbols (out of the n output symbols) received over the erasure channel. A symbol is a generic data unit consisting of one or more bits that can be, for example, a packet. The systems and methods of the present disclosure provide for an adjustable code rate that can be readily adapted based on changing channel conditions without having to reconstruct the encoder/decoder. As a result, such an encoder/decoder can be referred to as rate-independent.

Abstract: Methods and systems for encoding frames while maintaining bounded running disparity, including: encoding the headers of the frames utilizing a first line-code; selecting the first line-code and a second line code for encoding first and second payloads of first and second frames, respectively, based on first and second data types of first and second data comprised in the first and second payloads, respectively; encoding the first and second payloads utilizing the first and second line-codes, respectively; and transmitting the first and second frames over a communication channel characterized by first and second channel conditions, respectively. The second line-code has a minimal Hamming distance lower than that of the first line-code, and the differences between the first and second channel conditions are not enough for selecting the second line-code instead of the first line-code for encoding the second payload.

Abstract: A requirement acquisition system for grasping requirements from related documents such as documents the client holds, investigation results of an interview or questionnaire, meeting minutes, specification and the like, in system or software development, by reduced efforts and hours is provided. In particular, from a document being a group of character strings, one or more partial string which is a common part of the plurality of character strings is extracted as an important phrase. When the important phrase does not exist, the processing is finished. When the important phrase exists, a representative character string of the document is extracted as a candidate character string, deleting the candidate character string is deleted from the document, and the important phrase is deleted from the candidate character string. When the number of the important phrase being deleted is one or more, the candidate character string is set as an important character string.

Abstract: Systems, methods, and apparatus are provided for improving the iterative decoding performance of a decoder, for example, as used in a wireless communications receiver or in a data retrieval unit. A decoding technique may receive and process a set of channel samples using an iterative decoder. If the iterative decoder output indicates a decoding failure, noise samples may foe combined with the received channel samples to create biased channel samples. Noise sample may be generated using a pseudo-random noise generator and/or by using signals already present in the communications receiver or data retrieval unit. The biased channel samples may be provided to the iterative decoder and the iterative decoder may re-run using the biased channel samples.

Abstract: A method and device for modifying a synthesis of a time-domain excitation decoded by a time-domain decoder, wherein the synthesis of the decoded time-domain excitation is classified into one of a number of categories. The decoded time-domain excitation is converted into a frequency-domain excitation, and the frequency-domain excitation is modified as a function of the category in which the synthesis of the decoded time-domain excitation is classified. The modified frequency-domain excitation is converted into a modified time-domain excitation, and a synthesis filter is supplied with the modified time-domain excitation to produce a modified synthesis of the decoded time-domain excitation.

Abstract: An encoder uses an input file of data and a key to produce an output symbol. An output symbol with key I is generated by determining a weight, W(I), for the output symbol to be generated, selecting W(I) of the input symbols associated with the output symbol according to a function of I, and generating the output symbol's value B(I) from a predetermined value function F(I) of the selected W(I) input symbols. An encoder can be called repeatedly to generate multiple output symbols. The output symbols are generally independent of each other, and an unbounded number (subject to the resolution of I) can be generated, if needed. A decoder receives some or all of the output symbols generated. The number of output symbols needed to decode an input file is equal to, or slightly greater than, the number of input symbols comprising the file, assuming that input symbols and output symbols represent the same number of bits of data.

Abstract: The present invention relates to compression of values and bitmaps, and methods thereof. Such methods are configured for operating on a computer system having a word length architecture of length WL and are based on the observation that not all the bits used for the run-length counter—i.e., the fill length field (FL) inhere—are often used, since runs are seldom so long. Contrarily to other compression schemes (e.g., WAH), said methods may assign the unused bits to one or more position list fields (PL, PL1, PL2, PLs), thus boosting the compression ratio. Moreover, the total length (in terms of number of bits) of the uncompressed data—comprising values or bitmaps—may be stored just once, preferably at the beginning of the compression, thus dramatically diminishing the storage requirements for the compression scheme, since it is not required to keep track of the length of each bitmap word while performing the compression or the decompression.

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: Disclosed are a distributed video encoding/decoding method and a distributed video encoding/decoding apparatus, which can improve loss resilience and the quality of service. The distributed video encoding method first involves checking the state of a channel, determining a channel coding rate and the size of video data to be transmitted based on the checked state of a channel, determining the number of motion prediction performance steps based on the determined size of video data to be transmitted, encoding the video data to be transmitted by performing motion predictions according to the determined number of motion prediction performance steps, and channel-coding the encoded video data according to the determined channel coding rate. Accordingly, it is possible to improve loss resilience, even without additionally occupying network resources, thereby being capable of reducing the probability of decoding failure.

Abstract: There are provided a base band processor having a peak suppression function, a transmitter, and a method of transmitting a signal. The base band processor includes: a signal generating unit generating digital signals; a variable up/down sampling unit changing a sampling rate in real time according to a magnitude of signal bandwidth changed in real time and sampling the digital signals from the signal generating unit according to the sampling rate; a peak suppression processing unit detecting peak power of sampled signals from the variable up/down sampling unit for a respective section in which a peak exists and suppressing corresponding peak power according to the peak power of the respective section; and a signal converting unit converting the digital signals from the peak suppression processing unit into analog signals.

Abstract: A computer-implemented method for uploading and storing a file. The file is automatically transcoded to the format(s) of registered device(s) associated with an entity. The transcoded files are thus prepared for download and access by the registered devices.

Abstract: Devices, methods, and systems capable of an enabling transmission and receipt of secure and non-secure data are discussed in this document. According to some embodiments, a network apparatus can transmit ciphered and unciphered data. The network apparatus transmits a first signal indicating a cipher to be used and transmits a second signal indicating that non-secure data is to be transmitted and received unciphered. The network apparatus can cipher secure data and transmits ciphered-secure data and unciphered-non-secure data. A wireless terminal can receive the first and second signals, the ciphered secure data, and the unciphered non-secure data. The wireless terminal can deciphers the received secure data and does not decipher the received non-secure data. System embodiments can include both network-side and network terminal components. Embodiments of the present invention enable secure transmission of data in concert with efficient processing.

Abstract: Embodiments relate to providing a data stream interface for offloading the inflation/deflation processing of data to a stateless compression accelerator. An aspect includes transmitting a request to inflate or deflate a data stream to a compression accelerator. The request may include references to an input buffer for storing input data from the data stream, an output buffer for storing processed input data, and a state data control block for storing a stream state. The stream state is provided to the compression accelerator to continue processing the data stream responsive to the request being a subsequent request. The compression accelerator is instructed to store a current stream state in the state data control block responsive to the request being a non-final request. Accordingly, the current stream state is received from the compression accelerator responsive to the request being a non-final request. The processed input data is received from the compression accelerator.

Abstract: In various embodiments, an iterative decoder may compute, from sign bits of log likelihood ratios associated with x bits of a plurality of bits of encoded data, a first combination of the x bits having a higher associated log density ratio than any other combination of the x bits. In various embodiments, the iterative decoder may further be configured to compute m combinations of the x bits having m highest associated log density ratios, based on reductions in log density ratios associated with one or more sub-combinations of the x bits and the computed first combination of the x bits. In various embodiments, a variable node associated with the iterative decoder may be updated with the m combinations of the x bits.

Abstract: Embodiments relate to providing a data stream interface for offloading the inflation/deflation processing of data to a stateless compression accelerator. An aspect includes transmitting a request to inflate or deflate a data stream to a compression accelerator. The request may include references to an input buffer for storing input data from the data stream, an output buffer for storing processed input data, and a state data control block for storing a stream state. The stream state is provided to the compression accelerator to continue processing the data stream responsive to the request being a subsequent request. The compression accelerator is instructed to store a current stream state in the state data control block responsive to the request being a non-final request. Accordingly, the current stream state is received from the compression accelerator responsive to the request being a non-final request. The processed input data is received from the compression accelerator.

Abstract: Provided are an apparatus and method of compressing spatial data and an apparatus and method of restoring compressed spatial data, the method of compressing spatial data including: determining the size of actual data of the spatial data stored in a unit storage space having a predetermined size; selecting the size of a compression storage space in which the spatial data is to be compressed and to be stored, in consideration of the determined size of the actual data of the spatial data; generating flag information considering the size of the actual data of the spatial data; and storing the generated flag information in a predetermined region of the compression storage space having the selected size and storing the actual data of the spatial data in the other regions of the compression storage space.

Abstract: A method for managing media storage. The method includes determining, by a computer, that storage space is needed on a storage device, wherein the storage device stores one or more media files. The method includes determining a likely viewing device for a media file selected from the one or more media files and converting the media file from a first format to a second format, based on the determined likely viewing device.

Abstract: A method for managing media storage. The method includes determining, by a computer, that storage space is needed on a storage device, wherein the storage device stores one or more media files. The method includes determining a likely viewing device for a media file selected from the one or more media files and converting the media file from a first format to a second format, based on the determined likely viewing device.

Abstract: Large-dimension MIMO and multipoint broadcasting in new generation of wireless networks create high demand for various types of pilots in transmission signals for channel estimation, data demodulation, synchronization, etc. More pilots, as in existing networks, use more resources and thus diminish the network capacity. Methods and apparatus of heterogeneous pilots are disclosed. A heterogeneous pilot has its own signal characteristics that are different from the primary information-bearing signals in the network. Heterogeneous pilots can be spread-spectrum signals in an OFDM-based wireless network. Heterogeneous pilots use no network resources, and can be as many as desired, and can be designed to have versatile utilities. Also described are methods and apparatus of heterogeneous pilot cancellation that minimizes the interference of heterogeneous pilots on the primary information-bearing signals.

Abstract: A device may encapsulate video data such that Supplemental Enhancement Information (SEI) messages are stored separately from a sequence of coded video pictures described by the SEI messages. An example device includes a control unit configured to generate one or more SEI messages separate from the coded video pictures, wherein the SEI messages describe respective ones of the sequence of coded video pictures and include elements common to more than one of the coded video pictures, and an output interface configured to output the SEI messages separately from the sequence of coded video pictures. An example destination device may receive the SEI messages separately from the coded video pictures and render the coded video pictures using the SEI messages.

Abstract: A method for efficient retransmission over a satellite network including transmitting data packets to VSATs, receiving retransmission requests for at least one of the data packets from the VSATs, generating a retransmission packet based on the retransmission requests using XOR summing, transmitting the retransmission packet to the plurality of VSATs.

Abstract: A method for network coding includes generating a message matrix, where each column of the message matrix corresponds to one of K message packets and each element in a column of the message matrix corresponds to one of the symbols of the corresponding message packet. The method further includes generating a network code matrix to map the K message packets to N encoded packets, where any combination of K columns of the network code matrix is linearly independent and N is greater than K. The method also includes multiplying the message matrix by the network code matrix to generate a transmission matrix, where each column of the transmission matrix corresponds to an encoded packet for wireless transmission.

Abstract: A method for network coding using a near-maximum distance separable linear network code includes generating a message matrix where each column of the message matrix corresponds to one of K message packets and each element in a column of the message matrix corresponds to one of the symbols of the corresponding message packet. The method also includes generating a network code matrix to map the K message packets to N encoded packets, where any combination of K+1 columns of the network code contains at least K columns that are linearly independent. Further, the method includes multiplying the message matrix by the network code matrix to generate a transmission matrix, where each column of the transmission matrix corresponds to an encoded packet for wireless transmission.

Abstract: A digital to analog converter (DAC) includes a thermometer coder that processes a digital input based on a thermometer coding, and generates a plurality of micro-current source inputs and a plurality of micro-current source analog controls. A plurality of micro-current sources generate a corresponding plurality of micro-current source outputs in response to the plurality of micro-current source inputs, wherein first selected ones of the plurality of micro-current sources are powered-off in response to the plurality of micro-current source analog controls. A summing circuit generates an analog output based on a sum of the corresponding plurality of micro-current source outputs.

Abstract: A system and method for encoding video and reducing video artifacts in the encoded video are provided. The system and method of the present disclosure provide for enabling a user to simply select a preset (e.g., a group of encoding or re-encoding parameters) to fix or provide a starting point to fix video artifacts present in an encoded video. Furthermore, the system and method of present disclosure flag, classify, and organize potential post-encoding related video quality issues, e.g., video artifacts such as banding, dark noise, etc., that are detected during the encoding process. By identifying and categorizing video artifacts, the system and method make the fixing of these video artifacts easier and more precise thereby increasing quality, saving time, and performance.

Abstract: A method for iteratively decoding a set of encoded samples received from a transmission channel is provided. A data signal indicative of a noise level of the transmission channel is received. A scaling factor is then determined in dependence upon the data signal and the encoded samples are scaled using the scaling factor. The scaled encoded samples are then iteratively decoded. Furthermore, a method for initializing edge memories is provided. During an initialization phase initialization symbols are received from a node of a logic circuitry and stored in a respective edge memory. The initialization phase is terminated when the received symbols occupy a predetermined portion of the edge memory. An iterative process is executed using the logic circuitry storing output symbols received from the node in the edge memory and a symbol is retrieved from the edge memory and provided as output symbol of the node. Yet further an architecture for a high degree variable node is provided.

Abstract: Method and system for determining QR code binary image is provided. Locating lines on which edges of the QR code locate are determined according to location information of locating points within the QR code image and distances between the locating points to edges of the QR code. Distances may be used to obtain locating lines on which edges of the QR code locate, with relatively smaller errors. When a QR code image is distorted, it generally bulges outward. The position of a determined locating line is within the interior of the QR code image, and an actual edge of the QR code partly overlaps with the locating line and partly locate on external side of locating line. Edge points on external side of a locating line are detected along the direction of the locating line and then are connected to form an edge line of QR code.

Abstract: Data are communicated in a wireless network, between a transmitter and a receiver. The transmitter estimates a first channel response between the receiver and the transmitter, and generates a first key based on the first channel response. The data are encoded at the transmitter using a rate-adaptive code to produce encoded data, and scrambled using the first key before broadcasting. Subsequently, the receiver can estimate a second channel response to generate a second key to be used to descramble the broadcast data.

Abstract: The bit length reducing unit reduces the bit length of an operand expressed by a floating-point number and outputs the operand to a computing unit. The bit length increasing unit increases the bit length of the result value of operation represented by the floating-point number inputted from the computing unit and restores the original bit length. The bit length reducing unit discards a preset number of higher-order bits of the exponent part of the floating-point number and at the same time adds a positive or negative offset value to the exponent part with the higher-order bits discarded, according to an application to be executed by the computing unit. The bit length increasing unit restores the bits discarded by the bit length reducing unit 11 from the exponent part of the floating-point number and at the same time subtracts an offset value from the exponent part.

Abstract: According to one embodiment, a transmitter includes a signal dividing unit, a syndrome sending unit, a syndrome receiving unit and a decoding unit. The signal dividing unit divides an original signal into a first signal and a second signal based on a common dividing policy. The syndrome sending unit sends the first syndrome message calculated based on the first signal through a clear channel. The syndrome receiving unit receives a second syndrome message through the clear channel. The decoding unit decodes the second signal by using the second syndrome message to restore a fourth signal, the fourth signal being corresponding to the second signal received by a receiver through a noisy channel.

Abstract: Aspects of the invention are provided for decoding a selected span of data within a compressed code stream. A selection of data within the compressed code stream from an arbitrary position is presented for decompression. The arbitrary position is the starting point in the compressed code stream for decompression, and a phrase within the compressed code stream containing the starting point is identified. From the arbitrary starting point, a back pointer may provide direction to the literal. The literal is extracted as a decoding of the compressed data associated with the starting point.

Abstract: Disclosed is a method to convert a Unicode character. The method includes intercepting a service call for a character conversion, determining if a character associated with the service call is a candidate for a first conversion service, if the character is a candidate for the first conversion service, converting the character using the first conversion service, if the character is not a candidate for the first conversion service, converting the character using a second conversion service, and returning the converted character.

Abstract: Systems and methods for efficiently managing the resources in a delivery system may include managing the processing power of a transcoder. By managing the input selection functions of a tuner and linking the selections with functions of a transcoder, the transcoder may process fewer instructions for a given request, resulting in the ability of the transcoder to support more streams. Modifying the inputs to the transcoder that need to be transcoded, therefore, may enable the media content delivery system to support more inputs and, thereby, more media playback devices. Managing the processing power of a transcoder can more efficiently support the delivery of media content to a media playback device, particularly where the delivery system supports multiple media playback devices.

Abstract: The present invention is based on the finding that parameters including: a first set of parameters of a representation of a first portion of an original signal and a second set of parameters of a representation of a second portion of the original signal can be efficiently encoded when the parameters are arranged in a first sequence of tuples and a second sequence of tuples. The first sequence of tuples includes tuples of parameters having two parameters from a single portion of the original signal and the second sequence of tuples includes tuples of parameters having one parameter from the first portion and one parameter from the second portion of the original signal. A bit estimator estimates the number of necessary bits to encode the first and the second sequence of tuples. Only the sequence of tuples, which results in the lower number of bits, is encoded.

Abstract: A CODEC includes a transmission path between an encoder and a decoder. The encoder receives bits of data in a first form in which each bit of the data is represented by switching between first and second logic states and no voltage change between consecutive bits of the same logic state and serially transmits the bits in a second form in which the first logic state is maintained at a high voltage, the second logic state is maintained at a low voltage, and an intermediate voltage is maintained between consecutive bits. The decoder receives the bits in the second form and derives a clock from the occurrences of the intermediate voltage. The clock, repetitively, is maintained at a logic high, then switches directly from the logic high to a logic low, then is maintained at the logic low, and then switches directly between the logic low and the logic high.

Abstract: Provided are a computer program product, system, method, and data structure for compressing an input data stream. A determination is made of consecutive data units in the input data stream that match consecutive data units in a history buffer. A copy pointer symbol indicates a copy pointer symbol referencing previously received data units in the history buffer. A determination is made of a relative displacement count in the history buffer at which the number of matching consecutive data units start. A determination is made of a range of relative displacement counts comprising one of a plurality of ranges of displacement counts including the determined relative displacement count. A determination is made of the encoding scheme associated with the determined range. An encoding of the relative displacement count is determined from the determined encoding scheme. The determined encoding of the relative displacement count is indicated in the copy pointer.

Abstract: The invention relates to an estimator for estimating a probability distribution of a quantization index generated from a source coder encoding a source signal, into a sequence of quantization indices, the source signal being described by a signal model, the source coder providing a current quantization index and current side information, the estimator being configured to obtain auxiliary parameters based on a configuration of the source coder and the current available side information and the signal model, the estimator being further configured to adaptively update the probability distribution of a quantization index upon the basis of a probability density function relating to a previous state of the estimator, the auxiliary parameters, the current quantization index and the current side information.

Abstract: A check node processing unit updates an extrinsic value ratio based on a prior value ratio for each row of a parity check matrix with respect to input data. An identifying unit identifies, based on an element of the parity check matrix that can be identified by a row and column associated with the updated extrinsic value ratio, a next-target element in the same column and in a different row. The identifying unit identifies an element to be updated in the next step by the check node processing unit, from among multiple elements included in the same column. A variable node processing unit updates, based on the extrinsic value ratio, a prior value ratio associated with the identified next-target element after the check node processing unit completes the updating of each row. The check node processing unit and the variable node processing unit alternately and iteratively execute their operations.

Abstract: In a pulse encoding and decoding method and a pulse codec, more than two tracks are jointly encoded, so that free codebook space in the situation of single track encoding can be combined during joint encoding to become code bits that may be saved. Furthermore, a pulse that is on each track and required to be encoded is combined according to positions, and the number of positions having pulses, distribution of the positions that have pulses on the track, and the number of pulses on each position that has a pulse are encoded separately, so as to avoid separate encoding performed on multiple pulses of a same position, thereby further saving code bits.

Abstract: An apparatus and method are described for reading a file into a universal representation and translating from that universal representation into various file formats. For example, a method according to one embodiment comprises: reading compressed audio data from a first audio file, the first audio file comprising audio data compressed using a first compression algorithm and bookkeeping data having a first format, the bookkeeping data specifying a location of the compressed audio data within the first audio file; and generating a universal representation of the first audio file without decompressing and recompressing the audio data, the universal representation having bookkeeping data of a second format specifying the location of compressed audio data within the universal representation.

Abstract: An organic light emitting display is provided. The organic light emitting display includes a display unit coupled to scan lines and data lines and including pixels configured to receive first and second power sources, and a DC-DC converter for generating the first and second power sources. The DC-DC converter includes first and second power source generating units for generating the first and second power sources from an input power source and for outputting the first and second power sources to first and second output ends, a controller for controlling driving of the first and second power source generating units, and first and second short sensing units for outputting first and second short sensing signals to the controller when voltages of the first and/or second output ends are greater than or equal to corresponding first and second reference voltages.

Abstract: Described herein are systems and methods of reducing memory consumption in a device. The device may be resource constrained such as having limited memory, processor, power, or other resources for execution of applications. An application may be transitioned to a background state and at least a portion of the data associated with that application may be compressed, freeing up memory. While in the background state, notifications from other applications may be processed by a notification module on behalf of the application in the background state.