Spectral partitioning for modular software defined radio

Guidelines for designing and operating modular software defined radio (Mod-SDR) devices gain in importance as the interworking of different radio technologies emerges as a potential solution to achieving short time-to-market and to offering flexible services to mobile users. We continue to study the partitioning and scheduling of software modules in multiprocessor devices. In particular, we focus on spectral partitioning, which is known to yield good partitions for general-purpose parallel computing applications. We discuss a spectral partitioning algorithm in the context of Mod-SDR, comparing it to implicit partitioning results produced by a variant of Hu's algorithm under realistic operating conditions. Test settings include two identical processors connected through either one or two data buses, and pipelining as a signal processing option for delay-insensitive transmission modes. Furthermore, we show how close both approaches come to the theoretical upper bound on two-processor speedup. Based on computer simulations, we can conclude on an enhanced set of guidelines for operating a modular software defined radio.

[1]  Josep Llosa,et al.  Swing module scheduling: a lifetime-sensitive approach , 1996, Proceedings of the 1996 Conference on Parallel Architectures and Compilation Technique.

[2]  Chris H. Q. Ding,et al.  A min-max cut algorithm for graph partitioning and data clustering , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[3]  A. R. Rhiemeier Mathematical Modeling of the Software Radio Design Problem , 2003 .

[4]  Andrew B. Kahng,et al.  New spectral methods for ratio cut partitioning and clustering , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  T. C. Hu Parallel Sequencing and Assembly Line Problems , 1961 .

[6]  Shang-Hua Teng,et al.  Spectral partitioning works: planar graphs and finite element meshes , 1996, Proceedings of 37th Conference on Foundations of Computer Science.