
Authored by: Anonymous on Wednesday, March 20 2013 @ 12:58 PM EDT 
You should believe me, because you don't seem to understand the court:
Here are claims from some "math" patents that have issued recently:
7. A method comprising:
identifying a first data table corresponding to at least one of a plurality of
data tables, each data table associated with at least one of an RCP
(reciprocal), SQRT (square root), EXP (exponential) and LOG (logarithm)
function, wherein each of the data tables includes data associated with
implementing the associated function;
identifying a second data table corresponding to at least one of a plurality of
data tables, each data table corresponding to at least one of the RCP, SQRT, EXP
and LOG functions;
performing, in a single hardware pipeline, a first polynomial approximation
based on the first data table;
performing, in the single hardware pipeline, a second polynomial approximation
based on the second data table; and
summing, in the single hardware pipeline, the first and second polynomial
approximations to generate an output associated with at least one of the RCP,
SQRT, EXP and LOG functions;
wherein the first and second polynomial approximations are of the form
F(x)=a+b*(x−x0)+c*(x−x0)*(x−x1), where F(x) is an
intermediate value used in the single hardware pipeline, x is an operand, x0 is
a value greater than the operand, x1 is a value smaller than the operand, and
values a, b, and c correspond to the values x0 and x1 and are retrieved from the
plurality of data tables as coupled to the single hardware pipeline according to
the at least one opcode.
http://www.google.com/patents/US8346831?dq=method+fast+fourier+transform+january
+2013&hl=en&sa=X&ei=uudJUde3JKmfyQGfpIDoCg&sqi=2&pjf=1&v
ed=0CDYQ6AEwAQ
1. A method for area and speed efficient fast Fourier transform (FFT) processing
comprising:
mapping a onedimensional discrete Fourier transform (DFT) to a
multidimensional representation;
reindexing the multidimensional representation as a radix 23 decimation
architecture;
simplifying the radix 23 decimation architecture to obtain a nested butterfly
architecture;
acquiring N samples of a finite duration timesampled signal; and
inputting the acquired N samples into the nested butterfly architecture to
obtain a Npoint fast Fourier transform (FFT) output.
http://www.google.com/patents/US8346836?dq=method+fast+fourier+transform+january
+2013+radix+23&hl=en&sa=X&ei=iuhJUYjzLYjaygHzp4G4CQ&sqi=2&pj
f=1&ved=0CDMQ6AEwAA
15. A method for processing signals representing speech or audio via a plurality
of filters that approximate behaviors of basilar membrane in human cochlea,
comprising:
providing a first signal representing said speech or said audio to the plurality
of filters, wherein said first signal is an analog signal; and
filtering the first signal with the plurality of filters, each of the plurality
of filters producing one of a plurality of filtered signals;
wherein
each of the plurality of filters is formed from a base function via a dilation
and a shift in time, wherein the base function is an analog filter representing
an impulse response at a point on the basilar membrane to a corresponding
frequency and the each of the plurality of filters is an analog filter formed
from the base function via a dilation and a shift in time;
wherein the first signal is filtered according to:
T⁡(a,b)=∫∞∞⁢f⁡(t)&a
mp;#8290;1a⁢ψ⁡(tba)
290;⁢ⅆt
and wherein for the shift of b and a dilation of the each of the plurality of
analog filters is determined according to:
ψa,b⁡(t)=1a⁢(tba)α
;⁢exp⁡[2⁢π⁢⁢fL&#
8290;β⁡(tba)]⁢cos⁡[2⁢π
;⁢⁢fL⁡(tba)+θ]⁢u⁡(t)
wherein n=1, . . . , N, are discrete time instances, u(n) is a step function,
and α, β, θ, and ƒare constants;
and wherein the impulse response of the base function at a particular frequency
band is similar to an impulse response of the basilar membrane at a
corresponding frequency band in the human cochlea when:
value of α>0,
value of β>0,
value of θ is selected to equate
∫∞∞⁢ψai,b⁡(n)
290;⁢ⅆn=0,
u(n) =1 for n >=0, and
a >0, b >=, 0,ƒL>0.
http://www.google.com/patents/US8359195?dq=method+fast+fourier+transform+2013&am
p;hl=en&sa=X&ei=rulJUcLeA8q3yQHTjYGwAg&ved=0CD8Q6AEwBDgo
I respectfully submit that if the Supreme Court said what you think it said,
these and the large number of patents like them that have issued since the
Supreme court said whatever it is you are misinterpreting, would not have
issued.
[ Reply to This  Parent  # ]

 I don't think so  Authored by: Anonymous on Wednesday, March 20 2013 @ 07:09 PM EDT
 I don thin so  Authored by: Anonymous on Thursday, March 21 2013 @ 11:00 AM EDT



