## Abstract

A field-programmable gate array (FPGA) implementation of a new algorithm for multiuser detection (MUD) is presented in this paper. This FPGA design is based on the Dichotomous Coordinate Descent (DCD)algorithm. The DCD algorithm) allows the multiplication-free solution of the normal equations appearing in the MUD problem. This results in an area-efficient FPGA design that requires about 400 slices and offers a constant throughput over a signal-to-noise ratio range. Results obtained front the fixed-point FPGA implementation are compared with those of a floating-point implementation. The bit-error-rate performance comparison shows good match of the results for as large number of users as 50.

Original language | English |
---|---|

Title of host publication | Proceedings of the 2007 15th International Conference on Digital Signal Processing |

Editors | S Sanei, JA Chambers, J McWhirter, Y Hicks, AG Constantinides |

Place of Publication | NEW YORK |

Publisher | IEEE |

Pages | 319-322 |

Number of pages | 4 |

ISBN (Print) | 978-1-4244-0881-8 |

Publication status | Published - 2007 |

Event | 15th International Conference on Digital Signal Processing - Cardiff Duration: 1 Jul 2007 → 4 Jul 2007 |

### Conference

Conference | 15th International Conference on Digital Signal Processing |
---|---|

City | Cardiff |

Period | 1/07/07 → 4/07/07 |

## Keywords

- FPGA
- CDMA
- multiuser detection
- DCD
- COMPLEXITY
- ALGORITHM