Abstract:
A method for gracefully extending the range and/or capacity of voice communication systems is disclosed. The method involves the persistent storage of voice media on a communication device. When the usable bit rate on the network is poor and below that necessary for conducting a live conversation, voice media is transmitted and received by the communication device at the available usable bit rate on the network. Although latency may be introduced, the persistent storage of both transmitted and received media of a conversation provides the ability to extend the useful range of wireless networks beyond what is required for live conversations. In addition, the capacity and robustness in not being affected by external interferences for both wired and wireless communications is improved.
Abstract:
Disclosed is a mobile network system based on ad hoc on-demand distance vector (AODV) routing algorithm, including: a destination node: a source node for transmitting a data packet to the destination node by following a communication path; and a mobile node for receiving the data packet from a plurality of intermediate nodes located on the communication path, checking hop count numbers for the plurality of intermediate nodes, and establishing a communication path with a first node having a least number of hops and a second node having a most number of hops. Therefore, an optimum changeable communication path is searched in consideration of mobility of the mobile node. In result, communication speed is increased and the lifespan of the network is extended.
Abstract:
The present invention relates to a data collection system and a data collection method in a sensor network, enabling sensor modules to consume lower amounts of power. The base station transmits data collection request signals to one or more sensor modules which are lower than the base station by 1 in a tree structure. Each sensor module which has received the data collection request signal transfers the signal to one or more sensor modules which are lower than the module by 1. The base station regards the transfer of the signal as ACK for the data collection request signal transmitted therefrom to the sensor module which is lower than the base station by 1. The transmission of a data collection acknowledgement signal starts from a sensor module at the low-order end. When a sensor module receives the data collection acknowledgement signal from a downstream sensor module which is lower than the module by 1, the module transmits the signal to an upstream sensor module which is higher than the module by 1. The downstream sensor module regards the transmission of the signal as ACK for the data collection acknowledgement signal transmitted therefrom, and enters standby mode. In this manner, the sensor modules enter standby mode in sequence starting from the sensor module at the low-order end. Thereby, it is possible to achieve reductions in the frequency of signal transmission while maintaining reliable data communication. Thus, each module consumes lower amounts of power.
Abstract:
The invention relates to a method of estimating a noise and interference covariance matrix and to a receiver. The method comprises: estimating an initial noise and interference covariance matrix on the basis of a received signal; reducing the impact of the background noise of the receiver from the initial noise and interference covariance matrix for obtaining a residual matrix; accepting the obtained residual matrix when the residual matrix is at least approximately positive semidefinite; modifying the obtained residual matrix such that the positive semidefinity of the residual matrix is achieved when the residual matrix is not at least approximately positive semidefinite; and adding the impact of background noise back to the residual matrix for estimating a final noise and interference covariance matrix.
Abstract:
Error-correcting code theory is utilized in a video signal interframe coding system which requires no transmitter frame memory. In the transmitter, each of a plurality of n-bit words representing respective portions of the current frame is transformed into the corresponding k-bit syndrome of a selected (n,k) error-correcting code. As the syndrome of each word is received at the receiver, the corresponding word from the previous frame is read out of a receiver frame memory and its syndrome is formed. The received and formed syndromes are subtracted from one another and passed through an error-correcting code decoder. The previous-frame word is added to the decoder output, yielding the current-frame n-bit word.
Abstract:
A system for reducing the time for repeating erroneous signals through a series of interconnected ARQ-circuits (automatic error correction circuits), in which the durations of the repetition cycles of the ARQ-circuits, as compared to one another, are not equal. The system comprises means at a connection point and capable of storing a number of signals related to each propagation time of a circuit located before the connection point, when a circuit located behind the connection point goes through a repetition procedure including means for generating a special signal to indicate when a repetition procedure is in process in one of said ARQ interconnected circuits to prevent the other interconnected ARQ circuits from also going through their repetition procedures.
Abstract:
In information handling systems, syndrome and correction codes adapted for error signalling and correcting operations are obtained by processing words each made of a definite number of bytes, each byte having a same number of bits and one of the bytes being comprised of the parity incoming bits of the other bytes. An error syndrome and correction code forming device is described which comprises first and second stages of modulo-2 adders (i.e. exclusive-OR circuits), the number of adders in the second stage being equal to the number of bits in the required code, wherein the adders of the first stage form the parity check bits of the bytes and further bits from selective combinations of bits in the word and wherein the bits outputting the adders of the first stage are distributed, together with further bits of the word, to the inputs of the adders of the second stage. Substantially all the adders of the first stage have at least as many inputs as there are information bytes in the word to be processed and substantially all the outputs of said first stage adders are applied to inputs of at least two adders of the second stage.
Abstract:
A system for monitoring the transmission of a digital code is disclosed wherein a block consisting of a predetermined number of bits is extracted at a predetermined cycle from an information pulse train before the bit rate conversion thereof so that a check code corresponding to the states of this block may be formed, and inserted into the time slots formed by the bit rate conversion of the information pulse train, and the check code with the information pulse train after bit rate conversion, is transmitted to a receiving equipment. In the receiving equipment, a check code is formed from the received information pulse train, whose bit rate is restored to its original rate, in a manner exactly similar to that used in the transmitting equipment and is compared with the transmitted check code, that is, the check code is extracted from the received pulse train. Therefore, the whole transmission system including the channel before a bit rate converter in the transmitting equipment and the channel after a bit rate converter in the receiving equipment may be monitored.
Abstract:
An alphanumeric terminal providing a digital message having a fixed portion consisting of the address of the receiver in sixteen bits, followed by a repeat of the address in sixteen bits, a status indication in four bits, a request in four bits and an acknowledge plus an indication of whether text follows in two bits; and a variable portion consisting of a text message of zero to 384 bits, which fixed and variable portions of the message have parity bits inserted after each digital word and are delayed and interleaved (every other bit) with a similar undelayed message to form a composite message, which composite message is preceded by a pseudo random code of 127 bits. The terminal also includes noise and error detection circuitry, associated with the receiver, which separates the two interleaved messages and compares them for similarity, checks the parity bits for correctness and compares the amplitude of each bit to a predetermined upper and lower level to determine whether the bit is noise or a portion of the signal. From the various noise and error checks the terminal then provides a decision as to whether a digital word is good or bad and, if the digital word is in error and comes within the text portion of the message, an asterisk appears in the visual display so that the operator can mentally determine what the character should be.
Abstract:
An error correction and detection circuit includes a modular encoder that provides the minimum number of check bits for encoding a particular number of data bits. Means is provided for combining several units to produce the minimum number of code bits when a larger data word is to be encoded. A storage hierarchy system using this error correction circuit is also disclosed.