Chip-asynchronous version of welch bound: Gaussian pulse improves BER performance

Yutaka Jitsumatsu; Tohru Kohda

doi:10.1007/11863854_31

Chip-asynchronous version of welch bound: Gaussian pulse improves BER performance

Yutaka Jitsumatsu, Tohru Kohda

Mathematical Informatics

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

2 Citations (Scopus)

Abstract

We give a quadratic form expression of the mean squared multiple-access interference (MAI) averaged over relative time delays for chip-asynchronous DS/CDMA systems. A lower bound on the mean squared MAI is referred to as chip-asynchronous version of Welch bound, which depends on chip pulse shapes. Real analysis tells us that a pair of rectangular and sine functions is one of Fourier transform and its inverse Fourier transform and vice versa. On the other hand, Gaussian pulses have the self-duality property. Gaussian chip pulses sacrifice inter-symbol interference, however, they give smaller mean squared MAI, as well as lower bit error rate, than the conventional Nyquist pulses.

Original language	English
Title of host publication	Sequences and Their Applications, SETA 2006 - 4th International Conference, Proceedings
Publisher	Springer Verlag
Pages	351-363
Number of pages	13
ISBN (Print)	3540445234, 9783540445234
DOIs	https://doi.org/10.1007/11863854_31
Publication status	Published - 2006
Event	4th International Conference on Sequences and Their Applications, SETA 2006 - Beijing, China Duration: Sept 24 2006 → Sept 28 2006

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4086 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	4th International Conference on Sequences and Their Applications, SETA 2006
Country/Territory	China
City	Beijing
Period	9/24/06 → 9/28/06

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/11863854_31

Cite this

Jitsumatsu, Y., & Kohda, T. (2006). Chip-asynchronous version of welch bound: Gaussian pulse improves BER performance. In Sequences and Their Applications, SETA 2006 - 4th International Conference, Proceedings (pp. 351-363). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4086 LNCS). Springer Verlag. https://doi.org/10.1007/11863854_31

Chip-asynchronous version of welch bound: Gaussian pulse improves BER performance. / Jitsumatsu, Yutaka; Kohda, Tohru.
Sequences and Their Applications, SETA 2006 - 4th International Conference, Proceedings. Springer Verlag, 2006. p. 351-363 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4086 LNCS).

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

Jitsumatsu, Y & Kohda, T 2006, Chip-asynchronous version of welch bound: Gaussian pulse improves BER performance. in Sequences and Their Applications, SETA 2006 - 4th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4086 LNCS, Springer Verlag, pp. 351-363, 4th International Conference on Sequences and Their Applications, SETA 2006, Beijing, China, 9/24/06. https://doi.org/10.1007/11863854_31

Jitsumatsu Y, Kohda T. Chip-asynchronous version of welch bound: Gaussian pulse improves BER performance. In Sequences and Their Applications, SETA 2006 - 4th International Conference, Proceedings. Springer Verlag. 2006. p. 351-363. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11863854_31

Jitsumatsu, Yutaka ; Kohda, Tohru. / Chip-asynchronous version of welch bound : Gaussian pulse improves BER performance. Sequences and Their Applications, SETA 2006 - 4th International Conference, Proceedings. Springer Verlag, 2006. pp. 351-363 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{ee4118cc89dd4889b7b150282559aa02,

title = "Chip-asynchronous version of welch bound: Gaussian pulse improves BER performance",

abstract = "We give a quadratic form expression of the mean squared multiple-access interference (MAI) averaged over relative time delays for chip-asynchronous DS/CDMA systems. A lower bound on the mean squared MAI is referred to as chip-asynchronous version of Welch bound, which depends on chip pulse shapes. Real analysis tells us that a pair of rectangular and sine functions is one of Fourier transform and its inverse Fourier transform and vice versa. On the other hand, Gaussian pulses have the self-duality property. Gaussian chip pulses sacrifice inter-symbol interference, however, they give smaller mean squared MAI, as well as lower bit error rate, than the conventional Nyquist pulses.",

author = "Yutaka Jitsumatsu and Tohru Kohda",

year = "2006",

doi = "10.1007/11863854_31",

language = "English",

isbn = "3540445234",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "351--363",

booktitle = "Sequences and Their Applications, SETA 2006 - 4th International Conference, Proceedings",

address = "Germany",

note = "4th International Conference on Sequences and Their Applications, SETA 2006 ; Conference date: 24-09-2006 Through 28-09-2006",

}

TY - GEN

T1 - Chip-asynchronous version of welch bound

T2 - 4th International Conference on Sequences and Their Applications, SETA 2006

AU - Jitsumatsu, Yutaka

AU - Kohda, Tohru

PY - 2006

Y1 - 2006

N2 - We give a quadratic form expression of the mean squared multiple-access interference (MAI) averaged over relative time delays for chip-asynchronous DS/CDMA systems. A lower bound on the mean squared MAI is referred to as chip-asynchronous version of Welch bound, which depends on chip pulse shapes. Real analysis tells us that a pair of rectangular and sine functions is one of Fourier transform and its inverse Fourier transform and vice versa. On the other hand, Gaussian pulses have the self-duality property. Gaussian chip pulses sacrifice inter-symbol interference, however, they give smaller mean squared MAI, as well as lower bit error rate, than the conventional Nyquist pulses.

AB - We give a quadratic form expression of the mean squared multiple-access interference (MAI) averaged over relative time delays for chip-asynchronous DS/CDMA systems. A lower bound on the mean squared MAI is referred to as chip-asynchronous version of Welch bound, which depends on chip pulse shapes. Real analysis tells us that a pair of rectangular and sine functions is one of Fourier transform and its inverse Fourier transform and vice versa. On the other hand, Gaussian pulses have the self-duality property. Gaussian chip pulses sacrifice inter-symbol interference, however, they give smaller mean squared MAI, as well as lower bit error rate, than the conventional Nyquist pulses.

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

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

U2 - 10.1007/11863854_31

DO - 10.1007/11863854_31

M3 - Conference contribution

AN - SCOPUS:33749651363

SN - 3540445234

SN - 9783540445234

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 351

EP - 363

BT - Sequences and Their Applications, SETA 2006 - 4th International Conference, Proceedings

PB - Springer Verlag

Y2 - 24 September 2006 through 28 September 2006

ER -

Chip-asynchronous version of welch bound: Gaussian pulse improves BER performance

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this