%T Chaining Communications Algorithms with CSP
%A Oliver Faust, Bernhard H.C. Sputh, David Endler
%E Ian R. East, David Duce, Mark Green, Jeremy M. R. Martin, Peter H. Welch
%B Communicating Process Architectures 2004
%X Software Defined Radio (SDR) requires a reliable, fast and
flexible method to chain parameterisable algorithms.
Communicating Sequential Processes (CSP) is a design
methodology, which offers exactly these properties. This
paper explores the idea of using a Java implementation of
CSP (JCSP) to model a flexible algorithm chain for Software
Defined Radio. JCSP offers the opportunity to distribute
algorithms on different processors in a multiprocessor
environment, which gives a speed up and keeps the system
flexible. If more processing power is required another
processor can be added. In order to cope with the high data
rate requirement of SDR, optimized data transfer schemes
were developed. The goal was to increase the overall system
efficiency by reducing the synchronisation overhead of a
data transfer between two algorithms. To justify the use of
CSP in SDR, a system incorporating CSP was compared with a
conventional system, in single and multiprocessor
If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.
Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.
Pages © WoTUG, or the indicated author. All Rights Reserved.
Comments on these web pages should be addressed to: www at wotug.org