David C Kravitz, Age 60Dedham, MA

2002008, Jul 4, 2002

Sep 13, 2001

09/952479

Subrahmanyam Dravida - Shrewsbury MA, US
David Kravitz - Cambridge MA, US
Sanjiv Nanda - Lunenburg MA, US
Sriram Narayan - Westford MA, US
Pinar Ormeci - Dracut MA, US
Kiran Rege - Marlboro NJ, US
Vyomesh Shah - Tewksbury MA, US
Jerome Strombosky - Westford MA, US
Daniel Talbot - Hudson TX, US
Manas Tandon - Waltham MA, US
Wei Ye - Westford MA, US
Xiangdong Zhang - Westford MA, US
Dev Gupta - Concord MA, US

Narad Networks, Inc. - Westford MA

H04J003/06

370/503000, 370/473000

Hybrid fiber/coax networks employ the existing cable plant used for cable TV and transmit data signals in a frequency bandwidth above that which is used for cable TV. As this cable plant was deployed in a tree and branch topology, data transmissions may be susceptible to noise, variable transmission loss and frequency dispersion, particularly in the upstream direction. Further, due to the tree and branch topology, homes at the far end of the network experience much greater loss than do the homes that are near to the headend/ONU. The present system, which uses point-to-point data links between intelligent network elements located in the feeder/distribution network to provide reliable, secure, bi-directional broadband access. Digital signals are terminated at the intelligent network elements, switched and regenerated for transmission across additional upstream or downstream data links as needed to connect a home to a headend or router. Raw payload data is segmented and arranged in a data phase for transmission over the data links. The intelligent network elements can be co-located with or replace the standard network elements to take advantage of existing network configurations. In this manner, the data links are made over relatively short runs of coax cable, which can provide greater bandwidth than the typical end-to-end feeder/distribution connection between a home and the headend or optical network unit.

2008015, Jun 26, 2008

Dec 21, 2006

11/642885

David Kravitz - Cambridge MA, US
Samuel J. MacMullan - Carlisle MA, US
Andrew Thangaraj - Chennai, IN
Jianhan Liu - Acton MA, US

Radiospire Networks, Inc. - Concord MA

H03M 13/05
G06F 11/10

714752, 714E11032

The present invention is directed to methods and apparatus for improving error indication performance in systems employing low-density parity check (LDPC) codes. In one aspect, a method and apparatus for providing error indication based on full LDPC parity check re-encoding are provided. In an embodiment, an LDPC encoder is employed at the receiver to re-encode the parity bits. In another embodiment, the parity bits are re-encoded recursively based on information readily available at the decoder of the receiver. In another aspect, a method and apparatus for providing error indication based on partial LDPC parity check re-encoding are provided. In an embodiment, partial checksum information is determined based on the decoder output and used to provide error indication. In a further aspect, a hybrid CRC checking and LDPC parity check re-encoding approach is provided. This approach further enhances error indication performance by reducing the miss probability compared to pure LDPC parity check re-encoding.

2013011, May 2, 2013

Oct 31, 2011

13/285773

David Kravitz - Cambridge MA, US
Daniel E. Dever - North Brookfield MA, US

Cavium, Inc. - San Jose CA

G06F 15/173

709223

A network processor includes a schedule, sync and order (SSO) module for scheduling and assigning work to multiple processors. The SSO includes an on-deck unit (ODU) that provides a table having several entries, each entry storing a respective work queue entry, and a number of lists. Each of the lists may be associated with a respective processor configured to execute the work, and includes pointers to entries in the table. A pointer is added to the list based on an indication of whether the associated processor accepts the WQE corresponding to the pointer.

5995625, Nov 30, 1999

Mar 24, 1997

8/822732

Frank W. Sudia - Newton Centre MA
Alan Asay - Salt Lake City UT
Ernest F. Brickell - Albuquerque NM
Richard Ankney - Chantilly VA
Peter C. Freund - New York NY
Marcel M. Yung - New York NY
David W. Kravitz - Albuquerque NM

Certco, LLC - New York NY

H04L 900

380 25

A method of unwrapping wrapped digital data that is unusable while wrapped, includes obtaining an acceptance phrase from a user; deriving a cryptographic key from the acceptance phrase; and unwrapping the package of digital data using the derived cryptographic key. The acceptance phrase is a phrase entered by a user in response to information provided to the user. The information and the acceptance phrase can be in any appropriate language. The digital data includes, alone or in combination, any of: software, a cryptographic key, an identifying certificate, an authorizing certificate, a data element or field of an identifying or authorizing certificate, a data file representing an images, data representing text, numbers, audio, and video.

2023004, Feb 16, 2023

Oct 25, 2022

17/973430

- Singapore, SG
David KRAVITZ - Cambridge MA, US

G06F 9/30

Examples of a carry chain for performing an operation on operands each including elements of a selectable size is provided. Advantageously, the carry chain adapts to elements of different sizes. The carry chain determines a mask based on a selected size of an element. The carry chain selects, based on the mask, whether to carry a partial result of an operation performed on corresponding first portions of a first operand and a second operand into a next operation. The next operation is performed on corresponding second portions of the first operand and the second operand, and, based on the selection, the partial result of the operation. The carry chain stores, in a memory, a result formed from outputs of the operation and the next operation.

2021002, Jan 28, 2021

Oct 13, 2020

17/069721

- Singapore, SG
David KRAVITZ - Cambridge MA, US

G06F 9/30

Examples of a carry chain for performing an operation on operands each including elements of a selectable size is provided. Advantageously, the carry chain adapts to elements of different sizes. The carry chain determines a mask based on a selected size of an element. The carry chain selects, based on the mask, whether to carry a partial result of an operation performed on corresponding first portions of a first operand and a second operand into a next operation. The next operation is performed on corresponding second portions of the first operand and the second operand, and, based on the selection, the partial result of the operation. The carry chain stores, in a memory, a result formed from outputs of the operation and the next operation.

2019022, Jul 25, 2019

Jan 25, 2018

15/880188

- San Jose CA, US
Richard Eugene KESSLER - Northborough MA, US
David KRAVITZ - Cambridge MA, US
Edward MCLELLAN - Holliston MA, US
Rabin SUGUMAR - Sunnyvale CA, US

G06F 9/38
G06F 9/30

Instructions are executed in a pipeline of a processor, where each instruction is associated with a particular context. A first storage stores branch prediction information characterizing results of branch instructions previously executed. The first storage is dynamically partitioned into partitions of one or more entries. Dynamically partitioning includes updating a partition to include an additional entry by associating the additional entry with a particular subset of one or more contexts. A predicted branch result is determined based on at least a portion of the branch prediction information. An actual branch result provided based on an executed branch instruction is used to update the branch prediction information. Providing a predicted branch result for a first branch instruction includes retrieving a first entry from a first partition based at least in part on an identified first subset of one or more contexts associated with the first branch instruction.

2019022, Jul 25, 2019

Jan 25, 2018

15/880219

- San Jose CA, US
David Kravitz - Cambridge MA, US
Edward J. McLellan - Holliston MA, US

G06F 9/38
G06F 9/30

Instructions are executed in a pipeline. Storage accessible to the pipeline stores branch prediction information characterizing results of branch instructions previously executed. A predicted branch result is provided, for at least some branch instructions, based on a selected predictor of multiple predictors. An actual branch result is provided based on an executed branch instruction, and the branch prediction information is updated based on the actual branch result. The predictors include: a first predictor that determines the predicted branch result based on at least a portion of the branch prediction information; and a second predictor that determines the predicted branch result independently from the branch prediction information.