An optimal asynchronous IDMA receiver

Bathiya Senanayake; Mark C. Reed; Zhenning Shi

doi:10.1109/AUSCTW.2009.4805595

An optimal asynchronous IDMA receiver

Bathiya Senanayake^*, Mark C. Reed, Zhenning Shi

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Citations (Scopus)

Abstract

In this paper we develop an optimal receiver for an asynchronous IDMA system. A super-block structure is used to formulate the band diagonal matrix model for asynchronous IDMA. We show that the cost function for the ML decoder can be viewed as a path metric through a structured trellis. We use a dynamic programming algorithm to find the maximum likelihood transmitted bit sequence. We compare the performance of the optimal receiver with the conventional iterative receiver. Our results show that the optimal asynchronous IDMA receiver outperforms the iterative IDMA receiver for the IDMA systems with small block sizes that we simulated.

Original language	English
Title of host publication	Proceedings of the 2009 Australian Communications Theory Workshop, AusCTW 2009
Pages	28-32
Number of pages	5
DOIs	https://doi.org/10.1109/AUSCTW.2009.4805595
Publication status	Published - 2009
Event	2009 Australian Communications Theory Workshop, AusCTW 2009 - Sydney, NSW, Australia Duration: 4 Feb 2009 → 7 Feb 2009

Publication series

Name	Proceedings of the 2009 Australian Communications Theory Workshop, AusCTW 2009

Conference

Conference	2009 Australian Communications Theory Workshop, AusCTW 2009
Country/Territory	Australia
City	Sydney, NSW
Period	4/02/09 → 7/02/09

Access to Document

10.1109/AUSCTW.2009.4805595

Cite this

@inproceedings{53f4d7c544a9486c878b5af16bd47d2e,

title = "An optimal asynchronous IDMA receiver",

abstract = "In this paper we develop an optimal receiver for an asynchronous IDMA system. A super-block structure is used to formulate the band diagonal matrix model for asynchronous IDMA. We show that the cost function for the ML decoder can be viewed as a path metric through a structured trellis. We use a dynamic programming algorithm to find the maximum likelihood transmitted bit sequence. We compare the performance of the optimal receiver with the conventional iterative receiver. Our results show that the optimal asynchronous IDMA receiver outperforms the iterative IDMA receiver for the IDMA systems with small block sizes that we simulated.",

author = "Bathiya Senanayake and Reed, {Mark C.} and Zhenning Shi",

year = "2009",

doi = "10.1109/AUSCTW.2009.4805595",

language = "English",

isbn = "9781424433575",

series = "Proceedings of the 2009 Australian Communications Theory Workshop, AusCTW 2009",

pages = "28--32",

booktitle = "Proceedings of the 2009 Australian Communications Theory Workshop, AusCTW 2009",

note = "2009 Australian Communications Theory Workshop, AusCTW 2009 ; Conference date: 04-02-2009 Through 07-02-2009",

}

Senanayake, B, Reed, MC & Shi, Z 2009, An optimal asynchronous IDMA receiver. in Proceedings of the 2009 Australian Communications Theory Workshop, AusCTW 2009., 4805595, Proceedings of the 2009 Australian Communications Theory Workshop, AusCTW 2009, pp. 28-32, 2009 Australian Communications Theory Workshop, AusCTW 2009, Sydney, NSW, Australia, 4/02/09. https://doi.org/10.1109/AUSCTW.2009.4805595

An optimal asynchronous IDMA receiver. / Senanayake, Bathiya; Reed, Mark C.; Shi, Zhenning.
Proceedings of the 2009 Australian Communications Theory Workshop, AusCTW 2009. 2009. p. 28-32 4805595 (Proceedings of the 2009 Australian Communications Theory Workshop, AusCTW 2009).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - An optimal asynchronous IDMA receiver

AU - Senanayake, Bathiya

AU - Reed, Mark C.

AU - Shi, Zhenning

PY - 2009

Y1 - 2009

N2 - In this paper we develop an optimal receiver for an asynchronous IDMA system. A super-block structure is used to formulate the band diagonal matrix model for asynchronous IDMA. We show that the cost function for the ML decoder can be viewed as a path metric through a structured trellis. We use a dynamic programming algorithm to find the maximum likelihood transmitted bit sequence. We compare the performance of the optimal receiver with the conventional iterative receiver. Our results show that the optimal asynchronous IDMA receiver outperforms the iterative IDMA receiver for the IDMA systems with small block sizes that we simulated.

AB - In this paper we develop an optimal receiver for an asynchronous IDMA system. A super-block structure is used to formulate the band diagonal matrix model for asynchronous IDMA. We show that the cost function for the ML decoder can be viewed as a path metric through a structured trellis. We use a dynamic programming algorithm to find the maximum likelihood transmitted bit sequence. We compare the performance of the optimal receiver with the conventional iterative receiver. Our results show that the optimal asynchronous IDMA receiver outperforms the iterative IDMA receiver for the IDMA systems with small block sizes that we simulated.

UR - http://www.scopus.com/inward/record.url?scp=66249089871&partnerID=8YFLogxK

U2 - 10.1109/AUSCTW.2009.4805595

DO - 10.1109/AUSCTW.2009.4805595

M3 - Conference contribution

SN - 9781424433575

T3 - Proceedings of the 2009 Australian Communications Theory Workshop, AusCTW 2009

SP - 28

EP - 32

BT - Proceedings of the 2009 Australian Communications Theory Workshop, AusCTW 2009

T2 - 2009 Australian Communications Theory Workshop, AusCTW 2009

Y2 - 4 February 2009 through 7 February 2009

ER -

An optimal asynchronous IDMA receiver

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this