# Gadiel Seroussi, Cupertino US

## Gadiel Seroussi, Cupertino, CA US

Patent application number | Description | Published |
---|---|---|

20080247659 | Universal-denoiser context-modeling component and context-modeling method - In various embodiments of the present invention, a context-based denoiser is applied to each noisy-image symbol embedded within a context to determine a replacement symbol for the noisy-signal symbol. The context-based denoiser includes a context-modeling component that efficiently generates context classes and symbol-prediction classes, assigns individual contexts to context classes and symbol-prediction classes, collects symbol-occurrence statistics related to the generated context classes and symbol-prediction classes, and, optionally, generates noisy-symbol predictions. | 10-09-2008 |

20090037795 | Denoising and Error Correction for Finite Input, General Output Channel - Systems and methods are disclosed for denoising for a finite input, general output channel. In one aspect, a system is provided for processing a noisy signal formed by a noise-introducing channel in response to an error correction coded input signal, the noisy signal having symbols of a general alphabet. The system comprises a denoiser and an error correction decoder. The denoiser generates reliability information corresponding to metasymbols in the noisy signal based on an estimate of the distribution of metasymbols in the input signal and upon symbol transition probabilities of symbols in the input signal being altered in a quantized signal. A portion of each metasymbol provides a context for a symbol of the metasymbol. The quantized signal includes symbols of a finite alphabet and is formed by quantizing the noisy signal. The error correction decoder performs error correction decoding on noisy signal using the reliability information generated by the denoiser. | 02-05-2009 |

20100278447 | Method and system for adaptive context-embedded prediction - One embodiment of the present invention is directed to an adaptive context-based predictor that predicts a value {circumflex over (x)} from a context, stored in an electronic memory, corresponding to a noisy-dataset symbol z | 11-04-2010 |

20110026848 | METHOD AND SYSTEM FOR ROBUST UNIVERSAL DENOISING OF NOISY DATA SETS - Embodiments of the present invention provide context-class-based universal denoising of noisy images and other noise-corrupted data sets. Prediction-error statistics for each prediction class, relative to a prefiltered image, are collected to estimate a bias for each prediction class, and prediction-error statistics for each conditioning class, relative to a prefiltered image, are accumulated based on the difference between predicted values and corresponding prefiltered-image symbols. The prediction-error statistics are accumulated using computed prediction-error-statistics vectors, with inversion of a prediction-error vector generated from each prediction prior to accumulation in a prediction-error-statistics vector. Conditional probability distributions are computed for individual contexts, which allow for computing a clean-image-estimated, value for each noisy-image value by minimizing a computed distortion over a range of possible estimated-clean-image symbols. | 02-03-2011 |

20110026850 | CONTEXT-CLUSTER-LEVEL CONTROL OF FILTERING ITERATIONS IN AN ITERATIVE DISCRETE UNIVERSAL DENOISER - Embodiments of the present invention are directed to various enhanced discrete-universal denoisers that have been developed to denoise images and other one-dimensional, two-dimensional or higher-dimensional data sets in which the frequency of occurrence of individual contexts may be too low to gather efficient statistical data or context-based symbol prediction. In these denoisers, image quality, signal-to-noise ratios, or other measures of the effectiveness of denoising that would be expected to increase monotonically over a series of iterations may decrease, due to assumptions underlying the discrete-universal-denoising method losing validity. Embodiments of the present invention apply context-class-based statistics and statistical analysis to determine, on a per-context-class basis, when to at least temporarily terminate denoising iterations on each conditioning class. Each iteration of the iterative methods applies context-based denoising only for those conditioning classes that statistical analysis indicates remain valid for denoising purposes. | 02-03-2011 |

20110129046 | DISCRETE DENOISING USING BLENDED COUNTS - Various embodiments of the present invention relate to a discrete denoiser that replaces symbols in a received, noisy signal with replacement symbols in order to produce a recovered signal less distorted with respect to an originally transmitted, clean signal than the received, noisy signal. Certain, initially developed discrete denoisers employ an analysis of the number of occurrences of metasymbols within the received, noisy signal in order to select symbols for replacement, and to select the replacement symbols for the symbols that are replaced. Denoisers that represent examples of the present invention use blended counts that are combinations of the occurrences of metasymbol families within a noisy signal to determine the symbols to be replaced and the replacement symbols corresponding to them. | 06-02-2011 |

20110298610 | COMPRESSING DATA IN A WIRELESS NETWORK - A distinguished node is dynamically selected from a subset of nodes in a wireless network. Data samples from the subset of nodes are received in view of the distinguished node status. At least one estimate is generated from the data samples and the data samples are compressed conditioned on the estimate. | 12-08-2011 |

20110299455 | COMPRESSING DATA IN A WIRELESS MULTI-HOP NETWORK - A first node receives aggregated compressed data and unaggregated data from a second node in a wireless multi-hop network. The first node compresses its own collected data based on the received unaggregated data. The first node aggregates its own compressed data with the aggregated compressed data received from the second node. The first node forwards an unaggregated version of its own collected data along with aggregated compressed data to a next hop in the wireless multi-hop network. | 12-08-2011 |

20120047113 | MULTIPLE-SOURCE DATA COMPRESSION - One embodiment of the present invention is directed to a method for compressing data generated by multiple data sources. The method includes steps of partitioning data generated by the multiple data sources into data partitions, the data included in each data partition containing inter-data-source redundancies and, for each data partition, compressing the data in the data partition to remove the inter-data-source redundancies. | 02-23-2012 |

20120047378 | METHOD AND SYSTEM FOR LOW-POWERED DATA TRANSMISSION - One embodiment of the present invention is a sensor comprising one or more sensing devices, data-transmission components that transmit sensor data to a receiving component, and a processing component. The processing component executes routines to record sensing-device output as data for transmission to the receiving entity and to control the data-transmission components to transmit the data to the receiving entity. The processing component executes one or more compressing routines to compress data prior to transmission, when data compression is estimated to result in a lower power cost than transmitting uncompressed data, and controlling the data-transmission components to transmit data without compressing the data when data compression is estimated to result in a higher power cost than transmitting uncompressed data. | 02-23-2012 |

20130097396 | METHOD AND SYSTEM FOR ENCODING DATA FOR STORAGE IN A MEMORY ARRAY - A method of storing data into a memory array converts an input string into a first binary array with (m−1) rows and (n−1) columns. A second binary array with m rows and n columns in an encoded bit pattern is then generated from the first binary array. The second binary array in the encoded bit pattern has at most n/2 1's in each row and at most m/2 1's in each column, and the m-th row and an n-th column contain information for decoding other entries of the second binary array. The encoded bit pattern of the second binary array is then stored into corresponding memory devices of the memory array. | 04-18-2013 |

20130100727 | OVERWRITING A MEMORY ARRAY - A data storage system including a memory array including a plurality of memory devices programmable in greater than two states. A read/write control module may overwrite data in the memory array without violating a constraint during the overwrite process. The memory array may be an m×n memory array. | 04-25-2013 |

20130103888 | MEMORY ARRAY INCLUDING MULTI-STATE MEMORY DEVICES - A data storage system including a memory array including a plurality of memory devices programmable in greater than two states. A memory control module may control operations of the memory array, and an encoder module may encode input data for storing to the memory array. The memory array may be an m×n memory array, and the memory control module may control operations of storing data to and retrieving data from the memory array. | 04-25-2013 |

20130121062 | REWRITING A MEMORY ARRAY - A method for rewriting a memory array ( | 05-16-2013 |

20130127637 | METHOD AND SYSTEM FOR COMPRESSING BITPLANES BASED ON BIT POSITION - A technology is provided for compressing digital discrete node data to reduce overall power consumption. Node data can be represented by a plurality of data units with a specified data width and can also be viewed as a plurality of bit planes corresponding to data at each bit position for the data units. A threshold bit position value may be selected for data units using an achievable compressibility estimate relative to an estimated energy consumption. The threshold bit position value can represent a boundary where an estimated energy consumption for compressing and transmitting a bit plane is less than an estimated energy consumption for transmitting the bit plane uncompressed. A bit plane is selected in the plurality of bit planes with a bit position value greater than the threshold bit position value. The bit plane is compressed using a compressor in the networked node. | 05-23-2013 |

20130250708 | MEMORY ELEMENT AND METHOD FOR DETERMINING THE DATA STATE OF A MEMORY ELEMENT - One embodiment of the present invention is directed to an electronic memory ( | 09-26-2013 |

20130262759 | Minimized Half-Select Current in Multi-State Memories - A multi-state memory system with encoding that minimizes half-select currents. The system includes an array of row and column conductors with a plurality of storage cells each capable of being placed into any of three or more physical states. An encoder is connected to receive data bits for storage and to apply activation signals to the row and column conductors to write information to the storage cells. The encoder is programmed to encode the data bits into entries in an array having one row corresponding with each row conductor and one column corresponding with each column conductor; select entries in the array according to half-select currents of the storage cells; apply a predetermined one-dimensional mapping that increases the value of at most one entry in the array to obtain a mapped array; and write entries of the mapped array into the storage cells. | 10-03-2013 |

20140164869 | EFFICIENT DATA-STORAGE DEVICES THAT INCLUDE MEMORY ELEMENTS CHARACTERIZED BY POTENTIALLY LARGE SWITCHING LATENCIES - One example disclosed in the application is an electronic data-storage device comprising one or more arrays of memory elements that each includes a data-storage medium that is switched between two different states by application of a switching-inducing force or gradient to the data-storage medium, a top control element and a bottom control element through which the switching-inducing force or gradient is applied, and a feedback signal. The data-storage device also includes an error-control-coding encoder that encodes received data and a READ/WRITE controller that writes encoded data received from the error-control-coding encoder to a number of memory elements by applying the switching-inducing force to the one or mare arrays of memory elements until feedback signals indicate that the WRITE operation has completed or until the switching-inducing force or gradient has been applied for a maximum application time. | 06-12-2014 |

20140211536 | INLINE FUSES IN PROGRAMMABLE CROSSBAR ARRAYS - A programmable crossbar array with inline fuses includes a layer of row lines and a layer of column lines with the row lines crossing over the column lines to form junctions and resistive memory elements sandwiched between row lines and a column lines at the junctions. Inline fuses are located in either the row lines, column lines or both. The inline fuses are interposed between the support circuitry and the resistive memory elements. A method for mitigating shorts in a crossbar array is also provided. | 07-31-2014 |

20140215121 | MEMORY CONTROLLER USING CRISSCROSS ERROR-CORRECTING CODES - A method is provided to manage access to a memory array. The method includes encoding a bit string with a rank metric encoder to generate an encoded binary array, modifying the encoded binary array so each row has at most half of the row with a bit value and each column has at most half of the column with the bit value, and storing the modified binary array into corresponding memory devices of the memory array. | 07-31-2014 |