Abstract: To eliminate the acoustic nuisance caused by a ringing of a mobile telephone (1) in a limited geographical zone (7), a device (8) for the transmission of a signal (9) is placed in this zone (7). The decoy signal (9) is obtained by identifying the radioelectric synchronization signal (10), received by a receiver (11), that is the most powerful signal transmitted in this zone (7) and by producing a replica of this synchronization signal (10). This replica is amplified and desynchronized with respect to the received signal (10). Thus a mobile telephone (1) present in this zone (7) considers this decoy signal (9) to be the most powerful one and will therefore get connected with the dummy transmitter (12) that transmits this dummy signal (9). Thus, the production of acoustic nuisance in this zone (7) is avoided.

Abstract: A television or other signal is received via main and duplicate feeds into respective buffers. Should the main feed suffer interruption or disturbance the output is switched at a switch over to the duplicate feed, but in a staged process. Upon initial detection of disturbances read-out from the main buffer is performed using locally generated timing signals in lieu of timing signals obtained from the incoming signal. If however the disturbance s persist the two buffers are synchronized and switchover performed.

Abstract: A rate adjustable backplane includes a set of switch slots configured to receive one or more switch cards forming a switch core and a plurality of line slots each configured to receive a line card. A low speed bus couples the line slots to the set of switch slots. A high speed bus also couples the line slots to the set of switch slots. Each line slot includes a low speed connector coupled to the low speed bus and a high speed connector coupled to the high speed bus. The low speed connector is adapted to receive a mating connector of a line card to establish a low speed communication connection between the line card and the switch core. The high speed connector is adapted to receive a mating connector of the line card to establish a high speed link between the line card and the switch core.

Abstract: A method and system for enforcing a transmission control parameter for a virtual connection comprising multiple cells within an input port. The virtual connection has a nominal inter-cell arrival rate increment. Each of the cells are associated with a theoretical arrival time and an early arrival limit, wherein a difference of the early arrival limit from said theoretical arrival time delineates a lower boundary of a good zone, while the theoretical arrival time minus the sum of the early arrival limit and the nominal inter-cell arrival rate increment delineates an upper boundary of the good zone. The method includes determining an actual arrival time for an incoming cell from the cells that make up the virtual connection. Next, the actual arrival time is compared to the upper boundary and the lower boundary to determine whether or not the actual arrival time falls within the good zone.

Abstract: An improved data access arrangement device for use in full-duplex two-wire communication systems having a transmission impedance characteristic. The DAA includes a transmit amplifier and a receive amplifier adapted for connection to a two-wire line, a codec connected to the transmit amplifier for generating a transmit signal, a summation device connected to the receive amplifier, an echo cancellation path including a variable gain amplifier, where the path extends between the codec and the summation device, and wherein the variable gain amplifier is adjusted in accordance with the transmission impedance characteristic. The variable gain amplifier may include a gain register that is programmed by a microprocessor, or may have the gain set by user-configurable switches. The summation device is preferably an operational amplifier.

Abstract: A system and method for establishing a network within a plurality of interconnected and randomly geographically located nodes, such as wireless devices. One or more cluster heads are selected within the nodes and selectively communicate with the other cluster heads and nodes. The cluster head can be a wireless device or a specific dedicated device such as a router. Each cluster head determines the geographical location of that cluster head and the data-dependent nodes of the cluster head, and selectively receives and stores location information of the other cluster heads and dependent nodes to create an optimal data-routing network within the plurality of nodes.

Abstract: A mechanism for path provisioning between an origin node (O) and a destination node (D) over BLSR networks. All ring pairs including O and D are examined and a communications path is calculated for each valid ring sequence. The calculated path is compared with the current best path until an optimal path is found. Significantly improved run-time is obtained using ring sequence reduction (RS-R) and path construction reduction (PC-R) while the quality solution set is maintained. A path provisioning tool calculates the optimal path and a Pareto curve for the BLSR network. The optimal path displays inter-ring connection configurations, the signal flows, and associated data like cost and unavailability. The Pareto curve allows various levels of assured availability to be provided while keeping the cost to a minimum.

Abstract: The invention intends to transmit audio signals of multiple channels in such a manner as to be able to decode and reproduce them in real time on the receiving side. Digital signals of multiple channels are each divided into one or more fragments in an audio signal input circuit, and the fragments of multiple channels are each encoded into coded fragment data by an encoder of the corresponding channel. At the time when transmission of one of the coded fragment data is ended, a multiplexer selects another of the coded fragment data of multiple channels to be next transmitted, and supplies it to a transmitting circuit.

Abstract: By appropriate arrangement of two sets of tables chosen to be complementary, cells which are conveyed through a first multiplexor, n RAM storages and the second are subject to a cell rearrange-ment enabling introduction of at least one bitmap field, thereby producing the n Logical Units. When two bytes which are processed in parallel have to be loaded at the same time in the same RAM storage, one particular byte is stored into one RAM available for a Write operation by use of the first set of tables, thereby causing an alteration to the normal association between the n RAMs and the n Logical Units which is then re-established by the second set of tables.

Abstract: A method and system are disclosed for allocating data input bandwidth from a source link to a plurality of N data queues each having a variable occupancy value, Qi(t), and a constant decrement rate, Di, where i designated the ith queue among the N queues. First, a threshold occupancy value, T, is designated for the N queues. During each time step of a repeating time interval, &Dgr;t, the occupancy value, Qi, is compared with T. In response to each and every of said N data queues having occupancy values exceeding T, pausing data transmission from the source link to the N data queues, such that overflow within the data queues is minimized. In response to at least one of the N data queues having an occupancy value less than or equal to T, selecting one among the N data queues to be incremented, and incrementing the selected data queue, such that underflow of the selected queue is minimized. In the context of scheduling one cell per time step, the value of T is one.

Abstract: A method of determining an optimal path from a source node to a destination node over a number of links in an information network having n nodes. Each link has an associated cost-delay function, the optimal path is constrained to an overall delay of D, and a total cost of all links along the path is to be minimized at a value OPT. The method includes maintaining a range [L, U] for OPT, wherein L is a lower bound and U is an upper bound, and setting initial values for L and U. A cost value V is set corresponding to {square root over (U·L)}, and a scaled cost c′ is derived for each link wherein c′ corresponds to cn/V&egr;, c is an actual cost for each link, and &egr;>0. If a feasible path having a delay of at most D and a total cost of at most V is found not to exist, then the value of L is increased to V, a new cost value V is set and the link costs c′ are further scaled. The values of L and U are reset until U/L<2 and a feasible path continues to exist.

Abstract: A CDMA radiocommunication signals receiver for receiving signals obtained from spectrum symbols spread using pseudo-random sequences and having been propagated along a number of paths. The receiver includes a filter configured to restore L unspread signals for each symbol, corresponding to L different paths, a calculating circuit configured to calculate L estimates of the L different paths, and a demodulator configured to process each of the L unspread signals using the corresponding L estimates to obtain L path contributions. Also included is an adder configured to form a sum of the L path contributions and for outputting an estimate of a received symbol, and a decision circuit configured to make a decision about a value of the received symbol based on a value of the estimate of the received symbol output by the adder.

Abstract: A method for deep paging in a communication system employing orthogonal channelizing codes, such as Walsh sequences, of predetermined length m, that does not require a high powered paging channel. The method includes the steps of generating a paging channel message which is combined with a Walsh sequence having a length greater than or equal to 2m, and transmitting the paging channel message at a data rate of less than 4800 bits per second (bps). By transmitting the paging channel message at a low data rate and integrating collected energy over a period longer by a factor on the order of 1000, the message is able to penetrate buildings and other structures or high attenuation environments, thereby allowing one to successfully page a user terminal that is inside such a structure or area. Preferably, the paging channel message is formed using an auxiliary Walsh sequence on the order of 65536 chips in length, and the data rate is less than 10 bps.

Abstract: A Switch Fabric system comprising at least one Switch Fabric subsystem (100, 200) further including a set of Switch cores elements (111, 112, 121, 122) that are mounted in a port expansion permitting attachment of at least a first and second sets of Protocol Adapters (1, 2) under a routing control process. A Primary Switch controller (PSC) has a complete knowledge of the topology of the switch, e.g., the number of subsystems, the nature of the port expansion etc., while each Secondary Switch Controller only has a limited knowledge of that topology. One particular Switch Core (111, 211) which has a full-duplex communication capability in each Subsystem is assigned the key function to interface communication between the PSC and the other SSC in a same Switch Fabric Subsystem.

Abstract: A network device which is for use in an Ethernet packet-based communication system has at least one port which is capable of auto-negotiation to select between half duplex and full duplex working on a link to which the port is connected. The device includes means for monitoring the existence of late collisions between packets on said link, means for monitoring the existence of packet fragments on the link, and monitoring means for detecting and correcting for a duplex mismatch on the link partner. This monitoring means is operative to determine whether there are any late collisions and in the absence of a detection of fragments to configure the port from a half duplex mode to a full duplex mode. The monitoring means is also operative to detect the presence of fragments when the port is in full duplex mode and thereby to provide an indication that a rule relating to network size is infringed.

Abstract: A trunk carries out mutual exchange of voice data and MAC frames used in a public telephone circuit. A SLIC carries out mutual exchange of voice data and MAC frames used by PBX telephone devices. Internet protocol telephone devices conduct communications using MAC frames. A LAN switch houses a trunk, SLIC, and Internet protocol telephone devices, and switches ports in accordance with the destination address contained in a MAC frame. A main CPU executes communications protocols for call origination processing, call reception processing and disconnection processing, by communicating with the trunk, SLIC and Internet protocol telephone device.

Abstract: A data framer capable of supporting at least two different data framing protocols potentially present in a source data stream includes two or more framing circuits and a controller coupled to the framing circuits. Each of the framing circuits is configured to extract user data from the source data stream in accordance with a different data framing protocol associated with the respective framing circuit. The controller is operative to: (i) receive the source data stream and automatically determine which of the at least two different data framing protocols corresponds to the source data stream; and (ii) route the source data stream to one of the first framing circuit and the second framing circuit in response to a match between the determined data framing protocol of the source data stream and one of the first and second data framing protocols.

Abstract: A system and method for optimizing placement of network equipment and information load in a network over a period of time. A demand input structure having a plurality of demands organized by their time points and MUX levels is provided as an input to a model generator and an optimization processor associated therewith. Starting with the earliest demand with the highest MUX level to be serviced by the network, a directed graph network model is obtained by using appropriate transformation techniques. A MUX modularity constraint is imposed in order to obtain a filtered network model that can support a MUX level of a selected demand at a particular time point. A cost function associated with the filtered network model is constructed using a flow cost term and an equipment cost term. Appropriate constraints are imposed on the cost function for optimization. A solution set comprising network placement information and demand routing information is obtained for a MUX level at a current time point.

Abstract: A system and method for compressing and transferring analog data in a packet-based computer network in which the times for packets to travel to the destination may vary. The analog signal is sampled at the source to produce a digital data stream. The digitized samples for repetitious sections of the signal are compressed into bytes. Repetitious sections are sections of the signal that are rising, falling, or level. Bytes of compressed data consist of a sign bit for direction of the signal, the amount of change from one signal segment to the next, and the number of samples in a segment. Sampling for the packets overlaps so that each packets contains a certain amount of redundant data. Also, predictive data is appended to each packet. Thus, if a packet is late or lost, the redundant and predictive data in adjacent packets enable the receiver to play back smooth, uninterrupted audio.

Abstract: Described is a variable rate transmission apparatus for spread modulating data signals by using spread code sequences and transmitting the processed signals. The variable rate transmission apparatus spread modulates the data signals, upon the condition that the transmission rate of each data signal is greater than or equal to a predetermined transmission rate, in a binary sequence using bi-orthogonal signals and transmits the processed signals.