{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T13:29:15Z","timestamp":1648646955073},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,2,10]],"date-time":"2013-02-10T00:00:00Z","timestamp":1360454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s11265-012-0721-3","type":"journal-article","created":{"date-parts":[[2013,2,8]],"date-time":"2013-02-08T23:09:14Z","timestamp":1360364954000},"page":"201-219","source":"Crossref","is-referenced-by-count":0,"title":["A Fast Recursive Algorithm and Architecture for Pruned Bit-reversal Interleavers"],"prefix":"10.1007","volume":"71","author":[{"given":"Mohammad M.","family":"Mansour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,10]]},"reference":[{"key":"721_CR1","doi-asserted-by":"crossref","unstructured":"Mansour, M.M. (2012). A recursive algorithm for pruned bit-reversal permutations. In Proc. IEEE int. conf. on acoustics, speech, and signal, processing. Kyoto, Japan.","DOI":"10.1109\/ICASSP.2012.6288208"},{"issue":"6","key":"721_CR2","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/LSP.2009.2016836","volume":"16","author":"A Parsons","year":"2009","unstructured":"Parsons, A. (2009). The symmetric group in data permutation, with applications to high-bandwidth pipelined FFT architectures. IEEE Signal Processing Letters, 16(6), 477\u2013480.","journal-title":"IEEE Signal Processing Letters"},{"issue":"90","key":"721_CR3","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"J Cooley","year":"1965","unstructured":"Cooley, J., & Tukey, J. (1965). An algorithm for the machine calculation of complex Fourier series. Mathematics of Computation, 19(90), 297\u2013301.","journal-title":"Mathematics of Computation"},{"issue":"7","key":"721_CR4","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1109\/29.1631","volume":"36","author":"C Burrus","year":"1988","unstructured":"Burrus, C. (1988). Unscrambling for fast DFT algorithms. IEEE Transactions on Acoustics, Speech, and Signal Processing, 36(7), 1086\u20131087.","journal-title":"IEEE Transactions on Acoustics, Speech, and Signal Processing"},{"issue":"21","key":"721_CR5","doi-asserted-by":"crossref","first-page":"1973","DOI":"10.1049\/el:19911222","volume":"27","author":"A Skodras","year":"1991","unstructured":"Skodras, A., & Constantinides, A. (1991). Efficient input reordering algorithms for fast DCT. Electronics Letters, 27(21), 1973\u20131975.","journal-title":"Electronics Letters"},{"issue":"8","key":"721_CR6","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1109\/TASSP.1987.1165252","volume":"35","author":"D Evans","year":"1987","unstructured":"Evans, D. (1987). An improved digit-reversal permutation algorithm for the fast Fourier and Hartley transforms. IEEE Transactions on Acoustics, Speech, and Signal Processing, 35(8), 1120\u20131125.","journal-title":"IEEE Transactions on Acoustics, Speech, and Signal Processing"},{"key":"721_CR7","unstructured":"Kim, K. (1999). Shuffle memory system. In Int. symp. on parallel and distributed proc. (pp. 268\u2013272)."},{"issue":"9","key":"721_CR8","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1109\/83.784438","volume":"8","author":"M Portnoff","year":"1999","unstructured":"Portnoff, M. (1999). An efficient parallel-processing method for transposing large atrices in place. IEEE Transactions on Image Processing, 8(9), 1265\u20131275.","journal-title":"IEEE Transactions on Image Processing"},{"key":"721_CR9","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF00925830","volume":"3","author":"I Verbauwhede","year":"1991","unstructured":"Verbauwhede, I. et al. (1991). In-place memory management of algebraic algorithms on application specific ICs. The Journal of VLSI Signal Processing, 3, 193\u2013200.","journal-title":"The Journal of VLSI Signal Processing"},{"issue":"3","key":"721_CR10","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1109\/TIT.1970.1054443","volume":"16","author":"J Ramsey","year":"1970","unstructured":"Ramsey, J. (1970). Realization of optimum interleavers. IEEE Transactions on Information Theory, 16(3), 338\u2013345.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"721_CR11","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1109\/TCOM.1971.1090719","volume":"19","author":"G Forney Jr","year":"1971","unstructured":"Forney, Jr. G. (1971). Burst-correcting codes for the classic bursty channel. IEEE Transactions on Communication Technology, 19(5), 772\u2013781.","journal-title":"IEEE Transactions on Communication Technology"},{"key":"721_CR12","doi-asserted-by":"crossref","unstructured":"Berrou, C., Glavieux, A., Thitimajshima, P. (1993). Near Shannon limit error-correcting coding and decoding: Turbo codes. In Proc. IEEE conf. on comm., Geneva, Switzerland (pp. 1064\u20131070).","DOI":"10.1109\/ICC.1993.397441"},{"issue":"5","key":"721_CR13","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1109\/26.141453","volume":"40","author":"E Zehavi","year":"1992","unstructured":"Zehavi, E. (1992). 8-PSK trellis codes for a Rayleigh channel. IEEE Transactions on Communications, 40(5), 873\u2013884.","journal-title":"IEEE Transactions on Communications"},{"issue":"5","key":"721_CR14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/35.54342","volume":"28","author":"J Bingham","year":"1990","unstructured":"Bingham, J. (1990). Multicarrier modulation for data transmission: an idea whose time has come. IEEE Communications Magazine, 28(5), 5\u201314.","journal-title":"IEEE Communications Magazine"},{"issue":"5","key":"721_CR15","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1109\/26.923803","volume":"49","author":"R Garello","year":"2001","unstructured":"Garello, R. et al. (2001). Interleaver properties and their applications to the trellis complexity analysis of turbo codes. IEEE Transactions on Communications, 49(5), 793\u2013807.","journal-title":"IEEE Transactions on Communications"},{"key":"721_CR16","unstructured":"3GPP TS 36.212. Modulation and channel coding. Tech. Rep., Evolved Universal Terrestrial Radio Access (EUTRA), (Release 8)."},{"key":"721_CR17","unstructured":"3rd Generation Partnership Project 2 (3GPP2) (2008). IEEE standard for local and metropolitan area networks part 20: Air interface for mobile broadband wireless access systems supporting vehicular mobility - physical and media access control layer specification. IEEE Std 802.20-2008."},{"key":"721_CR18","unstructured":"IEEE standard for local and metropolitan area networks part 16: Air interface for broadband wireless access systems (2009). IEEE Std 802.16-2009 (Revision of IEEE Std 802.16-2004)."},{"issue":"1","key":"721_CR19","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TIT.2004.839478","volume":"51","author":"J Sun","year":"2005","unstructured":"Sun, J., & Takeshita, O. (2005). Interleavers for turbo codes using permutation polynomials over integer rings. IEEE Transactions on Information Theory, 51(1), 101\u2013119.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"721_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/T-C.1974.223771","volume":"C-23","author":"R Polge","year":"1974","unstructured":"Polge, R., Bhagavan, B., Carswell, J. (1974). Fast computational algorithms for bit reversal. IEEE Transactions on Computers, C-23(1), 1\u20139.","journal-title":"IEEE Transactions on Computers"},{"key":"721_CR21","doi-asserted-by":"crossref","unstructured":"Rodriguez, J. (1988). An improved bit-reversal algorithm for the fast Fourier transform. In Int. conf. on acoustics, speech, and signal proc. (Vol. 3, pp. 1407\u20131410).","DOI":"10.1109\/ICASSP.1988.196862"},{"key":"721_CR22","doi-asserted-by":"crossref","unstructured":"Elster, A. (1989). Fast bit-reversal algorithms. In Int. conf. on acoustics, speech, and signal proc. (Vol. 2, pp. 1099\u20131102).","DOI":"10.1109\/ICASSP.1989.266624"},{"issue":"6","key":"721_CR23","doi-asserted-by":"crossref","first-page":"1415","DOI":"10.1109\/78.136547","volume":"39","author":"A Biswas","year":"1991","unstructured":"Biswas, A. (1991). Bit reversal in FFT from matrix viewpoint. IEEE Transactions on Signal Processing, 39(6), 1415\u20131418.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"10","key":"721_CR24","doi-asserted-by":"crossref","first-page":"2365","DOI":"10.1109\/78.91199","volume":"39","author":"A Yong","year":"1991","unstructured":"Yong, A. (1991). A better FFT bit-reversal algorithm without tables. IEEE Transactions on Signal Processing, 39(10), 2365\u20132367.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"4","key":"721_CR25","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1109\/78.127979","volume":"40","author":"M Orchard","year":"1992","unstructured":"Orchard, M. (1992). Fast bit-reversal algorithms based on index representations in GF(2 b ). IEEE Transactions on Signal Processing, 40(4), 1004\u20131008.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"5","key":"721_CR26","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1109\/78.134472","volume":"40","author":"J Jeong","year":"1992","unstructured":"Jeong, J., & Williams, W. (1992). A unified fast recursive algorithm for data shuffling in various orders. IEEE Transactions on Signal Processing, 40(5), 1091\u20131095.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"4","key":"721_CR27","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1109\/78.376852","volume":"43","author":"J Rius","year":"1995","unstructured":"Rius, J., & De Porrata-Doria, R. (1995). New FFT bit-reversal algorithm. IEEE Transactions on Signal Processing, 43(4), 991\u2013994.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"1","key":"721_CR28","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1109\/78.890370","volume":"49","author":"K Drouiche","year":"2001","unstructured":"Drouiche, K. (2001). A new efficient computational algorithm for bit reversal mapping. IEEE Transactions on Signal Processing, 49(1), 251\u2013254.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"12","key":"721_CR29","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1109\/LSP.2004.838211","volume":"11","author":"J Prado","year":"2004","unstructured":"Prado, J. (2004). A new fast bit-reversal permutation algorithm based on a symmetry. IEEE Signal Processing Letters, 11(12), 933\u2013936.","journal-title":"IEEE Signal Processing Letters"},{"issue":"3","key":"721_CR30","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1109\/TSP.2006.887567","volume":"55","author":"S-C Pei","year":"2007","unstructured":"Pei, S.-C., Chang, K.-W., Efficient bit and digital reversal algorithm using vector calculation (2007). IEEE Transactions on Signal Processing, 55(3), 1173\u20131175.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"8","key":"721_CR31","doi-asserted-by":"crossref","first-page":"1147","DOI":"10.1109\/TVLSI.2008.2008831","volume":"17","author":"MM Mansour","year":"2009","unstructured":"Mansour, M.M. (2009). A parallel pruned bit-reversal interleaver. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 17(8), 1147\u20131151.","journal-title":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems"},{"key":"721_CR32","volume-title":"Combinatory analysis (Vol. 1\u20132)","author":"P MacMahon","year":"1915","unstructured":"MacMahon, P. (1915). Combinatory analysis (Vol. 1\u20132). Cambridge, Cambridge: Cambridge University Press (Reprinted by Chelsea, New York, 1955)."},{"key":"721_CR33","doi-asserted-by":"crossref","unstructured":"Divsalar, D., & Pollara, F. (1995). Multiple turbo codes. In Military communications conference. MILCOM \u201995, Conference Record, IEEE (Vol. 1, pp. 279\u2013285).","DOI":"10.1109\/MILCOM.1995.483313"},{"key":"721_CR34","volume-title":"The art of computer programming\u2014seminumerical algorithms","author":"D Knuth","year":"1998","unstructured":"Knuth, D. (1998). The art of computer programming\u2014seminumerical algorithms, 3rd Edition. Reading, MA: Addison-Wesley.","edition":"3"},{"issue":"11","key":"721_CR35","doi-asserted-by":"crossref","first-page":"3188","DOI":"10.1109\/TCOMM.2009.11.070661","volume":"57","author":"MM Mansour","year":"2009","unstructured":"Mansour, M.M. (2009). Parallel lookahead algorithms for pruned interleavers. IEEE Transactions on Communications, 57(11), 3188\u20133194.","journal-title":"IEEE Transactions on Communications"},{"key":"721_CR36","doi-asserted-by":"crossref","unstructured":"Ferrari, M., Scalise, F., Bellini, S. (2002). Prunable S-random interleavers. In Proc. IEEE conf. on comm., U.S.A. (Vol. 3, pp. 1711\u20131715).","DOI":"10.1109\/ICC.2002.997141"},{"issue":"5","key":"721_CR37","doi-asserted-by":"crossref","first-page":"2540","DOI":"10.1109\/TWC.2005.853836","volume":"4","author":"L Dinoi","year":"2005","unstructured":"Dinoi, L., & Benedetto, S. (2005). Design of fast-prunable S-random interleavers. IEEE Transactions on Wireless Communications, 4(5), 2540\u20132548.","journal-title":"IEEE Transactions on Wireless Communications"},{"key":"721_CR38","doi-asserted-by":"crossref","unstructured":"Eroz, M., & Hammongs, Jr. A. (1999). On the design of prunable interleavers for turbo codes. In Proc. IEEE vehicular tech. conf. (Vol. 2, pp. 1669\u20131673).","DOI":"10.1109\/VETEC.1999.780687"},{"key":"721_CR39","unstructured":"IEEE Standard for Information technology\u2013Telecommunications and information exchange between systems\u2014Local and metropolitan area networks\u2014Specific requirements Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications Amendment 5: Enhancements for Higher Throughput (2009). IEEE Std 802.11n-2009."}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-012-0721-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11265-012-0721-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-012-0721-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T09:40:02Z","timestamp":1562665202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11265-012-0721-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,10]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["721"],"URL":"https:\/\/doi.org\/10.1007\/s11265-012-0721-3","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"value":"1939-8018","type":"print"},{"value":"1939-8115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,10]]}}}