Patents by Inventor Eli Arviv

Eli Arviv 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).

  • Publication number: 20180227048
    Abstract: A method of simplifying the encoding of a predetermined number of bits of data into frames including adding error coding bits so that a ratio of the frame length times the baud rate of the frame times he bit packing ratio of the data divided the total bits of data is always an integer. The method may also convolutionally encode the bits of data so that the same equation is also always an integer.
    Type: Application
    Filed: April 2, 2018
    Publication date: August 9, 2018
    Inventors: Israel Jay Klein, Kenneth L. Stanwood, Steve Pullmann, Frederick W. Price, Rami Hadar, Eli Arviv, David Gazelle, Sheldon Gilbert
  • Patent number: 9935705
    Abstract: A method of simplifying the encoding of a predetermined number of bits of data into frames including adding error coding bits so that a ratio of the frame length times the baud rate of the frame times he bit packing ratio of the data divided the total bits of data is always an integer. The method may also convolutionally encode the bits of data so that the same equation is also always an integer.
    Type: Grant
    Filed: April 2, 2015
    Date of Patent: April 3, 2018
    Assignee: WI-LAN INC.
    Inventors: Israel Jay Klein, Kenneth L. Stanwood, Steve Pollmann, Frederick W. Price, Rami Hadar, Eli Arviv, David Gazelle, Sheldon Gilbert
  • Publication number: 20150365162
    Abstract: A method of simplifying the encoding of a predetermined number of bits of data into frames including adding error coding bits so that a ratio of the frame length times the baud rate of the frame times he bit packing ratio of the data divided the total bits of data is always an integer. The method may also convolutionally encode the bits of data so that the same equation is also always an integer.
    Type: Application
    Filed: April 2, 2015
    Publication date: December 17, 2015
    Inventors: Israel Jay Klein, Kenneth L. Stanwood, Steve Pollmann, Frederick W. Price, Rami Hadar, Eli Arviv, David Gazelle, Sheldon Gilbert
  • Patent number: 9007897
    Abstract: A method of simplifying the encoding of a predetermined number of bits of data into frames including adding error coding bits so that a ratio of the frame length times the baud rate of the frame times the bit packing ratio of the data divided the total bits of data is always an integer. The method may also convolutionally encode the bits of data so that the same equation is also always an integer.
    Type: Grant
    Filed: August 27, 2010
    Date of Patent: April 14, 2015
    Assignee: Wi-Lan, Inc.
    Inventors: Israel Jay Klein, Kenneth L. Stanwood, Steve Pollmann, Frederick W. Price, Rami Hadar, Eli Arviv, David Gazelle, Sheldon Gilbert
  • Patent number: 8537757
    Abstract: The invention relates to communication systems and to systems and methods for implementing adaptive call admission control (CAC) in such systems. Adaptive call admission control can determine what CPE to base station calls (connections) are allowed at any given time. CAC, coupled with precedence, can further determine what connections are suspended if less bandwidth is available than is currently committed. Multiple techniques are disclosed to select connections for suspension. These techniques include suspending enough connections through the affected CPE until there is enough bandwidth to meet the remaining commitment, randomly (or in a round robin fashion) choosing connection to suspend from the entire set of connection, and using precedence priority levels.
    Type: Grant
    Filed: June 1, 2012
    Date of Patent: September 17, 2013
    Assignee: Wi-Lan, Inc.
    Inventors: Eli Arviv, Brian Spinar, Kenneth L. Stanwood, David Gazelle, Ofer Zimmerman, Penny Efraim, Yair Bourlas, Sheldon L. Gilbert
  • Patent number: 8199779
    Abstract: Apparatus, system and method for synchronizing one or more clocks across a communication link. A slave clock may be synchronized to a master clock by means of a synchronization signal sent from the master to the slave clock side of the link. The synchronization signal may be an expected signal pattern sent at intervals expected by the slave side. The slave clock may correlate received signals with a representation of the expected synchronization signal to produce a correlation sample sequence at a first sample rate which is related as n times the slave clock rate. The synchronization signal receipt time indicated by the correlation sample sequence may be refined by interpolating the correlation sample sequence around a best correlation sample to locate a best interpolation at an interpolation resolution smaller than the sample resolution. The best interpolation may in turn be further refined by estimating between interpolator outputs adjacent to the best interpolation output.
    Type: Grant
    Filed: February 4, 2011
    Date of Patent: June 12, 2012
    Assignee: Wi-LAN, Inc.
    Inventors: Pranesh Sinha, Sharon Akler, Yair Bourlas, Timothy Leo Gallagher, Sheldon L. Gilbert, Stephen C. Pollmann, Frederick W. Price, Blaine C. Readler, John Wiss, Eli Arviv
  • Patent number: 8130640
    Abstract: A method of simplifying the encoding of a predetermined number of bits of data into frames including adding error coding bits so that a ratio of the frame length times the baud rate of the frame times he bit packing ratio of the data divided the total bits of data is always an integer. The method may also convolutionally encode the bits of data so that the same equation is also always an integer.
    Type: Grant
    Filed: February 27, 2009
    Date of Patent: March 6, 2012
    Assignee: Wi-LAN, Inc.
    Inventors: Israel Jay Klein, Kenneth L. Stanwood, Steve Pollmann, Frederick W. Price, Rami Hadar, Eli Arviv, David Gazelle, Sheldon Gilbert
  • Publication number: 20110122981
    Abstract: Apparatus, system and method for synchronizing one or more clocks across a communication link. A slave clock may be synchronized to a master clock by means of a synchronization signal sent from the master to the slave clock side of the link. The synchronization signal may be an expected signal pattern sent at intervals expected by the slave side. The slave clock may correlate received signals with a representation of the expected synchronization signal to produce a correlation sample sequence at a first sample rate which is related as n times the slave clock rate. The synchronization signal receipt time indicated by the correlation sample sequence may be refined by interpolating the correlation sample sequence around a best correlation sample to locate a best interpolation at an interpolation resolution smaller than the sample resolution. The best interpolation may in turn be further refined by estimating between interpolator outputs adjacent to the best interpolation output.
    Type: Application
    Filed: February 4, 2011
    Publication date: May 26, 2011
    Applicant: WI-LAN, INC.
    Inventors: Pranesh Sinha, Sharon Akler, Yair Bourlas, Timothy Leo Gallagher, Sheldon L. Gilbert, Stephen C. Pollmann, Frederick W. Price, Blaine C. Readler, John Wiss, Eli Arviv
  • Patent number: 7907640
    Abstract: A slave clock may be synchronized to a master clock by means of a synchronization signal sent from the master to the slave clock side of the link. The synchronization signal may be an expected signal pattern sent at intervals expected by the slave side. The slave clock may correlate received signals with a representation of the expected synchronization signal to produce a correlation sample sequence at a first sample rate which is related as n times the slave clock rate. A best interpolation may in turn be further refined by estimating between interpolator outputs adjacent to the best interpolation output. The synchronization signal receipt time thus determined is compared to the expected time based upon the slave clock, which is adjusted until the times match. The best interpolation may in turn be further refined by estimating between interpolator outputs adjacent to the best interpolation output.
    Type: Grant
    Filed: July 23, 2009
    Date of Patent: March 15, 2011
    Assignee: Wi-LAN, Inc.
    Inventors: Pranesh Sinha, Sharon Akler, Yair Bourlas, Timothy Leo Gallagher, Sheldon L. Gilbert, Stephen C. Pollmann, Frederick W. Price, Blaine C. Readler, John Wiss, Eli Arviv
  • Publication number: 20100323733
    Abstract: A method of simplifying the encoding of a predetermined number of bits of data into frames including adding error coding bits so that a ratio of the frame length times the baud rate of the frame times the bit packing ratio of the data divided the total bits of data is always an integer. The method may also convolutionally encode the bits of data so that the same equation is also always an integer.
    Type: Application
    Filed: August 27, 2010
    Publication date: December 23, 2010
    Applicant: WI-LAN, INC.
    Inventors: Israel Jay Klein, Kenneth L. Stanwood, Steve Pollmann, Frederick W. Price, Rami Hadar, Eli Arviv, David Gazelle, Sheldon Gilbert
  • Publication number: 20090279652
    Abstract: Apparatus, system and method for synchronizing one or more clocks across a communication link. A slave clock may be synchronized to a master clock by means of a synchronization signal sent from the master to the slave clock side of the link. The synchronization signal may be an expected signal pattern sent at intervals expected by the slave side. The slave clock may correlate received signals with a representation of the expected synchronization signal to produce a correlation sample sequence at a first sample rate which is related as n times the slave clock rate. The synchronization signal receipt time indicated by the correlation sample sequence may be refined by interpolating the correlation sample sequence around a best correlation sample to locate a best interpolation at an interpolation resolution smaller than the sample resolution. The best interpolation may in turn be further refined by estimating between interpolator outputs adjacent to the best interpolation output.
    Type: Application
    Filed: July 23, 2009
    Publication date: November 12, 2009
    Applicant: WI-LAN, INC.
    Inventors: Pranesh Sinha, Sharon Akler, Yair Bourlas, Timothy Leo Gallagher, Sheldon L. Gilbert, Stephen C. Pollmann, Frederick W. Price, Blaine C. Readler, John Wiss, Eli Arviv
  • Patent number: 7583705
    Abstract: One or more clocks are synchronized across a communication link using a synchronization signal sent from a master to a slave clock. The synchronization signal may be an expected signal pattern sent at intervals expected by the slave. The slave clock may correlate received signals with a representation of the expected synchronization signal to produce a correlation sample sequence at a first sample rate. The synchronization signal receipt time is compared to the expected time and the slave clock is adjusted until the times match. Master and slave clocks synchronized across the communication link constitute a noncommon clock which may be compared on each side of the link to secondary independent clocks. The secondary independent clocks may be separately synchronized by adjusting one to have the same difference from its local noncommon clock as the secondary clock on the other side of the link has from its local noncommon clock.
    Type: Grant
    Filed: June 29, 2005
    Date of Patent: September 1, 2009
    Assignee: Wi-LAN, Inc.
    Inventors: Pranesh Sinha, Sharon Akler, Yair Bourlas, Timothy Leo Gallagher, Sheldon L. Gilbert, Stephen C. Pollmann, Frederick W. Price, Blaine C. Readler, John Wiss, Eli Arviv
  • Publication number: 20090161623
    Abstract: A method of simplifying the encoding of a predetermined number of bits of data into frames including adding error coding bits so that a ratio of the frame length times the baud rate of the frame times he bit packing ratio of the data divided the total bits of data is always an integer. The method may also convolutionally encode the bits of data so that the same equation is also always an integer.
    Type: Application
    Filed: February 27, 2009
    Publication date: June 25, 2009
    Applicant: Wi-LAN, Inc.
    Inventors: Israel Jay Klein, Kenneth L. Stanwood, Steve Pollmann, Frederick W. Price, Rami Hadar, Eli Arviv, David Gazelle, Sheldon Gilbert
  • Patent number: 7519023
    Abstract: The present invention is a method of simplifying the encoding of a predetermined number of bits of data into frames. The method adds error coding bits so that a ratio of the frame length times the baud rate of the frame times the bit packing ratio of the data divided the total bits of data is always an integer. The method may also convolutionally encode the bits of data so that the same equation is also always an integer.
    Type: Grant
    Filed: October 12, 2004
    Date of Patent: April 14, 2009
    Assignee: Wi-LAN, Inc.
    Inventors: Israel Jay Klein, Kenneth L. Stanwood, Steve Pollmann, Frederick W. Price, Rami Hadar, Eli Arviv, David Gazelle, Sheldon Gilbert
  • Publication number: 20070002987
    Abstract: Apparatus, system and method for synchronizing one or more clocks across a communication link. A slave clock may be synchronized to a master clock by means of a synchronization signal sent from the master to the slave clock side of the link. The synchronization signal may be an expected signal pattern sent at intervals expected by the slave side. The slave clock may correlate received signals with a representation of the expected synchronization signal to produce a correlation sample sequence at a first sample rate which is related as n times the slave clock rate. The synchronization signal receipt time indicated by the correlation sample sequence may be refined by interpolating the correlation sample sequence around a best correlation sample to locate a best interpolation at an interpolation resolution smaller than the sample resolution. The best interpolation may in turn be further refined by estimating between interpolator outputs adjacent to the best interpolation output.
    Type: Application
    Filed: June 29, 2005
    Publication date: January 4, 2007
    Inventors: Pranesh Sinha, Sharon Akler, Yair Bourlas, Timothy Gallagher, Sheldon Gilbert, Stephen Pollmann, Frederick Price, Blaine Readler, John Wiss, Eli Arviv
  • Publication number: 20050058098
    Abstract: A method of assigning downlink time slots to receive units where the units may generate data using different modulation schemes. The method preferably assigns the downlink time slots as a function of the complexity of modulation schemes employed by the units. Further, the method preferably assigns the time slots from the least complex modulation scheme to the most complex scheme. The method may further assign uplink time slots to transmit units where the transmit units may generate data using different modulation schemes. The method preferably assigns the uplink time slots as a function of the complexity of modulation schemes employed by the uplink units. Further, the method preferably assigns the uplink time slots from the least complex modulation scheme to the most complex scheme. In other embodiments, the downlink time slots are assigned as a function of the bit per symbol rate employed by the receive units, preferably from the lowest bit per symbol rate to the highest bit per symbol rate.
    Type: Application
    Filed: October 12, 2004
    Publication date: March 17, 2005
    Inventors: Israel Klein, Kenneth Stanwood, Steve Pollmann, Frederick Price, Rami Hadar, Eli Arviv, David Gazelle, Sheldon Gilbert
  • Patent number: 6804211
    Abstract: A method of assigning downlink time slots to receive units where the units may generate data using different modulation schemes. The method preferably assigns the downlink time slots as a function of the complexity of modulation schemes employed by the units. Further, the method preferably assigns the time slots from the least complex modulation scheme to the most complex scheme. The method may further assign uplink time slots to transmit units where the transmit units may generate data using different modulation schemes. The method preferably assigns the uplink time slots as a function of the complexity of modulation schemes employed by the uplink units. Further, the method preferably assigns the uplink time slots from the least complex modulation scheme to the most complex scheme. In other embodiments, the downlink time slots are assigned as a function of the bit per symbol rate employed by the receive units, preferably from the lowest bit per symbol rate to the highest bit per symbol rate.
    Type: Grant
    Filed: August 3, 1999
    Date of Patent: October 12, 2004
    Assignee: Wi-Lan Inc.
    Inventors: Israel Jay Klein, Kenneth L. Stanwood, Steve Pollmann, Frederick W. Price, Rami Hadar, Eli Arviv, David Gazelle, Sheldon Gilbert
  • Patent number: 6621877
    Abstract: A method to train a radio includes the steps of: in a radio (36), receiving a slot of information (2) containing at least an initial portion (4) containing training information (10), a second portion (5) containing training information (11), which second portion (5) is separated from the initial portion (4), and a concluding portion (6) containing training information (12), which concluding portion (6) is separated from the second portion (5). The method combining one of the initial portion (4) with the concluding portion (6a) of a previous slot of information (1) and the concluding portion (6) with an initial portion (4b) of a subsequent slot of information (3) to provide an at least one combined portion of training information. The method using the at least one combined portion of training information and the second portion of training information to train the radio.
    Type: Grant
    Filed: September 30, 1999
    Date of Patent: September 16, 2003
    Assignee: Motorola, Inc.
    Inventors: Eli Arviv, Eliezer Fogel, Rafael Carmon, Mark Shahaf
  • Patent number: 6597733
    Abstract: A system and method for enhancing the performance of an equalizer in a modem. Multiple techniques are disclosed which improve the modem performance. A first technique uses stored parameters for each burst from each remote site to demodulate a received data stream. A second technique compensates for the gain droop caused by storing parameters across each burst. A third technique minimizes errors caused by adapting the equalizer coefficients for each data burst by analyzing the SN ratio and error rate of the received burst. A fourth technique improves the convergence of the equalizer by using a two-part preamble, whereby both parts are transmitted using different modulation techniques. A fifth technique is provided which performs a soft reset of the modem without performing a complete reset of the modem. A sixth technique determines a modem adaptation factor based on the expected modulation type of an incoming burst transmission.
    Type: Grant
    Filed: March 5, 2001
    Date of Patent: July 22, 2003
    Assignee: Ensemble Communications, Inc.
    Inventors: Stephen C. Pollmann, Eli Arviv, Jacques Behar, Timothy L. Gallagher, David Gazelle, Frederick W. Price
  • Patent number: RE42021
    Abstract: A system and method for enhancing the performance of an equalizer in a modem. Multiple techniques are disclosed which improve the modem performance. A first technique uses stored parameters for each burst from each remote site to demodulate a received data stream. A second technique compensates for the gain droop caused by storing parameters across each burst. A third technique minimizes errors caused by adapting the equalizer coefficients for each data burst by analyzing the SN ratio and error rate of the received burst. A fourth technique improves the convergence of the equalizer by using a two-part preamble, whereby both parts are transmitted using different modulation techniques. A fifth technique is provided which performs a soft reset of the modem without performing a complete reset of the modem. A sixth technique determines a modem adaptation factor based on the expected modulation type of an incoming burst transmission.
    Type: Grant
    Filed: July 20, 2005
    Date of Patent: January 4, 2011
    Inventors: Stephen C. Pollmann, Eli Arviv, Jacques Behar, Timothy L. Gallagher, David Gazelle, Frederick W. Price