In this paper we investigate performances (bandwidth and speed) that could be obtained using basic logic structures for implementing improved Cooley-Tukey algorithm for IFFT/FFT in transmitter/receiver, as well the approach for implementing OFDM processing unit based on optimized ROM implementation. We implemented these techniques for OFDM in Virtex5 and Viterx7 FPGA boards, and we analyzed the...

Motivated by Tukey classification problems and building on work in Part 1 [5], we develop a new hierarchy of topological Ramsey spaces Rα, α < ω1. These spaces form a natural hierarchy of complexity, R0 being the Ellentuck space [7], and for each α < ω1, Rα+1 coming immediately after Rα in complexity. Associated with each Rα is an ultrafilter Uα, which is Ramsey for Rα, and in particular, is a ...

We study the Tukey layers and convex of a planar point set, which consists n points independently uniformly sampled from polygon with k vertices. show that expected number vertices on first t is O ( log ⁡ / ) 3 2 . also lower bound Ω for both quantities in special cases where = , 4 The implications those results average-case analysis two computational geometry algorithms are then discussed.

We investigate Tukey functions from the ideal of all closed nowhere dense subsets of 2N. In particular, we answer an old question of Isbell and Fremlin by showing that this ideal is not Tukey reducible to the ideal of density zero subsets of N. We also prove non-existence of various special types of Tukey reductions from the nowhere dense ideal to analytic P-ideals. In connection with these res...

Motivated by Tukey classification problems and building on work in [4], we develop a new hierarchy of topological Ramsey spaces Rα, α < ω1. These spaces form a natural hierarchy of complexity, R0 being the Ellentuck space [6], and for each α < ω1, Rα+1 coming immediately afterRα in complexity. Associated with each Rα is an ultrafilter Uα, which is Ramsey for Rα, and in particular, is a rapid p-...