Abstract: A system for decoding a transmission include a client device configured to receives a superposition via one or more communication links. The superposition may correspond to a transmission encoded into a plurality of fragments. The system may determine a coefficient for each fragment contained in the superposition and initialize a decoding process. The decoding process may facilitate determining a value of each fragment based on the identified coefficient of each fragment in the superposition. Advantageously, the system, through use of a the one or more communication links, may be configured to decode the transmission to derive information transmitted from a data source quickly and reliably.
Abstract: A system for decoding a transmission include a client device configured to receives a superposition via one or more communication links. The superposition may correspond to a transmission encoded into a plurality of fragments. The system may determine a coefficient for each fragment contained in the superposition and initialize a decoding process. The decoding process may facilitate determining a value of each fragment based on the identified coefficient of each fragment in the superposition. Advantageously, the system, through use of a the one or more communication links, may be configured to decode the transmission to derive information transmitted from a data source quickly and reliably.
Abstract: A system for transmitting information may include a server that generates pseudo-random superpositions, each superposition including multiple packet fragments encoded using a Galois field. The system may transmit the superpositions across a plurality of communication links, which form a single logical path, to a client device. Communication links may include a combination of diverse communication channels, and more preferably one or more low latency (but low bandwidth) communication links and one or more high bandwidth (but high latency) communication links. Advantageously, the use of a plurality of communication links may facilitate transmitting information quickly and reliably.
Abstract: An improved network architecture for minimizing latency of preparing and sending data to a network over a physical medium. A system for communicating messages over a network may create and store ready-to-send data packets in a data buffer next to or as close as possible, either physically and/or logically, to a MAC component. The MAC component may then receive the data packet directly from the data buffer and encapsulate the data packet into a frame suitable for transmission to the network. The data packet is modifiable while being stored in the data buffer prior to transmission to the network.
Type:
Grant
Filed:
January 20, 2021
Date of Patent:
October 4, 2022
Assignee:
Jump Algorithms, LLC
Inventors:
Edward James Turner, Steven William Perry
Abstract: An improved network architecture for minimizing latency of preparing and sending data to a network over a physical medium. A system for communicating messages over a network may create and store ready-to-send data packets in a data buffer next to or as close as possible, either physically and/or logically, to a MAC component. The MAC component may then receive the data packet directly from the data buffer and encapsulate the data packet into a frame suitable for transmission to the network. The data packet is modifiable while being stored in the data buffer prior to transmission to the network.
Type:
Application
Filed:
January 20, 2021
Publication date:
July 21, 2022
Applicant:
Jump Algorithms, LLC
Inventors:
Edward James Turner, Steven William Perry
Abstract: A system for transmitting information over a network may include a server that generates random superpositions each including multiple packet fragments encoded using a Galois field and transmits them over multiple communication links to a client device. The packet fragments may be a plurality of fixed-size vectors that define the information to be transmitted. The server also may select a subset of the fixed-size vectors based on heuristics and generate a coefficient for each of the selected vectors. The coefficients may include any natural number. The superposition may be a sum of the selected fixed-size vectors multiplied by their associated coefficients. The server may repeat the process until the client acknowledges receipt of the information or another condition is met. The client device may then decode the received superposition, such as by solving the set of linear equations represented by the received superpositions. Other implementations also are described.