Abstract: A cleaning composition comprises between about 10% to about 50% of at least one organic solvent comprising vegetable oil. The composition further comprises between about 2% to about 20% of at least one co-solvent. The composition further comprises at least one water-in-oil emulsifier and non-ionic surfactant. The composition also comprises at least one anionic surfactant and between about 20% to about 60% of water.

Abstract: A cleaning composition comprises between about 10% to about 50% of at least one organic solvent comprising vegetable oil. The composition further comprises between about 2% to about 20% of at least one co-solvent. The composition further comprises at least one water-in-oil emulsifier and non-ionic surfactant. The composition also comprises at least one anionic surfactant and between about 20% to about 60% of water.

Abstract: An N-stage finite impulse response (FIR) filter embodying the invention includes a first filter section whose filter coefficients are made either 1 or zero (rather than 1 and −1) in order to produce a first output (i.e., C1) and a second filter section for producing a second output (i.e., C2), which when combined (added to or subtracted from) with the first output produces an output function (i.e., Cn) which is equal to that produced by an N-stage FIR filter implementing filter coefficients having a value of either 1 or −1.

Abstract: A receiver for a spread spectrum communication system is disclosed in which a transmitter transmits a data signal to a receiver includes a memory for storing digital representation of the data signal received by the receiver. A memory input addressing unit defines a circulating data window. A first ring shift register circulates a first set of components of a spreading code. A second ring shift register circulates a second set of components of a spreading code. A selector selects one of the first set of components or the second set of components as selected components of the spreading code and an adder receives as inputs digital representations of the data signal from the circulating data window and the selected components of the spreading code. The adder provides an output that is the dot product of the inputs.

Abstract: A method of efficient branch metric computation for a Viterbi convolutional decoder wherein a reduced and optimized set of branch metrics is distributed among one or more base sets is provided. A sequence of data transformations and associations are defined according to the connections of the delay elements in the convolutional encoder to its outputs. Each encoder state is associated with one of the base sets and one of several groups of path metric equations. During the add portion of the add-compare-select phase of Viterbi decoding, a branch metric value is extracted from the base set associated with the encoder state being evaluated. The group of path metric equations associated with state being evaluated are evaluated using the extracted branch metric value. The results of the addition are then be processed according to the remaining steps of the Viterbi algorithm.

Abstract: There is disclosed a method and apparatus for computing branch metrics that are combinations of autocorrelation and cross correlation terms are constructed by first calculating and storing components of the autocorrelation and cross correlation terms at a symbol instant. Once calculated and stored, predetermined ones of the autocorrelation components and the cross correlation components are selected. The selected autocorrelation components and cross correlation components, or their inverse as predetermined, are combined to produce a branch metric. Other predetermined combinations of the stored components of autocorrelation and cross correlation terms, or their inverse, are combined to produce other branch metrics at the same symbol instant. All branch metrics associated with the symbol instant can be calculated in this manner.