dc.contributor.author | Lutomirski, Andrew Michael | |
dc.contributor.author | Tegmark, Max Erik | |
dc.contributor.author | Sanchez, Nevada J. | |
dc.contributor.author | Stein, Leo C. | |
dc.contributor.author | Urry, W. Lynn | |
dc.contributor.author | Zaldarriaga, Matias | |
dc.date.accessioned | 2014-08-07T13:47:14Z | |
dc.date.available | 2014-08-07T13:47:14Z | |
dc.date.issued | 2011-01 | |
dc.date.submitted | 2010-08 | |
dc.identifier.issn | 00358711 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/88569 | |
dc.description.abstract | The so-called corner-turning problem is a major bottleneck for radio telescopes with large numbers of antennas. The problem is essentially that of rapidly transposing a matrix that is too large to store on one single device; in radio interferometry, it occurs because data from each antenna need to be routed to an array of processors each of which will handle a limited portion of the data (say, a frequency range) but requires input from each antenna. We present a low-cost solution allowing the correlator to transpose its data in real time, without contending for bandwidth, via a butterfly network requiring neither additional RAM memory nor expensive general-purpose switching hardware. We discuss possible implementations of this using FPGA, CMOS, analog logic and optical technology, and conclude that the corner-turner cost can be small even for upcoming massive radio arrays. | en_US |
dc.description.sponsorship | David & Lucile Packard Foundation | en_US |
dc.description.sponsorship | United States. Dept. of Defense (National Defense Science and Engineering Graduate Fellowship) | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (NSF Grant No. AST-0607597) | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (Grant No. AST-0708534) | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (Grant No. AST- 0907969) | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (Grant No. AST-0908848) | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (Grant No. PHY-0855425) | en_US |
dc.description.sponsorship | United States. National Aeronautics and Space Administration (NASA grant NAG5-11099) | en_US |
dc.description.sponsorship | United States. National Aeronautics and Space Administration (NASA grant NNG 05G40G) | en_US |
dc.language.iso | en_US | |
dc.publisher | Oxford University Press on behalf of The Royal Astronomical Society | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1111/j.1365-2966.2010.17587.x | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
dc.source | arXiv | en_US |
dc.title | Solving the corner-turning problem for large interferometers | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Lutomirski, Andrew, Max Tegmark, Nevada J. Sanchez, Leo C. Stein, W. Lynn Urry, and Matias Zaldarriaga. “Solving the Corner-Turning Problem for Large Interferometers.” Monthly Notices of the Royal Astronomical Society 410:3 (January 21, 2011): p.2075-2080. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Physics | en_US |
dc.contributor.mitauthor | Lutomirski, Andrew Michael | en_US |
dc.contributor.mitauthor | Tegmark, Max Erik | en_US |
dc.contributor.mitauthor | Sanchez, Nevada J. | en_US |
dc.contributor.mitauthor | Stein, Leo C. | en_US |
dc.relation.journal | Monthly Notices of the Royal Astronomical Society | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
dspace.orderedauthors | Lutomirski, Andrew; Tegmark, Max; Sanchez, Nevada J.; Stein, Leo C.; Urry, W. Lynn; Zaldarriaga, Matias | en_US |
dc.identifier.orcid | https://orcid.org/0000-0001-7670-7190 | |
dspace.mitauthor.error | true | |
mit.license | OPEN_ACCESS_POLICY | en_US |
mit.metadata.status | Complete | |