Russell F Brown

US Patent:

6437795, Aug 20, 2002

Filed:

Jul 21, 1999

Appl. No.:

09/358284

Inventors:

Russell A. Brown - Palo Alto CA

Assignee:

Sun Microsystems, Inc. - Palo Alto CA

International Classification:

G06T 1530

US Classification:

345620, 345619, 345581

Abstract:

The invention is a method and apparatus for clipping a function, such as a quadratic Bezier function defining a shading characteristic of an object being modeled. In accordance with the invention, a second or higher order function is clipped in âlinearâ fashion using barycentric coordinates. In accordance an embodiment of the invention, the method comprises the steps of determining a second or higher order function to be clipped, determining barycentric coordinates for at least one clipping point associated with a first order (i. e. linear) function associated with the second or higher order function and generating at least one clipping point associated with the second or higher order function using the barycentric coordinates. In one or more embodiments of the invention, the method includes the steps of using the barycentric coordinates to determine a reparameterized clipped function.

US Patent:

6545677, Apr 8, 2003

Filed:

Apr 30, 2001

Appl. No.:

09/845781

Inventors:

Russell A. Brown - Palo Alto CA

Assignee:

Sun Microsystems, Inc. - Santa Clara CA

International Classification:

G06T 1560

US Classification:

345426

Abstract:

A method and apparatus for modeling the specular reflection of light from an object is disclosed. In accordance with one embodiment of the method, a portion of the object is modeled by one or more surfaces each having at least one vertex and an edge point corresponding to an edge. A sine value associated with a highlight angle is determined at each vertex and edge point, and a control value is determined at each vertex and edge point using the sine values. A specular input component at each point on the surface is determined using the control values. The specular input component is utilized to determine the specular light component at that particular point. Embodiments of apparatus implementing the method are also disclosed.

US Patent:

6633242, Oct 14, 2003

Filed:

Feb 8, 2001

Appl. No.:

09/779333

Inventors:

Russell A. Brown - Palo Alto CA

Assignee:

Sun Microsystems, Inc. - Santa Clara CA

International Classification:

H03M 746

US Classification:

341 50, 341 51

Abstract:

The present invention provides an entropy coding scheme using an adaptable prefix code. The prefix code is a binary representation of the algorithm used to compress and decompress the data. There are prefix zeros that represent the number of significant binary digits that follow the first one. According to one embodiment, this scheme works on both positive and negative integers and encodes lower order integers with a smaller length of codeword. In another embodiment, the zero integer is encoded as a special case with the shortest codeword. In yet another embodiment, the present scheme is preferred by data sets that are clustered about zero, such as image data sets that have been transformed via a wavelet transform or a discrete cosine transform.

US Patent:

6687410, Feb 3, 2004

Filed:

Feb 7, 2000

Appl. No.:

09/499262

Inventors:

Russell A. Brown - Palo Alto CA

Assignee:

Sun Microsystems, Inc. - Palo Alto CA

International Classification:

G06K 936

US Classification:

382239

Abstract:

The present invention is a compression scheme for compressing audio and video data. An image is divided into blocks of pixels. In one test, if all of the pixels are approximately equal to the corresponding pixels in the previous block, then no data is sent for that block. In a second test, if all of the pixels in a block are approximately equal to a mean pixel value, then only one color value is transmitted. In a third test, if quantization of the pixels via companding results in an acceptable representation, the quantization is performed. The present invention uses quantization codes that are proportional to the logarithm of the magnitude of the range quantized, computation of a magnitude byte that permits rapid discovery of the number of bits used for quantization of a block, recursive packing and unpacking of quantized pixel data, and two-dimensional paths through the block.

US Patent:

7461115, Dec 2, 2008

Filed:

Mar 11, 2003

Appl. No.:

10/387009

Inventors:

Hans Eberle - Mountain View CA, US
Nils Gura - San Carlos CA, US
Russell A. Brown - Palo Alto CA, US
Vipul Gupta - Los Altos CA, US

Assignee:

Sun Microsystems, Inc. - Santa Clara CA

International Classification:

G06F 7/00
H04L 9/00

US Classification:

708491, 708492, 380 28

Abstract:

Modular multiplication of two elements X(t) and Y(t), over GF(2), where m is a field degree, may utilize field degree to determine, at least in part, the number of iterations. An extra shift operation may be employed when the number of iterations is reduced. Modular multiplication of two elements X(t) and Y(t), over GF(2), may include a shared reduction circuit utilized during multiplication and reduction. In addition, a modular multiplication of binary polynomials X(t) and Y(t), over GF(2), may utilize the Karatsuba algorithm, e. g. , by recursively splitting up a multiplication into smaller operands determined according to the Karatsuba algorithm.

US Patent:

8159208, Apr 17, 2012

Filed:

Dec 22, 2008

Appl. No.:

12/341758

Inventors:

Russell A. Brown - San Jose CA, US
Cindy Robinson - San Jose CA, US

Assignee:

Anritsu Company - Morgan Hill CA

International Classification:

G01R 23/14

US Classification:

324 7623, 324 7622, 324 7631, 702 70, 702 76

Abstract:

A spectrum analyzer is provided that includes components to achieve from below 9 kHz to above 20 GHz operation range while remaining hand-held. Components of the spectrum analyzer include an integrated precision stand-alone step attenuator that does not rely on printed circuit board (PCB) mounted circuit elements within the signal path. Further, a PIN diplexing switch separates signals into different base-band and highband paths. The baseband path includes a pre-amplifier for low frequency signals, while the higher frequency bands may not necessarily include a pre-amplifier. The baseband path further provides improved broadband termination of its 1mixer IF port by incorporating a new quadrature-coupled directional (QCD) filter that includes a ring resonator. An inexpensive air dielectric multi-cavity baseband filter is also used to suppress 2mixer IF images. The highband path incorporates multi-throw MMIC PIN diode switches to selectively filter different bands of input signals.

US Patent:

8176110, May 8, 2012

Filed:

Oct 22, 2008

Appl. No.:

12/256295

Inventors:

Hans Eberle - Mountain View CA, US
Nils Gura - San Carlos CA, US
Russell A. Brown - Palo Alto CA, US
Vipul Gupta - Los Altos CA, US

Assignee:

Oracle America, Inc. - Redwood City CA

International Classification:

G06F 7/38
H04L 9/00

US Classification:

708491, 708492, 380 28

Abstract:

Modular multiplication of two elements X(t) and Y(t), over GF(2), where m is a field degree, may utilize field degree to determine, at least in part, the number of iterations. An extra shift operation may be employed when the number of iterations is reduced. Modular multiplication of two elements X(t) and Y(t), over GF(2), may include a shared reduction circuit utilized during multiplication and reduction. In addition, a modular multiplication of binary polynomials X(t) and Y(t), over GF(2), may utilize the Karatsuba algorithm, e. g. , by recursively splitting up a multiplication into smaller operands determined according to the Karatsuba algorithm.

US Patent:

20090125514, May 14, 2009

Filed:

Nov 8, 2007

Appl. No.:

11/937315

Inventors:

Russell A. Brown - Palo Alto CA, US

International Classification:

G06F 7/20

US Classification:

707 6, 707E1705, 707E17061, 707E17106

Abstract:

Sequence alignment techniques are disclosed. In one embodiment, a sparse data structure is constructed that represents respective character positions of matching character sets in input sequences. This sparse data structure may take a variety of forms, including a “tree of trees.” Once constructed, each match is linked to at most one other match using a local application of a predetermined algorithm (e.g., a Smith-Waterman-type scoring algorithm). The links between matches are analyzed and a possible alignment or set of alignments is produced.