Abstract: A method for specifying and synthesizing a synchronous digital circuit by first accepting a specification of an asynchronous system in which stored values are updated according to a set of state transition rules. For instance, the state transition rules are specified as a Term Rewriting System (TRS) in which each rule specifies a number of allowable state transitions, and includes a logical precondition on the stored values and a functional specification of the stored values after a state transition in terms of the stored values prior to the state transition. The specification of the asynchronous circuit is converted into a specification of a synchronous circuit in which a number of state transitions can occur during each clock period.

Abstract: Streams of data including explicit synchronization patterns (such as entire T1/E1) are transmitted utilizing an unstructured data format, while streams not containing explicit synchronization patterns (such as fractional T1/E1) are sent utilizing a structured data format, i.e., the data structure itself provides for circuit alignment at the receiving end. In addition, SDH VC-12 frames are transmitted over the IP network by encapsulating the entire frame (payload and overhead) into an RTP packet. Furthermore, the clock is reconstructed (clock recovery) from the packet stream at the receiver's side.

Abstract: A packet scheduling apparatus made it possible to always hold priority orders determined in advance for preferentially controlled priority queues while guaranteeing reserved bandwidths for bandwidth guaranteed queues. This packet scheduling apparatus is configured by a service time computing unit for computing service times for bandwidth guaranteed queues and priority queues having high priority orders based on input plurality of predetermined parameters, a service time comparing unit for comparing magnitudes of the computed service times with each other and selecting the packet to be output first, and a parameter generating unit for generating the parameters computed so as to achieve both a bandwidth guarantee and preferential control.

Abstract: Transmission resource allocation by a central station (ZE) for control of data flow of terminals (T1, T2, . . . ) of a centrally controlled communication system is performed in the terminals (T1, T2, . . . ). A concerned terminal (T1, T2, . . . ) independently decides whether it might only need reduced transmission resource capacity. The decision regarding this reduction in needed transmission capacity is transmitted to the central station, so that it can distribute the unneeded transmission capacity to the remaining terminals.

Abstract: The transmission apparatus according to the present invention includes a switching device that switches the multiplexing destination of mask symbols and uses this switching device to switch the multiplexing destination of the mask symbols so that the mask symbols multiplexed with control channel signals transmitted in parallel from a plurality of antennas may be transmitted from only one antenna at each transmission timing.

Abstract: Content body and B-HTTP elements are broadcast to a user's system (20) by messages inserted into the vertical blanking intervals of a television signal. At the user's system, the messages are stored on the hard disk, and the messages are retrieved by using the information in the effective period start time element, which is one of the elements (S102). The browser (47) displays on the screen (47a) the content body among the messages (S107).

Abstract: A technique is disclosed for facilitating communications between a network node and a Head End of an access network. The access network includes a plurality of nodes which communicate with the Head End via at least one upstream channel and at least one downstream channel. The Head End is configured to monitor channel conditions on selected channels of the access network. The Head End is also configured to modify or change the modulation profile used on a selected channel in response to detecting a change in conditions on that particular channel. If the Head End detects that the channel conditions have deteriorated, the Head End may change the modulation profile on the selected channel to one which is better suited for transmitting data on the channel given the current channel conditions. If the Head End detects that the channel conditions have improved, the Head End may change the modulation profile on the selected channel to one which provides for faster data transmission on the selected channel.

Abstract: A mobile node moves from a first IP (Internet Protocol) network to a second IP network in a network system in which the first IP network capable of executing communication in accordance with both first and second kinds of IPs and the second IP network capable of executing communication in accordance with only the first kind of IP are connected with each other. When the mobile node communicates a message with other nodes on the first network after its movement accordance with the second kind of IP, a header for the movement containing both home and foreign addresses of the first kind in IP is added to a header containing home and foreign addresses in the second kind of IP, and put to the message, is added. The message to which the movement header is thus added is used for the communication between a first mobile agent on the first network and a second mobile agent on the second network, or between the mobile node and the first mobile agent.

Abstract: The invention relates to a communication system which operates in the asynchronous transfer mode (ATM) and which comprises several nodes which form a network and are partly coupled to one another and to terminals, and which each comprise a switch and a control software at least for controlling the relevant coupling field and for the signaling. At least one object of the control software contains detection points in certain states. An object for event handling of the control software is provided for further processing when a detection point is reached. The object for event handling receives data via a special channel from at least one terminal or from another node.

Abstract: A communication connecting device includes a data storage to which data read by a scanner are written. A packetizer packetizes the data read out of the data storage in accordance with a packet size fed from a size information storage. A rate controller counts a period of time after the start of packet transmission or a period of time consumed to send a preselected number of packets. The rate controller calculates a communication rate on the basis of the above period of time and the number of packets sent, and then compares the communication rate with a communication rate assigned to a receiving terminal and defined by a Recommendation T.30 protocol. The rate controller allows the packets to be sent only if the calculated communication rate is lower than the communication rate of the receiving terminal.

Abstract: A method provides for utilizing a packet-switched network to support services provisioned to mobile station subscribers. Address information is exchanged with a mobile switching center that services the subscriber so as to be able to identify data port addresses to be utilized to support the services via transmissions over a packet-switched network.

Abstract: A network switch port includes a port filter configured to receive at least a portion of a data frame including layer 3 information and to generate a tag result. A queue block is configured for transferring the data frame to a buffer memory. A switch fabric is configured for receiving the tag result and for performing a frame forwarding switching decision based on the tag result and monitoring of the transfer of the data frame. A synchronizing device is configured to synchronize the transfer of a valid tag result to the switch fabric with the transfer of the at least a portion of the data frame to the buffer memory based on a signal from the queue indicating a status of the transfer of the portion of the data frame to the buffer memory.

Abstract: A combined signal is received over a shared spectrum in a time slot in a time division duplex communication system using code division multiple access. Each data signal experiences a similar channel response. The similar channel response is estimated. A matrix representing a channel of the data signals based on in part the estimated channel response is constructed. A spread data vector is determined based on in part a fast fourier transform (FFT) decomposition of a circulant version of the channel matrix. The spread data vector is despread to recover data from the received combined signal.

Abstract: A delay measurement technique according to an embodiment according to the present invention is based on the precept, ascertained by the inventors, that a link between network nodes will often contribute to the delay encountered between several different pairs of network nodes. Such a technique identifies the path between each pair of nodes by a list of links that form the path. Paths that are orthogonal are treated as being necessary for describing the delays encountered between nodes, and, once the requisite set of orthogonal paths has been derived, all other paths can be described in terms of one or more of these orthogonal paths. Such a technique also lends itself to matrix representation of the paths, and the use of matrix manipulation techniques in deriving delay and jitter.

Abstract: A host channel adapter configured for outputting packets according to InfiniBand™ protocol includes a queue pair attributes table having queue pair entries configured for specifying attributes of the respective queue pairs. Each queue pair entry includes a timestamp field for storing a time value. Upon teardown of a queue pair, a management agent stores a timestamp value, according to a prescribed time resolution interval, within the timestamp field and sets a corresponding wait state bit. The queue pair attributes table is accessed each prescribed time resolution interval for identification of idle queue pairs having passed a minimum idle interval at least equal to the prescribed time resolution interval. If an identified idle queue pair has a corresponding timestamp value indicating passing of the minimum time idle interval, the corresponding wait state bit is reset enabling the queue pair to be reused.

Abstract: Modifications to the spanning tree algorithm allow bad news to propagate quickly by providing that protocol entities on bridges process inferior information sent by the designated bridge for each LAN. In addition, bridges use per port hello timers to stimulate information propagation, setting it to suit local link characteristics. No changes to the format of bridge protocol data units (BPDUs) as specified in the IEEE Standard 802.1D are required, and the algorithm for computing the topology of the network remains unchanged. Techniques have been adopted for expiring information and recomputing the spanning tree upon detection of link failure, upon receipt of a message having a message age greater than its accompanying maximum age, or if the port hello time algorithm detects a loss of link. Rules for propagating information are provided allowing rapid propagation of changes. Finally, techniques for burning out information in a configuration message are adopted.

Abstract: A communication device wherein path selection is performed taking account of the conditions of individual paths on a network. Storing means stores information relating to a plurality of paths, and selecting means selects the information relating to one of the paths stored in the storing means. Packet generating means generates a packet with a header matching the information relating to the path selected by the selecting means, and transmitting means transmits the packet generated by the packet generating means.

Abstract: An apparatus and method for encoding/decoding a transport format combination indicator (TFCI) in a CDMA mobile communication system. In the TFCI encoding apparatus, a one-bit generator generates a sequence having the same symbols. A basis orthogonal sequence generator generates a plurality of basis orthogonal sequences. A basis mask sequence generator generates a plurality of basis mask sequences.

Abstract: A time division duplex using code division multiple access user equipment receives a plurality of data signals in a time slot. Each data signal experiences a similar channel response. The user equipment receives a combined signal over the shared spectrum in a time slot. The combined signal comprises the plurality of data signals. The combined signal is sampled at a multiple of a chip rate of the combined signal. The similar channel response is estimated. A channel response matrix or a channel correlation matrix is constructed based on in part the estimated channel response. A spread data vector is determined based on in part a fast fourier transform (FFT) decomposition of a circulant version of the channel response or channel correlation matrix. The spread data vector is despread to recover data from the matrix.

Abstract: An audio conferencing method in a hybrid network. Input from a plurality of endpoints connected to an audio conference in the hybrid network is received in a media gateway. The media gateway converts the input to an MCU-usable format and selects input based on predetermined selection criteria. An MCU mixes the selected input with other selected input to form an output stream and a sum stream which are matched with the endpoints in the audio conference. The media gateway converts the output stream and the sum stream to an endpoint-compatible format which is returned to the endpoints in the audio conference. Audio conference participants can dial-out from the MCU to bring additional participants into the audio conference. Once established in the hybrid network, the audio conference supports full service audio conferencing. In addition, dynamic routing permits an operator to service multiple MCUs, and an audio conference participant and/or an entire audio conference to be moved between MCUs.