An algorithm proposal for a minimum cost SDR multi-standard system using graph theory

Abstract : The design of future multi-standard systems remains a challenge due to increasing flexibility requirements. Promising solutions include designing flexible radio architectures that exploit common aspects between the different set of standards cohabiting in the device. In this paper, graph theory appears and particularly the study of directed hypergraphs, which helps in the research concerning minimum cost multistandard designs. A cost function which calculates the cost of any possible option of implementation is mentioned but its derivations won't be in the scope of this paper. Our objective is to optimize this proposed cost function to its minimum possible value and thus solving the optimization problem that finds balance between flexibility and computing efficiency. For this, we propose a Minimum Cost Design (MCD) algorithm capable of selecting the option which has the minimum cost to pay and will present its complete set of instructions in this paper. This algorithm exploits various definitions and notations of directed hypergraphs.
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal-supelec.archives-ouvertes.fr/hal-00679690
Contributor : Anne Cloirec <>
Submitted on : Friday, March 16, 2012 - 10:39:40 AM
Last modification on : Friday, November 16, 2018 - 1:23:37 AM
Long-term archiving on : Monday, June 18, 2012 - 4:34:05 PM

File

WSR2012_KAISER.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00679690, version 1

Citation

Patricia Kaiser, Yves Louet, Amine El Sahili. An algorithm proposal for a minimum cost SDR multi-standard system using graph theory. Workshop on Software radios, Mar 2012, Karlsruhe, Germany. 9 p. ⟨hal-00679690⟩

Share

Metrics

Record views

1048

Files downloads

157