221 |
Low complexity non-integer adaptive sample rate conversion |
US13770862 |
2013-02-19 |
US08786472B1 |
2014-07-22 |
Gregary B. Prince |
Generally described herein are methods and systems for sample rate conversion of non-integer and integer factors. In one or more embodiments an apparatus can include a sample rate converter that can include an input configured to receive an input signal with a first frequency and an output configured to provide an output signal with a second frequency different from the first frequency. The sample rate converter can include a filter coefficient lookup table and a numerically controlled oscillator configured to provide filter coefficients from the filter coefficient lookup table at a rate that is a function of the first frequency and the second frequency. The sample rate converter can include a multiplier configured to produce an output that is the product of a filter coefficient of the filter coefficients from the numerically controlled oscillator and a sample of an input signal and an accumulator configured to sum an output of the multiplier and provide a result of the summation when the accumulator receives an indicator to dump the result. |
222 |
ESTIMATOR FOR ESTIMATING A PROBABILITY DISTRIBUTION OF A QUANTIZATION INDEX |
US14186237 |
2014-02-21 |
US20140191888A1 |
2014-07-10 |
Janusz Klejsa; Minyue Li; Willem Bastiaan Kleijn |
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. |
223 |
HIERARCHICAL ENTROPY ENCODING AND DECODING |
US14240066 |
2011-08-25 |
US20140184430A1 |
2014-07-03 |
Wenfei Jiang; Kangying Cai; Ping Hu |
A particular implementation receives geometry data of a 3D mesh, and represents the geometry data with an octree. The particular implementation partitions the octree into three parts, wherein the symbols corresponding to the middle part of the octree are hierarchical entropy encoded. To partition the octree into three parts, different thresholds are used. Depending on whether a symbol associated with a node is an S1 symbol, the child node of the node is included in the middle part or the upper part of the octree. In hierarchical entropy encoding, a non-S1 symbol is first encoded as a pre-determined symbol ‘X’ using symbol set S2={S1, ‘X’} and the non-S1 symbol itself is then encoded using symbol set S0 (S2⊂S0), and an S1 symbol is encoded using symbol set S2. Another implementation defines corresponding hierarchical entropy decoding. A further implementation reconstructs the octree and restores the geometry data of a 3D mesh from the octree representation. |
224 |
Encoding device and encoding method |
US13822823 |
2011-09-07 |
US08760323B2 |
2014-06-24 |
Tomofumi Yamanashi; Masahiro Oshikiri |
An encoding device enables the amount of processing operations to be significantly reduced while minimizing deterioration in the quality of an output signal. This encoding device (101) encodes an input signal by determining the correlation between a first signal generated by using the input signal and a second signal generated by a predetermined method. An importance assessment unit (202) sets the importance of each of a plurality of processing units obtained by dividing the frames of the input signal. A CELP coder (203) performs sparse processing in which the amplitude value of a predetermined number of samples among multiple samples constituted by the first signal and/or the second signal in each processing unit is set to zero according to the importance that was set for each processing unit, and calculates the correlation between the first signal and the second signal, either of which was subjected to sparse processing. |
225 |
Method of processing data samples and circuits therefor |
US13750486 |
2013-01-25 |
US08704689B2 |
2014-04-22 |
Peter Heame; Richard Simpson |
The present invention relates to data manipulation and in particular incrementing, decrementing and comparing binary coded numbers, notably the manipulation of thermometer codes and the performance of arithmetic operations thereon. A method of processing data is provides which comprises receiving a series of data samples, each sample being represented as an N-bit thermometer code, wherein the most significant bit thereof represents the sign of the data sample value Y(n) and the remaining N−1 bits represent the magnitude of the data sample and executing a predetermined sequence of arithmetic operations directly on the series of N-bit thermometer code data samples to determine one of two values for each data sample, without any recoding of the thermometer code data samples. |
226 |
Systems and Methods for Conditional Positive Feedback Data Decoding |
US13596947 |
2012-08-28 |
US20140063636A1 |
2014-03-06 |
Fan Zhang; Shaohua Yang |
The present inventions are related to systems and methods for information data processing included selective decoder message determination. |
227 |
Methods and Apparatus in Alternate Finite Field Based Coders and Decoders |
US14064089 |
2013-10-25 |
US20140055290A1 |
2014-02-27 |
Peter Lablans |
Methods and apparatus for coding and decoding n-state symbols with n≧2 and n>2 and n>3 and n>4 are provided wherein at least one implementation of an addition over an alternate finite field GF(n) and an inverter defined by a multiplication over the alternate finite field GF(n) are provided. Encoders and decoders implementing a single n-state truth table that is a truth table of an addition over an alternate finite field GF(n) modified in accordance with at least one inverter defined by a multiplication over the alternate finite field GF(n) are also provided. Encoders include scramblers, Linear Feedback Shift Register (LFSR) based encoders, sequence generator based encoders, block coders, streaming cipher encoders, transposition encoders, hopping rule encoders, Feistel network based encoders, check symbol based encoders, Hamming coder, error correcting encoders, encipherment encoders, Elliptic Curve Coding encoders and all corresponding decoders. Systems applying encoders and decoders also are provided. |
228 |
Method and computer program product for compressing time-multiplexed data and for estimating a frame structure of time-multiplexed data |
US11836496 |
2007-08-09 |
US08644171B2 |
2014-02-04 |
James J. Meany; Brian K. Predmore |
A method and computer program product are provided for compressing and, in turn, for estimating the frame structure of time-multiplexed data. The time-multiplexed data may be received without an indication of the frame structure for the time-multiplexed data. As such, the frame structure of the time-multiplexed data may be estimated and the time-multiplexed data may be compressed at least partially in accordance with the estimation of the frame structure. The frame structure may be estimated by representing an estimation of frame structure with a tree structure. The tree structure may include a plurality of leaf nodes associated with a respective estimated signal sequence with a respective sampling rate and interleave location. The tree structure may include a plurality of tree branches with the estimation of the frame structure including at least one of splitting or merging tree branches. |
229 |
HYBRID-CODING FOR IMPROVING TRANSIENT SWITCH RESPONSE IN A MULTI-CELL PROGRAMMABLE APPARATUS |
US13539406 |
2012-06-30 |
US20140002282A1 |
2014-01-02 |
Shawn Bawell; Jean-Marc Mourant; Feng-Jung Huang |
Hybrid-coding, multi-cell architecture and operating techniques for step devices provide advantages over binary-coded and thermometer-coded step devices by minimizing or avoiding glitches common in the transient response of binary-coded step devices and by minimizing or avoiding significant increases or degradation in one or more of area, package dimensions, pin counts, power consumption, insertion loss and parasitic capacitance common to thermometer-coded step devices having equivalent range and resolution. |
230 |
DATA PROCESSING APPARATUS THAT ENABLES IMPORT/EXPORT OF SETTING VALUE, CONTROL METHOD THEREFOR, AND STORAGE MEDIUM STORING CONTROL PROGRAM THEREFOR |
US13901685 |
2013-05-24 |
US20130314259A1 |
2013-11-28 |
Noritsugu Okayama |
A data processing apparatus that is capable of reducing the garbling of characters caused by the difference among the character codes when setting data are transferred to another apparatus by the import-export function. A storage unit stores setting data for the data processing apparatus. A receiving unit receives an instruction for exporting the setting data stored in the storage unit. A converting unit converts Unicode data included in the setting data into character code data of language, which is set to the data processing apparatus. An export unit exports the character code data converted by the converting unit and the Unicode data. |
231 |
SYSTEMS, DEVICES, AND METHODS FOR CONTINUOUS TIME SIGNAL PROCESSING |
US13874215 |
2013-04-30 |
US20130287136A1 |
2013-10-31 |
Pablo MARTINEZ NUEVO; Yannis TSIVIDIS |
The present disclosure shows new mechanisms fir sampling an input signal. In particular, some embodiments of the present disclosure include a new type of a level-crossing sampling mechanism called a derivative level-crossing sampling (D-LCS). At a high level, D-LCS involves quantizing the derivative of an input signal when the derivative of the input signal crosses one of the quantization thresholds. For certain class of signals, the derivative of the input signal can vary at a slower speed compared to the amplitude of the input signal. Therefore, by sampling the derivative of the input signal, instead of the input signal itself, the number of samples per unit time can be reduced. |
232 |
METHOD FOR REDUCING DETECTION DATA OF A MONITORING DEVICE IN A VEHICLE, AND METHOD FOR MONITORING A VEHICLE DEFECT IN NEAR REAL TIME USING SAME |
US13993464 |
2011-07-13 |
US20130268157A1 |
2013-10-10 |
Min Hwan Ok; Hyun Seung Jung |
A method for reducing data of sensor devices in a vehicle includes collecting detection data periodically from the sensor devices and calculating an average value of the data collected during a cycle. The collected data may be compared with the calculated values and a deviation with previous data may be calculated by an upper and lower value difference method. A difference between the collected data and average values may also be calculated by a deviation method. The calculated value is stored. Data from a plurality of running vehicles may be periodically transmitted to a driving control center in order to monitor devices related to operations of all of the running vehicles in near real time. |
233 |
METHOD AND APPARATUS FOR HIGH BANDWIDTH DICTIONARY COMPRESSION TECHNIQUE USING SET UPDATE DICTIONARY UPDATE POLICY |
US13638132 |
2011-10-01 |
US20130205055A1 |
2013-08-08 |
Ilan Pardo; Ido Y. Soffair; Dror Reif; Debendra Das Sharma; Akshay G. Pethe |
Method, apparatus, and systems employing novel dictionary entry replacement schemes for dictionary-based high-bandwidth lossless compression. A pair of dictionaries having entries that are synchronized and encoded to support compression and decompression operations are implemented via logic at a compressor and decompressor. The compressor/decompressor logic operatives in a cooperative manner, including implementing the same dictionary update schemes, resulting in the data in the respective dictionaries being synchronized. The dictionaries are also configured with replaceable entries, and replacement policies are implemented based on matching bytes of data within sets of data being transferred over the link. Various schemes are disclosed for entry replacement, as well as a delayed dictionary update technique. The techniques support line-speed compression and decompression using parallel operations resulting in substantially no latency overhead. |
234 |
DECODING DEVICE AND DECODING METHOD |
US13799844 |
2013-03-13 |
US20130201040A1 |
2013-08-08 |
TSUYOSHI TAKAYAMA |
A decoding device includes an interface unit, a readout unit that reads out a file and recording medium management information from an external recording medium, a decoding unit that analyzes a read out file, a storage unit that stores file analysis information and recording medium management information, a determination unit that determines whether or not the recording medium management information pieces are the same when the external recording medium is connected to the interface unit, and a matching confirmation unit that, when the recording medium management information pieces are determined as being the same, determines whether or not the file contents match. When the determination results in a mismatch, the decoding unit generates new file analysis information and performs file decoding using the generated file analysis information, and when the determination results in a match, the decoding unit performs file decoding using the file analysis information in the storage unit. |
235 |
INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING SYSTEM, AND DATA CONVERSION METHOD |
US13748739 |
2013-01-24 |
US20130198211A1 |
2013-08-01 |
Tetsuharu KOHKAKI; Kunio Okita; Yasuharu Fukuda; Kazunori Takatsu |
An information processing apparatus may include a plurality of converting units respectively configured to execute a predetermined data conversion from one data format to another data format, and a control unit. The control unit may coordinate the converting units based on a conversion request to convert electronic data in a first data format into electronic data in a second data format, in order to make the converting units execute a data conversion from the first data format to the second data format. |
236 |
METHOD OF PROCESSING DATA SAMPLES AND CIRCUITS THEREFOR |
US13750486 |
2013-01-25 |
US20130194112A1 |
2013-08-01 |
Michael Harwood; Peter Hearne; Richard Simpson |
The present invention relates to data manipulation and in particular incrementing, decrementing and comparing binary coded numbers, notably the manipulation of thermometer codes and the performance of arithmetic operations thereon. A method of processing data is provides which comprises receiving a series of data samples, each sample being represented as an N-bit thermometer code, wherein the most significant bit thereof represents the sign of the data sample value Y(n) and the remaining N−1 bits represent the magnitude of the data sample and executing a predetermined sequence of arithmetic operations directly on the series of N-bit thermometer code data samples to determine one of two values for each data sample, without any recoding of the thermometer code data samples. |
237 |
PARALLEL DIFFERENTIAL ENCODING CIRCUITS |
US13823158 |
2010-12-06 |
US20130181853A1 |
2013-07-18 |
Yoshiaki Konishi |
A first differential encoding circuit is configured to perform a differential encoding on n-lines parallel input data to generate n-lines parallel output data. A second differential encoding circuit is configured to perform a differential encoding on n-lines parallel input data to generate n-lines parallel output data. A multiplexing circuit is configured to alternately multiplex the generated parallel output data from the first differential encoding circuit and the second differential encoding circuit, and configured to output the multiplexed data. |
238 |
DECODING DEVICE AND CODING METHOD |
US13607115 |
2012-09-07 |
US20130154857A1 |
2013-06-20 |
Sohei KUSHIDA; Takashi Takemoto |
A decoding device has a buffer configured in memory to store N code streams and N decoders connected in series. Each of N decoders decodes a corresponding code steam and sequentially generates partial symbols of M bit width each unit cycle. Among the N decoders, i (i>=2) stage decoders stores multiple probabilistic models in the memory. In each unit cycle, the decoder receives an input of i−1 partial symbols which contains partial symbols generated by the i−1 stage decoder in the former unit cycle, selects one probabilistic model among the multiple probabilistic models based on i−1 partial symbols which are entered previously, generates one partial symbol using previously selected probabilistic models, and outputs the previously generated one partial symbol along with previously entered i−1 partial symbols. |
239 |
DIGITAL SIGNAL CONVERTER AND METHOD OF CONVERTING DIGITAL SIGNAL |
US13331429 |
2011-12-20 |
US20130057416A1 |
2013-03-07 |
Chan Yong JEONG |
There are provided a digital signal converter and a method of converting a digital signal. The digital signal converter includes: a signal reception unit analyzing a digital input signal received according to a first form; a signal output unit transmitting a digital output signal according to a second form, different from the first form; and a controller converting the digital input signal received according to the first form into a digital output signal to be transmitted according to the second form, wherein the controller controls a power level of the digital output signal according to power supply methods of the first and second forms. Signal transmission and reception methods according to various interfaces may be provided in a limited form factor by adjusting the standard and coding of a digital signal transmitted and received through different interfaces and as to whether to supply power. |
240 |
Method and apparatus for lexical analysis using parallel bit streams |
US11834396 |
2007-08-06 |
US08392174B2 |
2013-03-05 |
Robert D. Cameron |
One embodiment of the present invention is a method for lexical analysis of a character stream including: (a) generating one or more parallel property bit streams in response to the character stream; (b) generating one or more lexical item streams in response to the one or more parallel property bit streams; and (c) generating one or more token streams in response to the one or more lexical item streams. |