Performance bounds for DS/SSMA communications with complex signature sequences
A unified performance analysis of direct-sequence spread-spectrum multiple-access (DS/SSMA) communications with deterministic complex signature sequences is presented. The probability density function (PDF) of the multiple-user interference is determined. Using a round-down and round-up procedure on...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on communications 1992-10, Vol.40 (10), p.1607-1614 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1614 |
|---|---|
| container_issue | 10 |
| container_start_page | 1607 |
| container_title | IEEE transactions on communications |
| container_volume | 40 |
| creator | Lam, A.W. Ozluturk, F.M. |
| description | A unified performance analysis of direct-sequence spread-spectrum multiple-access (DS/SSMA) communications with deterministic complex signature sequences is presented. The probability density function (PDF) of the multiple-user interference is determined. Using a round-down and round-up procedure on the PDF, arbitrarily tight lower and upper bounds on the probability of bit error (PBE) are obtained. Results based on the Gaussian approximation method are also presented. It is shown that complex sequences can yield better PBE performance than binary sequences. Using complex sequences, the number of signature sequences that have good auto- and cross-correlation properties is greatly enlarged. New users employing complex or binary signature sequences can be added to existing systems with graceful performance degradation.< > |
| doi_str_mv | 10.1109/26.168791 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_168791</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>168791</ieee_id><sourcerecordid>25815296</sourcerecordid><originalsourceid>FETCH-LOGICAL-c337t-599b7a9abcf47a03708a3b6f97a87830b93f37a5d3500893d313dee792a08db23</originalsourceid><addsrcrecordid>eNqFkEtLxDAQgIMouK4evHrqQQQPdSdN0yTHZX3C-oDVc0nTqUb6WJMW9d-bpYsePYUJ33wDHyHHFC4oBTVLsguaSaHoDplQzmUMkotdMgFQEGdCyH1y4P07AKTA2IQ8PKGrOtfo1mBUdENb-ijM0eVqtlrdzyPTNc3QWqN727U--rT92-ZvXeNX5O1rq_vBYeTxY8Bg8Idkr9K1x6PtOyUv11fPi9t4-Xhzt5gvY8OY6GOuVCG00oWpUqGBCZCaFVmlhJZCMigUq5jQvGQcQCpWMspKRKESDbIsEjYlZ6N37bpw2vd5Y73ButYtdoPPE8lTkCL9H-SS8kRlATwfQeM67x1W-drZRrvvnEK-SZsnWT6mDezpVqq90XXlQj3rfxfSNOMhbsBORswi4p9udPwAzBh_4w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>25815296</pqid></control><display><type>article</type><title>Performance bounds for DS/SSMA communications with complex signature sequences</title><source>IEEE Electronic Library (IEL)</source><creator>Lam, A.W. ; Ozluturk, F.M.</creator><creatorcontrib>Lam, A.W. ; Ozluturk, F.M.</creatorcontrib><description>A unified performance analysis of direct-sequence spread-spectrum multiple-access (DS/SSMA) communications with deterministic complex signature sequences is presented. The probability density function (PDF) of the multiple-user interference is determined. Using a round-down and round-up procedure on the PDF, arbitrarily tight lower and upper bounds on the probability of bit error (PBE) are obtained. Results based on the Gaussian approximation method are also presented. It is shown that complex sequences can yield better PBE performance than binary sequences. Using complex sequences, the number of signature sequences that have good auto- and cross-correlation properties is greatly enlarged. New users employing complex or binary signature sequences can be added to existing systems with graceful performance degradation.< ></description><identifier>ISSN: 0090-6778</identifier><identifier>EISSN: 1558-0857</identifier><identifier>DOI: 10.1109/26.168791</identifier><identifier>CODEN: IECMBT</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Binary sequences ; Degradation ; Exact sciences and technology ; Gaussian approximation ; Information, signal and communications theory ; Military computing ; Performance analysis ; Phase modulation ; Probability density function ; Signal and communications theory ; Signal representation. Spectral analysis ; Signal, noise ; Spread spectrum communication ; System performance ; Telecommunications and information theory ; Upper bound</subject><ispartof>IEEE transactions on communications, 1992-10, Vol.40 (10), p.1607-1614</ispartof><rights>1993 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c337t-599b7a9abcf47a03708a3b6f97a87830b93f37a5d3500893d313dee792a08db23</citedby><cites>FETCH-LOGICAL-c337t-599b7a9abcf47a03708a3b6f97a87830b93f37a5d3500893d313dee792a08db23</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/168791$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27923,27924,54757</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/168791$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=4465033$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Lam, A.W.</creatorcontrib><creatorcontrib>Ozluturk, F.M.</creatorcontrib><title>Performance bounds for DS/SSMA communications with complex signature sequences</title><title>IEEE transactions on communications</title><addtitle>TCOMM</addtitle><description>A unified performance analysis of direct-sequence spread-spectrum multiple-access (DS/SSMA) communications with deterministic complex signature sequences is presented. The probability density function (PDF) of the multiple-user interference is determined. Using a round-down and round-up procedure on the PDF, arbitrarily tight lower and upper bounds on the probability of bit error (PBE) are obtained. Results based on the Gaussian approximation method are also presented. It is shown that complex sequences can yield better PBE performance than binary sequences. Using complex sequences, the number of signature sequences that have good auto- and cross-correlation properties is greatly enlarged. New users employing complex or binary signature sequences can be added to existing systems with graceful performance degradation.< ></description><subject>Applied sciences</subject><subject>Binary sequences</subject><subject>Degradation</subject><subject>Exact sciences and technology</subject><subject>Gaussian approximation</subject><subject>Information, signal and communications theory</subject><subject>Military computing</subject><subject>Performance analysis</subject><subject>Phase modulation</subject><subject>Probability density function</subject><subject>Signal and communications theory</subject><subject>Signal representation. Spectral analysis</subject><subject>Signal, noise</subject><subject>Spread spectrum communication</subject><subject>System performance</subject><subject>Telecommunications and information theory</subject><subject>Upper bound</subject><issn>0090-6778</issn><issn>1558-0857</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1992</creationdate><recordtype>article</recordtype><recordid>eNqFkEtLxDAQgIMouK4evHrqQQQPdSdN0yTHZX3C-oDVc0nTqUb6WJMW9d-bpYsePYUJ33wDHyHHFC4oBTVLsguaSaHoDplQzmUMkotdMgFQEGdCyH1y4P07AKTA2IQ8PKGrOtfo1mBUdENb-ijM0eVqtlrdzyPTNc3QWqN727U--rT92-ZvXeNX5O1rq_vBYeTxY8Bg8Idkr9K1x6PtOyUv11fPi9t4-Xhzt5gvY8OY6GOuVCG00oWpUqGBCZCaFVmlhJZCMigUq5jQvGQcQCpWMspKRKESDbIsEjYlZ6N37bpw2vd5Y73ButYtdoPPE8lTkCL9H-SS8kRlATwfQeM67x1W-drZRrvvnEK-SZsnWT6mDezpVqq90XXlQj3rfxfSNOMhbsBORswi4p9udPwAzBh_4w</recordid><startdate>19921001</startdate><enddate>19921001</enddate><creator>Lam, A.W.</creator><creator>Ozluturk, F.M.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19921001</creationdate><title>Performance bounds for DS/SSMA communications with complex signature sequences</title><author>Lam, A.W. ; Ozluturk, F.M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c337t-599b7a9abcf47a03708a3b6f97a87830b93f37a5d3500893d313dee792a08db23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1992</creationdate><topic>Applied sciences</topic><topic>Binary sequences</topic><topic>Degradation</topic><topic>Exact sciences and technology</topic><topic>Gaussian approximation</topic><topic>Information, signal and communications theory</topic><topic>Military computing</topic><topic>Performance analysis</topic><topic>Phase modulation</topic><topic>Probability density function</topic><topic>Signal and communications theory</topic><topic>Signal representation. Spectral analysis</topic><topic>Signal, noise</topic><topic>Spread spectrum communication</topic><topic>System performance</topic><topic>Telecommunications and information theory</topic><topic>Upper bound</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lam, A.W.</creatorcontrib><creatorcontrib>Ozluturk, F.M.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Lam, A.W.</au><au>Ozluturk, F.M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Performance bounds for DS/SSMA communications with complex signature sequences</atitle><jtitle>IEEE transactions on communications</jtitle><stitle>TCOMM</stitle><date>1992-10-01</date><risdate>1992</risdate><volume>40</volume><issue>10</issue><spage>1607</spage><epage>1614</epage><pages>1607-1614</pages><issn>0090-6778</issn><eissn>1558-0857</eissn><coden>IECMBT</coden><abstract>A unified performance analysis of direct-sequence spread-spectrum multiple-access (DS/SSMA) communications with deterministic complex signature sequences is presented. The probability density function (PDF) of the multiple-user interference is determined. Using a round-down and round-up procedure on the PDF, arbitrarily tight lower and upper bounds on the probability of bit error (PBE) are obtained. Results based on the Gaussian approximation method are also presented. It is shown that complex sequences can yield better PBE performance than binary sequences. Using complex sequences, the number of signature sequences that have good auto- and cross-correlation properties is greatly enlarged. New users employing complex or binary signature sequences can be added to existing systems with graceful performance degradation.< ></abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/26.168791</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0090-6778 |
| ispartof | IEEE transactions on communications, 1992-10, Vol.40 (10), p.1607-1614 |
| issn | 0090-6778 1558-0857 |
| language | eng |
| recordid | cdi_ieee_primary_168791 |
| source | IEEE Electronic Library (IEL) |
| subjects | Applied sciences Binary sequences Degradation Exact sciences and technology Gaussian approximation Information, signal and communications theory Military computing Performance analysis Phase modulation Probability density function Signal and communications theory Signal representation. Spectral analysis Signal, noise Spread spectrum communication System performance Telecommunications and information theory Upper bound |
| title | Performance bounds for DS/SSMA communications with complex signature sequences |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T07%3A01%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Performance%20bounds%20for%20DS/SSMA%20communications%20with%20complex%20signature%20sequences&rft.jtitle=IEEE%20transactions%20on%20communications&rft.au=Lam,%20A.W.&rft.date=1992-10-01&rft.volume=40&rft.issue=10&rft.spage=1607&rft.epage=1614&rft.pages=1607-1614&rft.issn=0090-6778&rft.eissn=1558-0857&rft.coden=IECMBT&rft_id=info:doi/10.1109/26.168791&rft_dat=%3Cproquest_RIE%3E25815296%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=25815296&rft_id=info:pmid/&rft_ieee_id=168791&rfr_iscdi=true |