Patents by Inventor Dafna Sheinwald

Dafna Sheinwald has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 6275964
    Abstract: Data communication system for transmitting data codewords of n bytes length over a communication channel (20) from a transmitter (10) comprising a hardware encoder (12) capable of receiving as input an information sequence of n−2t bytes and emitting as output a codeword of n bytes including n−2t information bytes and 2t redundant bytes to a receiver (24) comprising a hardware decoder (28) capable of detecting up to 2t byte-errors and correcting up to t byte errors; the transmitter (10) further comprising a software encoder (14) transforming, in combination with the hardware encoder (12), an information sequence of n−2s bytes with t<s≦2t into a modified sequence, the transmitter (10) emitting encoded codewords including n−2s information bytes and 2s redundant bytes, and the receiver (24) further comprising a software decoder (34) for correcting up to s byte-errors when the hardware decoder (28) has detected errors in the encoded codeword received from the communication channel (20
    Type: Grant
    Filed: March 20, 1999
    Date of Patent: August 14, 2001
    Assignee: International Business Machines Corporation
    Inventors: Kenneth Nagin, Dafna Sheinwald, Julien Satran, Efri Zeidner, Benny Rochberger
  • Patent number: 6065005
    Abstract: A method is described for operating a data processing system having a plurality of processors to sort a set of data records each having an associated key for governing the sort process. The method comprises determining a range for the key values by sampling the key values. The range is divided into a plurality of quantiles, one for each processor, each quantile having a respective index. At each processor, a plurality of buckets are defined, each bucket corresponding to a respective one of a plurality M.sub.p of subintervals in the quantile, each subinterval having a respective index. The index of the quantile in which the key value lies and the index of the subinterval in which the key value lies are determined directly from the key values using fast operations. Each key is distributed to the processor corresponding to the quantile in which the key value lies.
    Type: Grant
    Filed: December 17, 1997
    Date of Patent: May 16, 2000
    Assignee: International Business Machines Corporation
    Inventors: Shmuel Gal, Dafna Sheinwald, John M. Marberg, Alan Hartmann, Mila Keren, Zvi Yehudai
  • Patent number: 5943692
    Abstract: A computer system such as a mobile client system in which provision is made for management of flash memory. Flash memory management is done using variable block length and supports data compression. Blocks are allocated contiguously in each erase unit and each block starts with a header that contains the length of the block. Blocks are tracked using a single-level virtual address map which resides in random access memory (RAM). The mobile computer system may also include a housing, processor, random access memory, display and an input digitizer such as a touchscreen.
    Type: Grant
    Filed: April 30, 1997
    Date of Patent: August 24, 1999
    Assignee: International Business Machines Corporation
    Inventors: John M. Marberg, Brent A. Miller, Julian Satran, Dafna Sheinwald
  • Patent number: 5490269
    Abstract: A computer implemented method for speeding up the recursive most significant digit radix sorting of a set of record keys in which the keys are scanned for a shared or common prefix, coded according to the point in the key where they differ and the value of the differing digit, and processed such that during each dispersion phase the code words are used to speed processing by avoiding comparison matching of the prefixes, the recursive dispersion and collection phases continuing until singletons are reached. In the absence of shared prefixes the keys are normally recursively radix sorted.
    Type: Grant
    Filed: January 13, 1993
    Date of Patent: February 6, 1996
    Assignee: International Business Machines Corporation
    Inventors: Oded Cohn, Shmuel Gal, Yona Hollander, Dafna Sheinwald