http://ieeexplore.ieee.org TOC Alert for Publication# 26 2009 November 23 57 11 C1 C1 84 57 11 3197 3182 321 57 11 3183 3187 376 n, where n is the smallest integer such that L ⩽ M, such that outlier interleaved addresses greater than L - 1 get pruned away. This pruning operation creates a serial bottleneck since the interleaved address of a linear address χ is now a function of the interleaving operation as well as the number of pruned addresses up to χ. A generic parallel lookahead pruned interleaving scheme that breaks this dependency is proposed. The efficiency of the proposed scheme is demonstrated in the context of both UMB interleavers. An iterative pruned bit-reversal algorithm that interleaves any address in O(log L) steps is presented. Moreover, an iterative pruned turbo interleaving algorithm based on LCSs that interleaves any address in O(log² L) steps is presented.]]> 57 11 3188 3194 298 57 11 3195 3198 264 57 11 3199 3204 359 57 11 3205 3208 521 57 11 3209 3213 301 57 11 3214 3219 327 57 11 3220 3224 337 57 11 3225 3229 258 57 11 3230 3234 308 57 11 3235 3238 273 57 11 3239 3243 432 57 11 3244 3248 325 57 11 3249 3251 200 57 11 3252 3257 283 57 11 3258 3268 841 57 11 3269 3277 507 57 11 3278 3287 462 57 11 3288 3297 608 57 11 3298 3306 479 57 11 3307 3315 508 57 11 3316 3327 460 2(ξ), the 2D joint Gaussian Q-function Q(x, y, p), and the generalized Marcum Q-function Q_M(x, y). The bounds are shown to be tighter than alternatives found in the literature, and in some cases the lower bounds provided find no equivalent in current literature. The generality of the principle is the elegant point of the method and the resulting Jensen-Cotes bounds are easy to implement and evaluate since only elementary transcendental functions are involved. As an example of application to the analysis of communication systems, we consider the bit error rates (BER's) of decode-and-forward (DF) cooperative relaying schemes with coherent and differential phase-shift keying (PSK) modulations, which have been shown to have an intricate dependence on the Gaussian Q-function, complicated by crossproducts, irrational functional arguments and multiple numerical integrations. In that example the bounds substantially reduce the complexity required to evaluate the expressions, retaining tightness despite multiple numerical integrations with infinite limits.i]]> 57 11 3328 3338 1185 57 11 3339 3352 610 57 11 3353 3365 508 57 11 3366 3375 576 57 11 3376 3388 758 57 11 3389 3396 542 57 11 3897 3405 675 57 11 3406 3414 491 57 11 3415 3424 641 57 11 3425 3432 450 57 11 3433 3445 536 57 11 3446 3459 907 57 11 3460 3471 437 57 11 3472 3480 433 57 11 3481 3488 296 57 11 3489 3499 545 57 11 3500 3510 493