1Stworks Corporation

Infinetics Technologies, Inc.

J. Scott Benson Living Trust

Ratko V Tomic

Christopher John Williams

Leigh Richard Turner

Reed Graham Lewis

A system and method for interconnecting nodes and routing data packets in high radix networks includes constructing or redefining a network structure to provide improved performance. Computation and data storage nodes are connected to a network of switching nodes that provide near optimum bandwidth and latency for networks of any size. Specialized interconnection patterns and addressing methods ensure reliable data delivery in very large networks with high data traffic volume.

Flexible radix switch

Entropy encoders and decoders employ an entropy-pump operation. The entropy-pump operation includes classifying blocks of the input sequence's symbols in accordance with the probabilities of occurrence of those blocks' values. Entropy coding an output component that represents the sequence of classes to which the blocks belong tends to be profitable, because that component has an entropy density less than that of the input sequence. In contrast, little opportunity for compression tends to be lost by not entropy encoding an output component that represents the values of the blocks that belong to single class, because those values' probabilities of occurrence are similar.

Modeling for enumerative encoding

An enumerator employs 'indexing volumes' as the add-on values used to compute indexes for n-item ordered sets such as symbol sequences. Each indexing volume is associated with a different class into which the allowed ordered sets are partitioned. The indexing volumes all equal or exceed the number of ordered sets that belong to their respective classes. Additionally, the indexing volume Vassociated with a given class of i-item equals or exceeds the sum of the indexing volumes associated with the classes that contain the (i&#x2212;1)-item prefixes of the ordered sets that belong to the given class. The indexing volumes are quantized such that each volume V=wr, where r is an integer greater than unity, s is a non-negative integer, w is a positive integer less than r, m is some positive integer less than h, and, for some allowed ordered set whose size is less than n, h is the number of radix-r digits in the smallest quotient that results from evenly dividing by a positive-integer power of r the set count of the class to which that allowed ordered set belongs. As a result, the addition operations used to compute the indexes can be performed with limited precision, and storage requirements for the add-on values can be relatively modest.

Growing community of inventors

Lexington, MA, United States of America

Ratko V Tomic