Software Radio has been proposed in the 1990s as the solution to flexible transceiver design for future wireless systems. Potential advantages and drawbacks of this approach have been described and analysed in verbose format in many articles. However, a mathematical perspective of the software radio design problem is to be found in the literature only once. Despite this attempt to develop a sound formal description the conclusions do not reach beyond algorithm design. Open issues in system design are often mentioned, but remain unresolved hitherto. We develop a novel mathematical perspective of software radio, and we formulate the design problem accordingly, by means of an integer linear programming (ILP) representation. This type of problem is well-known in computer science and operations research, but it has never been linked to software radio design before. In a first approach to solve the ILP problem we reduce it to a scheduling problem with processor constraints. In the remainder of the theoretical section we introduce the notions of granularity G and speedup s to assess the quality of modular implementations. A random runtime argument leads the way to a system-theoretic approach to modular design issues such as maximizing speedup over a great number of different implementations. For the special case G = 1 we deduce the speedup potential of a primitive graph in analytical form. In the experimental section we compare simulation results to our theory, and we extend the experiments to a more complicated graph which stems from a real software radio design project. The paper concludes with a discussion and a brief outlook to future research issues.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Arnd-Ragnar RHIEMEIER, Friedrich JONDRAL, "Mathematical Modeling of the Software Radio Design Problem" in IEICE TRANSACTIONS on Communications,
vol. E86-B, no. 12, pp. 3456-3467, December 2003, doi: .
Abstract: Software Radio has been proposed in the 1990s as the solution to flexible transceiver design for future wireless systems. Potential advantages and drawbacks of this approach have been described and analysed in verbose format in many articles. However, a mathematical perspective of the software radio design problem is to be found in the literature only once. Despite this attempt to develop a sound formal description the conclusions do not reach beyond algorithm design. Open issues in system design are often mentioned, but remain unresolved hitherto. We develop a novel mathematical perspective of software radio, and we formulate the design problem accordingly, by means of an integer linear programming (ILP) representation. This type of problem is well-known in computer science and operations research, but it has never been linked to software radio design before. In a first approach to solve the ILP problem we reduce it to a scheduling problem with processor constraints. In the remainder of the theoretical section we introduce the notions of granularity G and speedup s to assess the quality of modular implementations. A random runtime argument leads the way to a system-theoretic approach to modular design issues such as maximizing speedup over a great number of different implementations. For the special case G = 1 we deduce the speedup potential of a primitive graph in analytical form. In the experimental section we compare simulation results to our theory, and we extend the experiments to a more complicated graph which stems from a real software radio design project. The paper concludes with a discussion and a brief outlook to future research issues.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e86-b_12_3456/_p
Copy
@ARTICLE{e86-b_12_3456,
author={Arnd-Ragnar RHIEMEIER, Friedrich JONDRAL, },
journal={IEICE TRANSACTIONS on Communications},
title={Mathematical Modeling of the Software Radio Design Problem},
year={2003},
volume={E86-B},
number={12},
pages={3456-3467},
abstract={Software Radio has been proposed in the 1990s as the solution to flexible transceiver design for future wireless systems. Potential advantages and drawbacks of this approach have been described and analysed in verbose format in many articles. However, a mathematical perspective of the software radio design problem is to be found in the literature only once. Despite this attempt to develop a sound formal description the conclusions do not reach beyond algorithm design. Open issues in system design are often mentioned, but remain unresolved hitherto. We develop a novel mathematical perspective of software radio, and we formulate the design problem accordingly, by means of an integer linear programming (ILP) representation. This type of problem is well-known in computer science and operations research, but it has never been linked to software radio design before. In a first approach to solve the ILP problem we reduce it to a scheduling problem with processor constraints. In the remainder of the theoretical section we introduce the notions of granularity G and speedup s to assess the quality of modular implementations. A random runtime argument leads the way to a system-theoretic approach to modular design issues such as maximizing speedup over a great number of different implementations. For the special case G = 1 we deduce the speedup potential of a primitive graph in analytical form. In the experimental section we compare simulation results to our theory, and we extend the experiments to a more complicated graph which stems from a real software radio design project. The paper concludes with a discussion and a brief outlook to future research issues.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - Mathematical Modeling of the Software Radio Design Problem
T2 - IEICE TRANSACTIONS on Communications
SP - 3456
EP - 3467
AU - Arnd-Ragnar RHIEMEIER
AU - Friedrich JONDRAL
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E86-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2003
AB - Software Radio has been proposed in the 1990s as the solution to flexible transceiver design for future wireless systems. Potential advantages and drawbacks of this approach have been described and analysed in verbose format in many articles. However, a mathematical perspective of the software radio design problem is to be found in the literature only once. Despite this attempt to develop a sound formal description the conclusions do not reach beyond algorithm design. Open issues in system design are often mentioned, but remain unresolved hitherto. We develop a novel mathematical perspective of software radio, and we formulate the design problem accordingly, by means of an integer linear programming (ILP) representation. This type of problem is well-known in computer science and operations research, but it has never been linked to software radio design before. In a first approach to solve the ILP problem we reduce it to a scheduling problem with processor constraints. In the remainder of the theoretical section we introduce the notions of granularity G and speedup s to assess the quality of modular implementations. A random runtime argument leads the way to a system-theoretic approach to modular design issues such as maximizing speedup over a great number of different implementations. For the special case G = 1 we deduce the speedup potential of a primitive graph in analytical form. In the experimental section we compare simulation results to our theory, and we extend the experiments to a more complicated graph which stems from a real software radio design project. The paper concludes with a discussion and a brief outlook to future research issues.
ER -