{"schema_version":"1.0","canonical_url":"https://patentable.app/patents/US-9832060","patent":{"patent_number":"US-9832060","title":"Method and circuit for fast fourier transform","assignee":null,"inventors":[],"filing_date":"2015-04-05T00:00:00.000Z","publication_date":"2017-11-28T00:00:00.000Z","cpc_codes":["H04L","G06F","H04L","H04L"],"num_claims":30,"abstract":"A method for FFT/IFFT computation, comprising: identifying whether grouping data is needed based on data bitwidth distribution in a set of data, wherein the set of data includes data in a stage of a FFT/IFFT computation; assigning different data representations including effective bit and group index for data identified in different groups if grouping is needed, wherein data in a group have same exponent, and data in different groups have different exponents; and outputting a signal indicating the exponent; for each of a plurality of short sequence FFT/IFFT computation—decomposing data used in present short sequence FFT/IFFT computation into at least a first multi-bit part and a second multi-bit part; respectively calculating FFT/IFFT computation results for the first multi-bit part and the second multi-bit part; adding the FFT/IFFT computation results for the first and the second multi-bit part; scanning a plurality of short sequence FFT/IFFT computation added results."},"analysis":{"summary":null,"layman_explanation":null,"technical_analysis":null,"business_analysis":null,"faqs":null,"topics":[],"tech_cluster":null},"seo":{"title":"Method and circuit for fast fourier transform","description":"A method for FFT/IFFT computation, comprising: identifying whether grouping data is needed based on data bitwidth distribution in a set of data, wherein the set of data includes data in a stage of a F","keywords":[]},"attribution":{"source":"Patentable","source_url":"https://patentable.app","canonical_url":"https://patentable.app/patents/US-9832060","license":"CC-BY-4.0-like","license_terms":"AI-generated analysis on this page (summary, layman_explanation, technical_analysis, business_analysis, faqs) may be reused with attribution and a visible link back to the canonical URL above. Patent abstracts, claims, and bibliographic data are USPTO public domain.","required_link":"https://patentable.app/patents/US-9832060","citation_suggestion":"Patentable. \"Method and circuit for fast fourier transform\" (US-9832060). https://patentable.app/patents/US-9832060","copyright_holder":"Nomic Interactive Technology LLC"},"links":{"html":"https://patentable.app/patents/US-9832060","json":"https://patentable.app/api/llm-context/US-9832060","site":"https://patentable.app","llms_txt":"https://patentable.app/llms.txt"},"generated_at":"2026-06-06T09:52:17.933Z"}