Groklaw - Digging for Truth

	When you want to know more...

Home
Archives
Site Map
Search
About Groklaw
Awards
Legal Research
Timelines

ApplevSamsung
ApplevSamsung p.2
ArchiveExplorer
Autozone
Bilski
Cases
Cast: Lawyers
Comes v. MS
Contracts/Documents
Courts
DRM
Gordon v MS
GPL
Grokdoc
HTML How To
IPI v RH
IV v. Google
Legal Docs
Lodsys
MS Litigations
MSvB&N
News Picks
Novell v. MS
Novell-MS Deal
ODF/OOXML
OOXML Appeals
OraclevGoogle
Patents
ProjectMonterey
Psystar
Quote Database
Red Hat v SCO
Salus Book
SCEA v Hotz
SCO Appeals
SCO Bankruptcy
SCO Financials
SCO Overview
SCO v IBM
SCO v Novell
SCO:Soup2Nuts
SCOsource
Sean Daly
Software Patents
Switch to Linux
Transcripts
Unix Books

Gear

Groklaw Gear

You won't find me on Facebook

Donate

No Legal Advice

The information on Groklaw is not intended to constitute legal advice. While Mark is a lawyer and he has asked other lawyers and law students to contribute articles, all of these articles are offered to help educate, not to provide specific legal advice. They are not your lawyers.

Here's Groklaw's comments policy.

What's New

STORIES
No new stories

COMMENTS last 48 hrs
No new comments

Sponsors

Hosting:

On servers donated to ibiblio by AMD.

Webmaster

Maybe this would be a good question for the submitted list | 335 comments | Create New Account

Comments belong to whoever posts them. Please notify us of inappropriate comments.

Maybe this would be a good question for the submitted list

Authored by: Anonymous on Thursday, March 14 2013 @ 05:44 PM EDT

Given Gottschalk v. Benson,

Why did US8346836 B2 Issue on January 1, 2013?

Doesn't the following claim represent a patent on the algorithm itself?

1. A method for area and speed efficient fast Fourier transform (FFT) processing
comprising:

mapping a one-dimensional discrete Fourier transform (DFT) to a
multi-dimensional representation;

re-indexing the multi-dimensional 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 time-sampled signal; and

inputting the acquired N samples into the nested butterfly architecture to
obtain a N-point fast Fourier transform (FFT) output.

I think the Answer is, .... maybe, but it isn't an abstract idea. Its radix 23,
not radix N, Its 1 dimensional FFT to multidimensional, not N dimensional to M
dimensional, etc...

[ Reply to This | Parent | # ]

Groklaw © Copyright 2003-2013 Pamela Jones.
All trademarks and copyrights on this page are owned by their respective owners.
Comments are owned by the individual posters.

PJ's articles are licensed under a Creative Commons License. ( Details )