Abstract: Apparatus for flexible sharing of bandwidth in switches with input buffering by dividing time into a plurality of frames of time slots, wherein each frame has a specified integer value of time slots. The apparatus includes modules where inputs sequentially select available outputs to which the inputs send packets in specified future time slots. The selection of outputs by the inputs is done using a pipeline technique and a schedule is calculated within multiple time slots.

Abstract: Enhanced performance is achieved by combining channel coding with the space-time coding principles. With K synchronized terminal units transmitting on N antennas to a base station having M?K receive antennas, increased system capacity and improved performance are attained by using a concatenated coding scheme where the inner code is a space-time block code and the outer code is a conventional channel error correcting code. Information symbols are first encoded using a conventional channel code, and the resulting signals are encoded using a space-time block code. At the receiver, the inner space-time block code is used to suppress interference from the other co-channel terminals and soft decisions are made about the transmitted symbols. The channel decoding that follows makes the hard decisions about the transmitted symbols. Increased data rate is achieved by, effectively, splitting the incoming data rate into multiple channels, and each channel is transmitted over its own terminal.

Abstract: An apparatus for obtaining and displaying call progress information of a telephone call on the monitor of the television, including means for communicating control signals that flow in either direction between the apparatus and a set top box that controls the television.

Abstract: A browser add-on toolbar that offers users to collect toolbars from visited webpages that offer such toolbars and which, later, the user may select any one of the collected toolbars to become the current toolbar that the browser provides to the user. These abilities are imparted by having the toolbar be sensitive to one or more particular flags in visited pages. When a browser that contains this toolbar visits a website, the browser parses and searches the visited website page for presence of one or more of the particular flags, and when such a flag is found, the user is given a visual indication of the find and is given the choice to include within the browser's toolbar the ability to instantiate a toolbar based on information associated with the flag.

Abstract: A method that measures ratio, relative to a peering network, of traffic burden of incoming traffic to traffic burden of outgoing traffic, where traffic burden takes into account traffic volume and distance that the traffic traverses through the network. A determination is made from this ratio as to whether an imbalance exists with the peering network. With the assistance of a simulation of changes in routing policy and their effects, an existing or impending imbalance is remedied by changing the routing policy relative to particular customers, for example from a “hot potato” routing policy to a “best exit” routing policy.

Abstract: A switching apparatus distributes incoming calls to end point terminals that belong to a service group and that interact with the switching apparatus via messages. The messages query the end point terminals by specifying a range and asking those end point terminals that meet a criterion associated with the range to respond. By iteratively narrowing the range, for example, in a binary search fashion, one of the end point terminals is selected. In one embodiment, the range relates to fixed sequence IDs of the end point terminals and the criterion relates to whether an end point terminal is idle or not. In another embodiment, the range incorporates the idle/not idle state of the end point terminals by specifying idle time durations.

Abstract: The invention provides methods and systems for providing priority processing to critical data as the data is transmitted across a network. A plurality of Internet protocol (IP) packets, each of which contains data and priority information, are received at a first router. The data contained in the IP packets is then encapsulated into frame relay frames containing the priority information. The frame relay frames are transmitted from the first router to a frame relay network in a manner determined by the priority information included in the frame relay frames. The frame relay flames are then transmitted across a frame relay network to a second router in a manner determined by the priority information included in the frame relay frames.

Abstract: Significant improvement is achieved in the analysis of IC layout by utilizing the fact that IC designs exhibit a large amount of regularity. By employing a unique mesh generation approach that takes advantage of the regularity, combined with the use of a limited number of different shapes for the majority of the IC geometry greatly increases the speed of processing. Additionally, by employing a unique approach for specifying the different mesh elements—based on the parameters that define the relative difference between one shape and another—provides significant additional reductions in the necessary calculations, and a corresponding increase in speed of IC simulations. Yet another improvement is realized by simplifying the inductive influence calculations by employing averages that permit using dot products of vectors rather than integrations of non-constant vectors.

Abstract: Given a set of network nodes B that are sought to be monitored, and a set of potential monitoring nodes, a subset M of the monitoring nodes is chosen that insures monitoring each node b in B with a pair of nodes mi and mj such that no node except b is on both any shortest path from b to mi and on any shortest path from b to mj. Some of the nodes in M are chosen in a first step by identifying a subset of B having nodes b that are “t-good” nodes, choosing a subset of potential monitoring nodes as First Partner nodes, and choosing a corresponding subset of potential monitoring nodes as Second Partner nodes. Others are chosen in a second step that handles nodes b that are not “t-good,” using a greedy algorithm.

Abstract: A signature-based traffic classification method maps traffic into preselected classes of service (CoS). By analyzing a known corpus of data that clearly belongs to identified ones of the preselected classes of service, in a training session the method develops statistics about a chosen set of traffic features. In an analysis session, relative to traffic of the network where QoS treatments are desired (target network), the method obtains statistical information relative to the same chosen set of features for values of one or more predetermined traffic attributes that are associated with connections that are analyzed in the analysis session, yielding a statistical features signature of each of the values of the one or more attributes. A classification process then establishes a mapping between values of the one or more predetermined traffic attributes and the preselected classes of service, leading to the establishment of QoS treatment rules.

Abstract: Block-encoded transmissions of a multi-antenna terminal unit are effectively detected in the presence of co-channel interfering transmissions when the base station has a plurality of antennas, and interference cancellation is combined with maximum likelihood decoding. More specifically, the signals received at the base station antennas are combined in a linear combination that relates to the channel coefficients between the various transmitting terminal units and the base antennas. By selecting proper coefficients for the linear combination and choosing probable transmitted signals that minimize a minimum mean squared error function, the signals of the various terminal units are canceled when detecting the signal of a particular unit. In another embodiment of the invention, the basic approach is used to obtain an initial estimate of the signals transmitted by one terminal unit, and the contribution of those signals is removed from the received signals prior to detecting the signals of other terminal units.

Abstract: A base station that uses an antenna assembly and associated signal processing where the antenna assembly includes at least one directional antenna, developing information from which a determination is made regarding the direction from which a received signal is coming. By employing a plurality of such base stations the location of a transmitting tag is ascertained.

Abstract: A Multiple-Input Multiple Output (MIMO) Decision Feedback Equalizer improves operation of a receiver by canceling the spatio-temporal interference effects caused by the MIMO channel memory with a set of (Finite Impulse Response (FIR) filters in both the feed-forward and the feedback MIMO filters. The coefficients of these FIR filters can be fashioned to provide a variety of controls by the designer.

Abstract: Space-time block coding is combined with single-carrier, minimum-mean-square-error, frequency-domain equalization for wireless communication through a medium characterized by multi-paths. The transmitter encodes incoming symbols into two or more streams that are transmitted over a corresponding number of transmitting antennas. The encoding employs modulo arithmetic. Decoding in the receiver proceeds by converting received signals to frequency domain, linearly combining the signals to separate contribution of the signals from the two or more transmitting antennas equalizing the separated signals, converting the equalized signals to time domain, and applying the converted signals to a decision circuit.

Abstract: Encryption with keys that form an Abelian group are used in combination with a semi-trusted party that converts queries that are encrypted with the key of a querier to queries that are encrypted with the key of the encrypted database, without knowing the actual keys. In an illustrative embodiment, encryption is done with Bloom filters that employ Pohlig-Hellman encryption. Since the querier's key is not divulged, neither the semi-trusted party nor the publisher of the database can see the original queries. Provision can be made for fourth party “warrant servers”, as well as “censorship sets” that limit the data to be shared.

Abstract: A method that enables testing any point (target point) within a core, including a point within a combinatorial circuit of a core, permits testing of points that are not otherwise unobservable in normal debugging processes. Such a target point is tested by identifying a fanout cone from that point to observable outputs, and by performing one or more tests, where each test sensitizes one or more paths that extend the signal of the target point, or its complement, to one or more of the observable outputs, and ascertains the values at those observable outputs. By having more than one observable output at which the signal of target point (or its complement) is tested significantly increases the level of confidence in the test when the observable points concur in the signal value of the target point.

Abstract: Natural-sounding synthesized speech is obtained from pieced elemental speech units that have their super-class identities known (e.g. phoneme type), and their line spectral frequencies (LSF) set in accordance with a correlation between the desired fundamental frequency and the LSF vectors that are known for different classes in the super-class. The correlation between a fundamental frequency in a class and the corresponding LSF is obtained by, for example, analyzing the database of recorded speech of a person and, more particularly, by analyzing frames of the speech signal.

Abstract: In connection with transmitted space-time, trellis encoded, signals that pass through a transmission channel that is characterized by memory, improved performance is realized with a receiver that combines a decoder with an equalizer that selects the trellis transition, s, that minimizes the metric ? j ? ( k ) = ? r ? ( k ) - ? l = L 1 + 1 L 1 ? h ~ j ? ( l ) ? s ~ ? ( k - l ) - ? l = L 1 + 1 L + 1 ? h ~ j ? ( l ) ? s ^ ? ( k - l ) ? 2 where {tilde over (h)}j(l) is related to both the transmission channel and to the encoding structure in the transmitter, {tilde over (s)}(k) are the (trial) symbols according to a certain transition and ?(k) are the symbols that were previously decided.

Abstract: Control over the movement of packets is exercised by edge nodes of a network mapping the addresses of incoming packets in accordance with a prespecified functional mapping P. Remote sources of packets are provided address information that is mapped with a prespecified functional mapping Q, where mappings P and Q are such that P(Q(j)=j. The mapping change at regular intervals, or upon the occurrence of specified events, and with each change, the communicating the remote source is provided with a different mapped address to be used.

Abstract: Enhanced performance is achieved by combining channel coding with the space-time coding principles. With K synchronized terminal units transmitting on N antennas to a base station having M?K receive antennas, increased system capacity and improved performance are attained by using a concatenated coding scheme where the inner code is a space-time block code and the outer code is a conventional channel error correcting code. Information symbols are first encoded using a conventional channel code, and the resulting signals are encoded using a space-time block code. At the receiver, the inner space-time block code is used to suppress interference from the other co-channel terminals and soft decisions are made about the transmitted symbols. The channel decoding that follows makes the hard decisions about the transmitted symbols. Increased data rate is achieved by, effectively, splitting the incoming data rate into multiple channels, and each channel is transmitted over its own terminal.