Codex Corporation

Athena Capital Advisors, Inc.

G David Forney, Jr

Vedat M Eyuboglu

Lisette Cooper

Leonard L Scott, Jr

Philip A Cooper

Stewart Myers

Data are received that represents current prices of options on a given asset. An estimate is derived from the data of a corresponding implied probability distribution of the price of the asset at a future time. Information about the probability distribution is made available within a time frame that is useful to investors, for example, promptly after the current option price information becomes available.

Generating and providing information about expected future prices of assets

Deriving a probability distribution of a value of an asset at a future time

Vectors are quantized by representing the vectors by quantized values using a codebook having granular regions which are based on a coset code, and which lie inside a boundary region which is based on another coset code, the boundary region being other than an N-cube and other than the Voronoi region of a sublattice .LAMBDA..sub.b =M.LAMBDA..sub.g of a lattic .LAMBDA..sub.g upon which the granular regions may have been based.

Lattice and trellis-coded quantization

In general the invention features mapping a digital data sequence into a signal point sequence for data transmission over a channel characterized by a non-ideal response, by selecting the signal point sequence from a subset of all possible signal point sequences based on the digital data sequence and upon the response, all possible signal point sequences in the subset lying in a fundamental region of a filtered trellis code, the fundamental region being other than a simple Cartesian product of finite-dimensional regions.

Trellis precoding for modulation systems

A digital data sequence is mapped into a signal point sequence for transmission, by selecting the signal point sequence from a subset of all possible signal point sequences based on the digital data sequence, all possible signal point sequences in the subset lying in a fundamental region of a trellis code, the fundamental region being other than a simple Cartesian product of finite-dimensional regions. In another aspect, a digital data sequence is mapped into a sequence of signal points for transmission, by specifying a class of possible sequences based on the digital data, and selecting the signal point sequence from the class, the selection being based on the respective average powers of the possible sequences of the class, the selection being based on not only a fixed-length block of the digital data.

Trellis shaping for modulation systems

Apparatus for generating a (running digital sum) sequence of digital signals X.sub.k and/or a (partial response coded) sequence of digital signals Y.sub.k, K=1, 2, . . . , such that Y.sub.k =X.sub.k .+-.X.sub.k-l, L and integer, in which the Y.sub.x signals are a sequence in a given modulation code. In one aspect, the signals Y.sub.k are chosen to be congruent to coset representatives specified in accordance with a modulation code, a plurality of code constellations are used, and at least one constellation includes both a point with a positive sum of coordinates and one with a negative sum of coordinates. In another aspect, the signals X.sub.k are chosen to be congruent to a sequence of alternate (precoded) coset representatives. In other aspects, the Y.sub.k alphabet signals are evenly spaced, and a selectable, e.g., an optimal, tradeoff between S.sub.x and S.sub.y is made. An N-dimentional modulation code is generated as a sequence of one-dimensional signals. A maximum likelihood sequence estimation decoder reconstructs the estimated running digital sum, and generates a signal whenever the estimated running digital sum is outside a permissible range. In another aspect, the decoder includes a modified maximum likelihood sequence estimator adapted to find MQ partial decoded sequences, where Q is the number of encoder states, and M is an integer.

Partial response channel signaling systems

A Voronoi signal constellation with ties includes those points of a lattice .LAMBDA. (or a coset .LAMBDA.+c) that lie within a Voronoi region of a sublattice .LAMBDA.' of .LAMBDA., .LAMBDA.' being other then a scaled version of .LAMBDA., and the constellation includes more than .vertline..LAMBDA./.LAMBDA.'.vertline. points, where .vertline..LAMBDA./.LAMBDA.'.vertline. is the order of the lattice partition .LAMBDA./.LAMBDA.'. In order aspects, the lattices .LAMBDA. and .LAMBDA.' are of dimension greater than two; the sublattice .LAMBDA.' is a version of a binary lattice of depth at least two and normalized informativity less than one; a method is provided of mapping from m data bits to a point drawn from a Voronoi constellation of more than 2.sup.m points, based on an N-dimensional lattice partition .LAMBDA./.LAMBDA.'; and Voronoi constellations are provided comprising points of a lattice .LAMBDA. (or a coset .LAMBDA.+c) that lie within a Voronoi region of a sublattice .LAMBDA.' of .LAMBDA., the sublattice .LAMBDA.' comprising a binary lattice of depth two and normalized informativity less than one. Such sublattices .LAMBDA.' are also useful in lattice quantizers.

Growing community of inventors

Cambridge, MA, United States of America

G David Forney, Jr