Scholarworks Repository

A fast recursive algorithm and architecture for pruned bit-reversal interleavers

Show simple item record Mansour M.M.
dc.contributor.editor 2013 2017-10-04T11:07:17Z 2017-10-04T11:07:17Z 2013
dc.identifier 10.1007/s11265-012-0721-3
dc.identifier.issn 19398018
dc.description.abstract In this paper, pruned bit-reversal permutations employed in variable-length interleavers and their associated fast pruning algorithms and architectures are considered. Pruning permutations is mathematically formulated as a counting problem in a set of k integers and any subset of α consecutive integers under some permutation, where integers from this subset that map into indices less than some β k are to be counted. A solution to this problem using sums involving integer floors and related functions is proposed. It is shown that these sums can be evaluated recursively using integer operations. Specifically, a mathematical treatment for bit-reversal permutations (BRPs) and their permutation statistics are presented. These permutations have been mainly addressed using numerical techniques in the literature to speed up in-place computations of fast Fourier and related transforms. Closed-form expressions for BRP statistics including inversions, serial correlations, and a new statistic called permutation inliers that characterizes the pruning gap of pruned interleavers, are derived. Using the inliers statistic, a recursive algorithm that computes the minimum number of inliers in a pruned BR interleaver (PBRI) in logarithmic time complexity is presented. This algorithm enables parallelizing a serial PBRI algorithm by any desired parallelism factor by computing the pruning gap in lookahead rather than a serial fashion, resulting in significant reduction in interleaving latency and memory overhead. Extensions to 2-D block and stream interleavers are also presented. Moreover, efficient hardware architectures for the proposed algorithms employing simple logic gates are presented. Simulation results of interleavers employed in modern communication standards demonstrate 3 to 4 orders of magnitude improvement in interleaving time compared to existing approaches. © 2013 Springer Science+Business Media New York.
dc.format.extent Pages: (201-219)
dc.language English
dc.publisher NEW YORK
dc.relation.ispartof Publication Name: Journal of Signal Processing Systems; Publication Year: 2013; Volume: 71; no. 3; Pages: (201-219);
dc.source Scopus
dc.title A fast recursive algorithm and architecture for pruned bit-reversal interleavers
dc.type Article
dc.contributor.affiliation Mansour, M.M., ECE Department, American University of Beirut, Beirut, Lebanon
dc.contributor.authorAddress Mansour, M.M.; ECE Department, American University of Beirut, Beirut, Lebanon; email:
dc.contributor.authorCorporate University: American University of Beirut; Faculty: Faculty of Engineering and Architecture; Department: Electrical and Computer Engineering;
dc.contributor.authorDepartment Electrical and Computer Engineering
dc.contributor.authorFaculty Faculty of Engineering and Architecture
dc.contributor.authorInitials Mansour, MM
dc.contributor.authorReprintAddress Mansour, MM (reprint author), Amer Univ Beirut, ECE Dept, Beirut, Lebanon.
dc.contributor.authorUniversity American University of Beirut
dc.description.cited 3rd Generation Partnership Project 2 (3GPP2), 2008, 802202008 3GPP2 IEEE; [Anonymous], 36212 3GPP TS; [Anonymous], 2009, 80211N2009 IEEE; [Anonymous], 2009, 802162009 IEEE; Berrou C., 1993, P IEEE INT C COMM IC, V2, P1064, DOI 10.1109-ICC.1993.397441; BINGHAM JAC, 1990, IEEE COMMUN MAG, V28, P5, DOI 10.1109-35.54342; BISWAS A, 1991, IEEE T SIGNAL PROCES, V39, P1415, DOI 10.1109-78.136547; BURRUS CS, 1988, IEEE T ACOUST SPEECH, V36, P1086, DOI 10.1109-29.1631; COOLEY JW, 1965, MATH COMPUT, V19, P297, DOI 10.2307-2003354; Dinoi L, 2005, IEEE T WIREL COMMUN, V4, P2540, DOI 10.1109-TWC.2005.853836; Divsalar D, 1995, MILCOM 95 - CONFERENCE RECORD, VOLS 1-3, P279, DOI 10.1109-MILCOM.1995.483313; Drouiche K, 2001, IEEE T SIGNAL PROCES, V49, P251, DOI 10.1109-78.890370; Elster A., 1989, INT C AC SPEECH SIGN, V2, P1099; Eroz M, 1999, IEEE VTS VEH TECHNOL, P1669, DOI 10.1109-VETEC.1999.780687; EVANS DMW, 1987, IEEE T ACOUST SPEECH, V35, P1120, DOI 10.1109-TASSP.1987.1165252; Ferrari M, 2002, 2002 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, CONFERENCE PROCEEDINGS, P1711, DOI 10.1109-ICC.2002.997141; FORNEY GD, 1971, IEEE T COMMUN TECHN, VCO19, P772, DOI 10.1109-TCOM.1971.1090719; Garello R, 2001, IEEE T COMMUN, V49, P793, DOI 10.1109-26.923803; JEONG JC, 1992, IEEE T SIGNAL PROCES, V40, P1091, DOI 10.1109-78.134472; Kim K, 1999, IPPS PROC, P268; Knuth D. E., 1998, ART COMPUTER PROGRAM; MacMahon P. A., 1915, COMBINATORY ANAL, VI; Mansour MM, 2009, IEEE T COMMUN, V57, P3188, DOI 10.1109-TCOMM.2009.11.070661; Mansour MM, 2009, IEEE T VLSI SYST, V17, P1147, DOI 10.1109-TVLSI.2008.2008831; Mansour M.M., 2012, P IEEE INT C AC SPEE; ORCHARD M, 1992, IEEE T SIGNAL PROCES, V40, P1004, DOI 10.1109-78.127979; Parsons A, 2009, IEEE SIGNAL PROC LET, V16, P477, DOI 10.1109-LSP.2009.2016836; Pei SC, 2007, IEEE T SIGNAL PROCES, V55, P1173, DOI 10.1109-TSP.2006.887567; POLGE RJ, 1974, IEEE T COMPUT, VC 23, P1, DOI 10.1109-T-C.1974.223771; Portnoff MR, 1999, IEEE T IMAGE PROCESS, V8, P1265, DOI 10.1109-83.784438; Prado J, 2004, IEEE SIGNAL PROC LET, V11, P933, DOI 10.1109-LSP.2004.838211; RAMSEY JL, 1970, IEEE T INFORM THEORY, V16, P338, DOI 10.1109-TIT.1970.1054443; RIUS JM, 1995, IEEE T SIGNAL PROCES, V43, P991, DOI 10.1109-78.376852; Rodriguez J., 1988, INT C AC SPEECH SIGN, V3, P1407; SKODRAS AN, 1991, ELECTRON LETT, V27, P1973, DOI 10.1049-el:19911222; Sun J, 2005, IEEE T INFORM THEORY, V51, P101, DOI 10.1109-TIT.2004.839478; Verbauwhede I., 1991, Journal of VLSI Signal Processing, V3, DOI 10.1007-BF00925830; YONG AA, 1991, IEEE T SIGNAL PROCES, V39, P2365, DOI 10.1109-78.91199; ZEHAVI E, 1992, IEEE T COMMUN, V40, P873, DOI 10.1109-26.141453
dc.description.citedTotWOSCount 0
dc.description.citedWOSCount 0
dc.format.extentCount 19
dc.identifier.scopusID 84879696497
dc.publisher.address 233 SPRING ST, NEW YORK, NY 10013 USA
dc.relation.ispartOfISOAbbr J. Signal Process. Syst. Signal Image Video Technol.
dc.relation.ispartOfIssue 3
dc.relation.ispartofPubTitle Journal of Signal Processing Systems
dc.relation.ispartofPubTitleAbbr J. Signal Process Syst.
dc.relation.ispartOfVolume 71
dc.source.ID WOS:000316745200004
dc.type.publication Journal
dc.subject.otherAuthKeyword Bit-reversal permutations
dc.subject.otherAuthKeyword Permutation statistics
dc.subject.otherAuthKeyword Pruned interleavers
dc.subject.otherAuthKeyword Turbo interleavers
dc.subject.otherIndex Bit-reversal permutations
dc.subject.otherIndex Closed-form expression
dc.subject.otherIndex Communication standards
dc.subject.otherIndex Fast recursive algorithms
dc.subject.otherIndex Interleavers
dc.subject.otherIndex Mathematical treatments
dc.subject.otherIndex Permutation statistic
dc.subject.otherIndex Pruned interleavers
dc.subject.otherIndex Algorithms
dc.subject.otherIndex Computational complexity
dc.subject.otherIndex Fast Fourier transforms
dc.subject.otherIndex Statistics
dc.subject.otherIndex Turbo codes
dc.subject.otherKeywordPlus TURBO CODES
dc.subject.otherKeywordPlus PERMUTATION ALGORITHM
dc.subject.otherKeywordPlus FFT
dc.subject.otherKeywordPlus CHANNEL
dc.subject.otherKeywordPlus FOURIER
dc.subject.otherKeywordPlus DESIGN
dc.subject.otherWOS Computer Science, Information Systems
dc.subject.otherWOS Engineering, Electrical and Electronic

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search Scholarworks


My Account