Abstract: A network coding system. A packet decoding engine receives a number of received packets. A packet repository is coupled to the decoding engine to temporarily store the received packets. The packet decoding engine is configured to generate a decoding matrix by forming a sub-matrix by selecting columns of a network code matrix that have indices that are the same as the indices of the encoded packets that correspond to the selected received packets. The packet decoding engine is also configured to invert the sub-matrix to form the decoding matrix and multiply the received packet matrix by the decoding matrix to generate a recovered matrix where each column corresponds to a decoded packet.

Abstract: An encryption interface provides secure, low-latency communications between processors. A first processor block transforms initial data into encrypted data using a cipher for receipt by a second processor block, which transforms the encrypted data into decrypted data. The first processor block utilized a crypto circuit having a plurality of stages, each of which generate a subset of a cipher digit stream for encrypting the data. The second processor block receives and decrypts the encrypted data using a respective decryption circuit.

Abstract: A network coding system. A packet decoding engine receives a number of received packets. A packet repository is coupled to the decoding engine to temporarily store the received packets. The packet decoding engine is configured to generate a decoding matrix by forming a sub-matrix by selecting columns of a network code matrix that have indices that are the same as the indices of the encoded packets that correspond to the selected received packets. The packet decoding engine is also configured to invert the sub-matrix to form the decoding matrix and multiply the received packet matrix by the decoding matrix to generate a recovered matrix where each column corresponds to a decoded packet.

Abstract: An encryption interface provides secure, low-latency communications between processors. A first processor block transforms initial data into encrypted data using a cipher for receipt by a second processor block, which transforms the encrypted data into decrypted data. The first processor block utilized a crypto circuit having a plurality of stages, each of which generate a subset of a cipher digit stream for encrypting the data. The second processor block receives and decrypts the encrypted data using a respective decryption circuit.

Abstract: Efficient and reliable transmission of information from sparse sources over wireless channels in wireless signal networks (WSNs). WSN nodes employ an “integrated signal representation-to-modulation” scheme to describe a sparse signal acquired from a sensor so as to ensure robustness against channel errors across a wide range of signal to noise (SNR) values in a rateless fashion. In one example, sparse signal samples are linearly transformed such that the total number of bits representing the sparse signal is reduced. The linearly-transformed signal samples are directly mapped to a modulation constellation to provide a succession of modulation symbols. A carrier wave is modulated in phase and/or frequency according to the succession of the modulation symbols to generate an encoded carrier wave representing the sparse analog signal. In one aspect, an order of the modulation constellation is based on the precision (e.g., number of bits) of each of the linearly-transformed signal samples.

Abstract: An encryption interface provides secure, low-latency communications between processors. A first processor block transforms initial data into encrypted data using a cipher for receipt by a second processor block, which transforms the encrypted data into decrypted data. The first processor block utilized a crypto circuit having a plurality of stages, each of which generate a subset of a cipher digit stream for encrypting the data. The second processor block receives and decrypts the encrypted data using a respective decryption circuit.

Abstract: Efficient and reliable transmission of information from sparse sources over wireless channels in wireless signal networks (WSNs). WSN nodes employ an “integrated signal representation-to-modulation” scheme to describe a sparse signal acquired from a sensor so as to ensure robustness against channel errors across a wide range of signal to noise (SNR) values in a rateless fashion. In one example, sparse signal samples are linearly transformed such that the total number of bits representing the sparse signal is reduced. The linearly-transformed signal samples are directly mapped to a modulation constellation to provide a succession of modulation symbols. A carrier wave is modulated in phase and/or frequency according to the succession of the modulation symbols to generate an encoded carrier wave representing the sparse analog signal. In one aspect, an order of the modulation constellation is based on the precision (e.g., number of bits) of each of the linearly-transformed signal samples.

Abstract: Systems and methods for improved packet throughput using partial packets are provided in which data recovery of partial packets of a plurality of received coded packets is performed across the plurality of received coded packets. The plurality of received coded packets, including the received partial packets, can be buffered in a memory and used in recovering the data for the partial packets. As soon as the total number of received packets (including valid and partial) becomes greater than the generation size, a decoding process can be attempted utilizing the partial packets as part of the redundancy used for data recovery. During the decoding process, the received packets are evaluated across packets instead of on a per-packet basis.

Abstract: A method for network coding includes encoding a plurality of message packets to produce a plurality of encoded packets. Each message packet and each encoded packet includes a plurality of symbols having an index and each symbol of the encoded packets is generated by applying a Reed-Solomon code to the symbols of the message packets having the same index as the symbol of the encoded packets. A length of the encoded packets is the same as a length of the message packets.

Abstract: Systems and methods for improved packet throughput using partial packets are provided in which data recovery of partial packets of a plurality of received coded packets is performed across the plurality of received coded packets. The plurality of received coded packets, including the received partial packets, can be buffered in a memory and used in recovering the data for the partial packets. As soon as the total number of received packets (including valid and partial) becomes greater than the generation size, a decoding process can be attempted utilizing the partial packets as part of the redundancy used for data recovery. During the decoding process, the received packets are evaluated across packets instead of on a per-packet basis.

Abstract: A method for network coding includes encoding a plurality of message packets to produce a plurality of encoded packets. Each message packet and each encoded packet includes a plurality of symbols having an index and each symbol of the encoded packets is generated by applying a Reed-Solomon code to the symbols of the message packets having the same index as the symbol of the encoded packets. A length of the encoded packets is the same as a length of the message packets.