Abstract: A method for assigning codes to Huffman trees and repairing invalid Huffman trees is disclosed using a calculated delta and moving nodes within the Huffman tree by adjusting their encode register entries.

Abstract: A burst processing modem. Implementations may include a receive side including a channelizer adapted to process a plurality of channels and write a plurality of frames to a receive RAM array. A receive frame state machine may be adapted to generate a timing signal using a burst time plan for the plurality of frames. A demodulator may be coupled with the receive RAM array and adapted to read from the receive RAM array only the one or more bursts from the plurality of frames indicated by the timing signal. A transmit side may include a modulator coupled with a transmit frame state machine, with a transmit RAM array, and a combiner bank. The combiner bank may read the modulated plurality of channels from the transmit RAM array and assemble a plurality of frames using a timing signal generated from a burst time plan by the transmit frame state machine.

Abstract: A data encapsulation system and related methods. Implementations may include: forming at least one frame having a data payload, a data sequence, and one or more control bytes; evaluating data to be stored in the data payload and setting a value of the one or more control bytes, where the value of the one or more control bytes may be equal to: a first control byte value where one or more values of the data correspond with the first control byte value; a second control byte value indicating a size of the data; or a third control byte value where one or more values of the data continue beyond the frame. The value of each one of the one or more control bytes for each of the at least one frames may be equal to either the first, second, or third control byte values.