Optimized discrete fourier transform method and apparatus using prime factor algorithm
An apparatus and method for DFT processing using prime factor algorithm (PFA) on a selected number P of midamble chip values received by a CDMA receiver, where P has a plurality M of relatively prime factors F, and the DFT process is divided into M successive F-point DFT processes. The P data values...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Patent |
Sprache: | eng |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Buchert, Ryan Samuel Shahrier, Sharif M Becker, Peter Edward |
description | An apparatus and method for DFT processing using prime factor algorithm (PFA) on a selected number P of midamble chip values received by a CDMA receiver, where P has a plurality M of relatively prime factors F, and the DFT process is divided into M successive F-point DFT processes. The P data values are retrieved from a single input port memory and selectively permuted by a controller into parallel caches to optimize factoring with associated twiddle factors stored in parallel registers. The permuted inputs are factored in two or more parallel PFA circuits that comprise adders and multipliers arranged to accommodate any size F-point DFT. The outputs of the PFA circuits are processed by consolidation circuitry in preparation for output permutation of the values which are sent to memory for subsequent DFT cycles. |
format | Patent |
fullrecord | <record><control><sourceid>uspatents_EFH</sourceid><recordid>TN_cdi_uspatents_grants_07720897</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>07720897</sourcerecordid><originalsourceid>FETCH-uspatents_grants_077208973</originalsourceid><addsrcrecordid>eNqNjDsOAjEMBbehQMAdfAGkFRSBGoHoaBAtsjZO1tLmI9tpOD0pOADFaJp5bz28HtU48Yc8eNZJyAhCacIkYIJZQ5EEiWwuHjB3akVBawpNOUeowqlPcLIigEsswjan7bAKuCjtft4McLs-L_d904pG2fQd-3vX6NxhPJ3d8Y_kC03OO2k</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Optimized discrete fourier transform method and apparatus using prime factor algorithm</title><source>USPTO Issued Patents</source><creator>Buchert, Ryan Samuel ; Shahrier, Sharif M ; Becker, Peter Edward</creator><creatorcontrib>Buchert, Ryan Samuel ; Shahrier, Sharif M ; Becker, Peter Edward ; InterDigital Technology Corporation</creatorcontrib><description>An apparatus and method for DFT processing using prime factor algorithm (PFA) on a selected number P of midamble chip values received by a CDMA receiver, where P has a plurality M of relatively prime factors F, and the DFT process is divided into M successive F-point DFT processes. The P data values are retrieved from a single input port memory and selectively permuted by a controller into parallel caches to optimize factoring with associated twiddle factors stored in parallel registers. The permuted inputs are factored in two or more parallel PFA circuits that comprise adders and multipliers arranged to accommodate any size F-point DFT. The outputs of the PFA circuits are processed by consolidation circuitry in preparation for output permutation of the values which are sent to memory for subsequent DFT cycles.</description><language>eng</language><creationdate>2010</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://image-ppubs.uspto.gov/dirsearch-public/print/downloadPdf/7720897$$EPDF$$P50$$Guspatents$$Hfree_for_read</linktopdf><link.rule.ids>230,308,780,802,885,64039</link.rule.ids><linktorsrc>$$Uhttps://image-ppubs.uspto.gov/dirsearch-public/print/downloadPdf/7720897$$EView_record_in_USPTO$$FView_record_in_$$GUSPTO$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Buchert, Ryan Samuel</creatorcontrib><creatorcontrib>Shahrier, Sharif M</creatorcontrib><creatorcontrib>Becker, Peter Edward</creatorcontrib><creatorcontrib>InterDigital Technology Corporation</creatorcontrib><title>Optimized discrete fourier transform method and apparatus using prime factor algorithm</title><description>An apparatus and method for DFT processing using prime factor algorithm (PFA) on a selected number P of midamble chip values received by a CDMA receiver, where P has a plurality M of relatively prime factors F, and the DFT process is divided into M successive F-point DFT processes. The P data values are retrieved from a single input port memory and selectively permuted by a controller into parallel caches to optimize factoring with associated twiddle factors stored in parallel registers. The permuted inputs are factored in two or more parallel PFA circuits that comprise adders and multipliers arranged to accommodate any size F-point DFT. The outputs of the PFA circuits are processed by consolidation circuitry in preparation for output permutation of the values which are sent to memory for subsequent DFT cycles.</description><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2010</creationdate><recordtype>patent</recordtype><sourceid>EFH</sourceid><recordid>eNqNjDsOAjEMBbehQMAdfAGkFRSBGoHoaBAtsjZO1tLmI9tpOD0pOADFaJp5bz28HtU48Yc8eNZJyAhCacIkYIJZQ5EEiWwuHjB3akVBawpNOUeowqlPcLIigEsswjan7bAKuCjtft4McLs-L_d904pG2fQd-3vX6NxhPJ3d8Y_kC03OO2k</recordid><startdate>20100518</startdate><enddate>20100518</enddate><creator>Buchert, Ryan Samuel</creator><creator>Shahrier, Sharif M</creator><creator>Becker, Peter Edward</creator><scope>EFH</scope></search><sort><creationdate>20100518</creationdate><title>Optimized discrete fourier transform method and apparatus using prime factor algorithm</title><author>Buchert, Ryan Samuel ; Shahrier, Sharif M ; Becker, Peter Edward</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-uspatents_grants_077208973</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2010</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Buchert, Ryan Samuel</creatorcontrib><creatorcontrib>Shahrier, Sharif M</creatorcontrib><creatorcontrib>Becker, Peter Edward</creatorcontrib><creatorcontrib>InterDigital Technology Corporation</creatorcontrib><collection>USPTO Issued Patents</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Buchert, Ryan Samuel</au><au>Shahrier, Sharif M</au><au>Becker, Peter Edward</au><aucorp>InterDigital Technology Corporation</aucorp><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Optimized discrete fourier transform method and apparatus using prime factor algorithm</title><date>2010-05-18</date><risdate>2010</risdate><abstract>An apparatus and method for DFT processing using prime factor algorithm (PFA) on a selected number P of midamble chip values received by a CDMA receiver, where P has a plurality M of relatively prime factors F, and the DFT process is divided into M successive F-point DFT processes. The P data values are retrieved from a single input port memory and selectively permuted by a controller into parallel caches to optimize factoring with associated twiddle factors stored in parallel registers. The permuted inputs are factored in two or more parallel PFA circuits that comprise adders and multipliers arranged to accommodate any size F-point DFT. The outputs of the PFA circuits are processed by consolidation circuitry in preparation for output permutation of the values which are sent to memory for subsequent DFT cycles.</abstract><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | |
ispartof | |
issn | |
language | eng |
recordid | cdi_uspatents_grants_07720897 |
source | USPTO Issued Patents |
title | Optimized discrete fourier transform method and apparatus using prime factor algorithm |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T19%3A23%3A24IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-uspatents_EFH&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Buchert,%20Ryan%20Samuel&rft.aucorp=InterDigital%20Technology%20Corporation&rft.date=2010-05-18&rft_id=info:doi/&rft_dat=%3Cuspatents_EFH%3E07720897%3C/uspatents_EFH%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |