Abstract: A method of organizing, managing, and providing interactive access to data in a database is disclosed, along with a program and a system for implementing the method. Associations between each data Item and at least one ItemSelector are established and stored. A predefined (but modifiable) Vocabulary of ItemSelectors sufficient to describe each Item of the database is created. Presently selected Items are described by a combination of associations defined by an appropriate Boolean combination of each ItemSelector in a presently selected set of ItemSelectors. A user controls the presently selected set by adding an ItemSelector from a presented group, or by removing a previously selected ItemSelector. The system ideally makes available to the user all relevant ItemSelectors—those which, if added to the presently selected set, would result in a set that describes at least one extant data Item. The system ideally makes all presently selected Items available to the user.
Abstract: A method and apparatus for a self-correcting bandwidth request/grant protocol in a broadband wireless communication system is disclosed. The self-correcting bandwidth request/grant protocol utilizes a combination of incremental and aggregate bandwidth requests. In accordance with the present inventive protocol, CPEs primarily transmit incremental bandwidth requests to their associated base stations, followed by periodic transmissions of aggregate bandwidth requests. The use of incremental bandwidth requests reduces risks that a base station erroneously issues duplicate bandwidth allocations to the same CPE for the same connection. Race conditions that may have occurred using only aggregate bandwidth requests are eliminated by requiring the CPEs to request bandwidth in an incremental manner. However, use of periodic aggregate bandwidth requests (that express the current state of their respective connection queues) allows the present bandwidth allocation method and apparatus to be “self-correcting”.
Type:
Grant
Filed:
July 11, 2000
Date of Patent:
August 31, 2004
Assignee:
Ensemble Communications, Inc.
Inventors:
Ofer Zimmerman, Kenneth L. Stanwood, Brian Spinar, Yair Bourlas, Amir Serok
Abstract: A novel dynamic DFF method and apparatus using CMOS is disclosed. The present invention does not use ratioed logic transistors in implementing a first stage of the DFF design. Thus, PMOS and NMOS transistors, used in the first stage of the DFF circuit, do not have severely disproportionate P-to-N transistor size ratios. These transistors therefore can have a transistor size ratio that increases the circuit's operating speeds.
Abstract: The present invention is a method and apparatus for reducing co-channel interference. The present invention includes a powerful means for eliminating co-channel interference from base stations in a wireless communication system. The present co-channel interference reducing method and apparatus utilizes frame synchronization between selected time frames (e.g., odd and even time frames) to reduce co-channel interference. Advantageously, the present invention reduces co-channel interference and, thus, allows robust modulation schemes to operate even at worst case line-of-sight (LoS) interference scenarios of 100%. The present invention can also use an uplink/downlink ratio formula to further improve system capacity (i.e., reduce co-channel interference) in ATDD systems. The present inventive method and apparatus can be used in any type of frame based and frame synchronized communication system.
Type:
Grant
Filed:
March 31, 2000
Date of Patent:
March 16, 2004
Assignee:
Ensemble Communications
Inventors:
Israel Jay Klein, Sheldon L. Gilbert, Rami Hadar
Abstract: In the field of computer text search engines, regular expression text pattern matching is combined with an extended set of Boolean operators. A pre-processor is described which will convert mixed Boolean-GREP expressions into equivalent pure GREP expressions enabling existing GREP search technology to be used to implement this invention. Additional optimizations are described when users need to search for any one of a list of text patterns.