Abstract: A communication circuit for verified communication comprising a transmitter having input terminals to receive a data word, an encoder configured to encode the data word to create an encoded word different from the data word, and output terminals configured to transmit the data word and the encoded word. A receiver is coupled to the transmitter and includes input terminals to receive the data word as a received word and the encoded word, a decoder configured to decode the encoded word to create a decoded word, and a comparator configured to compare the received word and the decoded word to create a select signal, and a selector responsive to the select signal and configured to select the received data word or the decoded word based at least in part on the select signal. Advantages of the invention include the ability to verify redundant received data without decreasing bandwidth or increasing latency.

Abstract: A method of encoding a transmission signal to reduce multiple access interference at a receiver. A data source signal including a plurality of source symbols is received into a transmitter. The source symbols are encoded using low energy encoding forming encoded codewords. An identifying pattern is applied to the encoded codewords forming a transmission signal. In one embodiment, the identifying pattern is a unique pseudo-random pattern identifying the data source. Once the pattern has been added, multiple transmission signals can be summed together and then modulated onto a carrier wave. The transmission signals are then transmitted on the carrier wave which is at a pre-selected frequency. The low energy encoding format is such that a sequence of signals forming codewords is created. Each sequence of signals is characterized by an energy and normally a high bit consumes energy whereas a low bit requires substantially less energy.

Abstract: The invention features a method and system for identifying a plurality of tags using an efficient memoryless protocol. The system includes a reader and a plurality of tags. The reader is adapted to maintain an ordered set of query strings; select a string from the set of query strings; broadcast a query message containing the selected string or a portion of the selected string to the tags; and receive a response from one of the tags. The tags operate without batteries and are adapted to respond to the selected string broadcast by the reader. Accordingly, the tag identification methods are efficient in terms of both time and communication complexities.

Abstract: This invention is an algorithm that restores routing in a link-state network after a link failure without flooding the entire routing area with new routing information. The algorithm operates only in the local neighborhood of the failed link and informs the minimum number of routers about the failure.

Abstract: A dynamic shortest path tree (SPT) algorithm for a router determines a new SPT for a root node in response to a link-state or other network topology change. The dynamic SPT algorithm determines the new SPT as an optimization problem in a linear programming framework based in an existing SPT in the router. The dynamic SPT algorithm emulates maximum decrement of a ball and string model by iteratively selecting nodes of the existing SPT for consideration and update of parent node, child nodes, and distance attributes based on the maximum decrement. For the maximum decrement, a node in the existing SPT is selected by each iteration based on the greatest potential decrease (or least increase) in its distance attribute. The ball and string model that may be employed for the dynamic SPT algorithm represents a network of nodes and links with a ball representing a node and a string representing a link or edge. The length of a string is defined by its link's weight.

Abstract: A method of encoding a transmission signal to reduce multiple access interference at a receiver. A data source signal including a plurality of source symbols is received into a transmitter. The source symbols are encoded using low energy encoding forming encoded codewords. An identifying pattern is applied to the encoded codewords forming a transmission signal. In one embodiment, the identifying pattern is a unique pseudo-random pattern identifying the data source. Once the pattern has been added, multiple transmission signals can be summed together and then modulated onto a carrier wave. The transmission signals are then transmitted on the carrier wave which is at a pre-selected frequency. The low energy encoding format is such that a sequence of signals forming codewords is created. Each sequence of signals is characterized by an energy and normally a high bit consumes energy whereas a low bit requires substantially less energy.

Abstract: A method and apparatus for telemetering data on a channel having a maximum data rate by utilizing a power efficient communication protocol is provided. The data to be telemetered comprises a number of source symbols where each source symbol is characterized by a probability of occurrence. A sequence of signals forming codewords having an energy and a length is produced. The length for the codewords is based at least on the number of symbols to be coded. Each codeword signifies a specified source symbol on the basis of a mapping between source symbols and codewords. The mapping is such that each source symbol of lower probability of occurrence is associated with a codeword of at least equal energy.

Abstract: A novel data structure in a router helps to compute viable next hops for forwarding a data packet from a router to its destination along multiple alternate loop-free paths, which are not necessarily of shortest distance. Each viable next hop may also be specified with a degree of optimality, which enables a route to perform QoS routing and fault-tolerant routing efficiently. The data structure can be implemented as an add-on software to existing routing protocols and may be implemented in existing networks which use shortest path protocols, even where less than all of the routers use the data structure and multiple path scheme described herein.