The Linearly Constrained LSCMA for Blind Multi-user Detection
Abstract The least square constant modulus algorithm (LSCMA) is a popular constant modulus algorithm (CMA) because of its global convergence and stability. But the performance will degrade when it is affected by the problem of interference capture in the MC-CDMA system that has several constant modu...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Meng, Yan [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2009 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media, LLC. 2009 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Wireless personal communications - Springer US, 1994, 53(2009), 2 vom: 24. März, Seite 199-209 |
|---|---|
| Übergeordnetes Werk: |
volume:53 ; year:2009 ; number:2 ; day:24 ; month:03 ; pages:199-209 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11277-009-9679-2 |
|---|
| Katalog-ID: |
OLC205376421X |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC205376421X | ||
| 003 | DE-627 | ||
| 005 | 20230504074748.0 | ||
| 007 | tu | ||
| 008 | 200819s2009 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11277-009-9679-2 |2 doi | |
| 035 | |a (DE-627)OLC205376421X | ||
| 035 | |a (DE-He213)s11277-009-9679-2-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 620 |q VZ |
| 100 | 1 | |a Meng, Yan |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a The Linearly Constrained LSCMA for Blind Multi-user Detection |
| 264 | 1 | |c 2009 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media, LLC. 2009 | ||
| 520 | |a Abstract The least square constant modulus algorithm (LSCMA) is a popular constant modulus algorithm (CMA) because of its global convergence and stability. But the performance will degrade when it is affected by the problem of interference capture in the MC-CDMA system that has several constant modulus signals. In order to overcome this shortage, a linearly constrained LSCMA multiuser detection algorithm is proposed by using the spreading code of the desired user to impose linear constraint on the LSCMA. The proposed algorithm ensures the algorithm convergence to the desired user. Thus the performance of the system is improved. The simulation results demonstrate that the proposed algorithm offers faster convergence rate and provides better output signal-to-interference-plus-noise-ratio (SINR) and bit error rate (BER) performance compared with the traditional LSCMA. | ||
| 650 | 4 | |a MC-CDMA | |
| 650 | 4 | |a Multiuser detection | |
| 650 | 4 | |a CMA | |
| 650 | 4 | |a LSCMA | |
| 700 | 1 | |a You, Ming-li |4 aut | |
| 700 | 1 | |a Luo, Han-wen |4 aut | |
| 700 | 1 | |a Liu, Gang |4 aut | |
| 700 | 1 | |a Yang, Tao |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Wireless personal communications |d Springer US, 1994 |g 53(2009), 2 vom: 24. März, Seite 199-209 |w (DE-627)188950273 |w (DE-600)1287489-9 |w (DE-576)049958909 |x 0929-6212 |7 nnns |
| 773 | 1 | 8 | |g volume:53 |g year:2009 |g number:2 |g day:24 |g month:03 |g pages:199-209 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s11277-009-9679-2 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MKW | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2006 | ||
| 912 | |a GBV_ILN_4266 | ||
| 912 | |a GBV_ILN_4307 | ||
| 951 | |a AR | ||
| 952 | |d 53 |j 2009 |e 2 |b 24 |c 03 |h 199-209 | ||
| author_variant |
y m ym m l y mly h w l hwl g l gl t y ty |
|---|---|
| matchkey_str |
article:09296212:2009----::hlnalcntandsmfrlnml |
| hierarchy_sort_str |
2009 |
| publishDate |
2009 |
| allfields |
10.1007/s11277-009-9679-2 doi (DE-627)OLC205376421X (DE-He213)s11277-009-9679-2-p DE-627 ger DE-627 rakwb eng 620 VZ Meng, Yan verfasserin aut The Linearly Constrained LSCMA for Blind Multi-user Detection 2009 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC. 2009 Abstract The least square constant modulus algorithm (LSCMA) is a popular constant modulus algorithm (CMA) because of its global convergence and stability. But the performance will degrade when it is affected by the problem of interference capture in the MC-CDMA system that has several constant modulus signals. In order to overcome this shortage, a linearly constrained LSCMA multiuser detection algorithm is proposed by using the spreading code of the desired user to impose linear constraint on the LSCMA. The proposed algorithm ensures the algorithm convergence to the desired user. Thus the performance of the system is improved. The simulation results demonstrate that the proposed algorithm offers faster convergence rate and provides better output signal-to-interference-plus-noise-ratio (SINR) and bit error rate (BER) performance compared with the traditional LSCMA. MC-CDMA Multiuser detection CMA LSCMA You, Ming-li aut Luo, Han-wen aut Liu, Gang aut Yang, Tao aut Enthalten in Wireless personal communications Springer US, 1994 53(2009), 2 vom: 24. März, Seite 199-209 (DE-627)188950273 (DE-600)1287489-9 (DE-576)049958909 0929-6212 nnns volume:53 year:2009 number:2 day:24 month:03 pages:199-209 https://doi.org/10.1007/s11277-009-9679-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MKW GBV_ILN_70 GBV_ILN_2006 GBV_ILN_4266 GBV_ILN_4307 AR 53 2009 2 24 03 199-209 |
| spelling |
10.1007/s11277-009-9679-2 doi (DE-627)OLC205376421X (DE-He213)s11277-009-9679-2-p DE-627 ger DE-627 rakwb eng 620 VZ Meng, Yan verfasserin aut The Linearly Constrained LSCMA for Blind Multi-user Detection 2009 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC. 2009 Abstract The least square constant modulus algorithm (LSCMA) is a popular constant modulus algorithm (CMA) because of its global convergence and stability. But the performance will degrade when it is affected by the problem of interference capture in the MC-CDMA system that has several constant modulus signals. In order to overcome this shortage, a linearly constrained LSCMA multiuser detection algorithm is proposed by using the spreading code of the desired user to impose linear constraint on the LSCMA. The proposed algorithm ensures the algorithm convergence to the desired user. Thus the performance of the system is improved. The simulation results demonstrate that the proposed algorithm offers faster convergence rate and provides better output signal-to-interference-plus-noise-ratio (SINR) and bit error rate (BER) performance compared with the traditional LSCMA. MC-CDMA Multiuser detection CMA LSCMA You, Ming-li aut Luo, Han-wen aut Liu, Gang aut Yang, Tao aut Enthalten in Wireless personal communications Springer US, 1994 53(2009), 2 vom: 24. März, Seite 199-209 (DE-627)188950273 (DE-600)1287489-9 (DE-576)049958909 0929-6212 nnns volume:53 year:2009 number:2 day:24 month:03 pages:199-209 https://doi.org/10.1007/s11277-009-9679-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MKW GBV_ILN_70 GBV_ILN_2006 GBV_ILN_4266 GBV_ILN_4307 AR 53 2009 2 24 03 199-209 |
| allfields_unstemmed |
10.1007/s11277-009-9679-2 doi (DE-627)OLC205376421X (DE-He213)s11277-009-9679-2-p DE-627 ger DE-627 rakwb eng 620 VZ Meng, Yan verfasserin aut The Linearly Constrained LSCMA for Blind Multi-user Detection 2009 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC. 2009 Abstract The least square constant modulus algorithm (LSCMA) is a popular constant modulus algorithm (CMA) because of its global convergence and stability. But the performance will degrade when it is affected by the problem of interference capture in the MC-CDMA system that has several constant modulus signals. In order to overcome this shortage, a linearly constrained LSCMA multiuser detection algorithm is proposed by using the spreading code of the desired user to impose linear constraint on the LSCMA. The proposed algorithm ensures the algorithm convergence to the desired user. Thus the performance of the system is improved. The simulation results demonstrate that the proposed algorithm offers faster convergence rate and provides better output signal-to-interference-plus-noise-ratio (SINR) and bit error rate (BER) performance compared with the traditional LSCMA. MC-CDMA Multiuser detection CMA LSCMA You, Ming-li aut Luo, Han-wen aut Liu, Gang aut Yang, Tao aut Enthalten in Wireless personal communications Springer US, 1994 53(2009), 2 vom: 24. März, Seite 199-209 (DE-627)188950273 (DE-600)1287489-9 (DE-576)049958909 0929-6212 nnns volume:53 year:2009 number:2 day:24 month:03 pages:199-209 https://doi.org/10.1007/s11277-009-9679-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MKW GBV_ILN_70 GBV_ILN_2006 GBV_ILN_4266 GBV_ILN_4307 AR 53 2009 2 24 03 199-209 |
| allfieldsGer |
10.1007/s11277-009-9679-2 doi (DE-627)OLC205376421X (DE-He213)s11277-009-9679-2-p DE-627 ger DE-627 rakwb eng 620 VZ Meng, Yan verfasserin aut The Linearly Constrained LSCMA for Blind Multi-user Detection 2009 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC. 2009 Abstract The least square constant modulus algorithm (LSCMA) is a popular constant modulus algorithm (CMA) because of its global convergence and stability. But the performance will degrade when it is affected by the problem of interference capture in the MC-CDMA system that has several constant modulus signals. In order to overcome this shortage, a linearly constrained LSCMA multiuser detection algorithm is proposed by using the spreading code of the desired user to impose linear constraint on the LSCMA. The proposed algorithm ensures the algorithm convergence to the desired user. Thus the performance of the system is improved. The simulation results demonstrate that the proposed algorithm offers faster convergence rate and provides better output signal-to-interference-plus-noise-ratio (SINR) and bit error rate (BER) performance compared with the traditional LSCMA. MC-CDMA Multiuser detection CMA LSCMA You, Ming-li aut Luo, Han-wen aut Liu, Gang aut Yang, Tao aut Enthalten in Wireless personal communications Springer US, 1994 53(2009), 2 vom: 24. März, Seite 199-209 (DE-627)188950273 (DE-600)1287489-9 (DE-576)049958909 0929-6212 nnns volume:53 year:2009 number:2 day:24 month:03 pages:199-209 https://doi.org/10.1007/s11277-009-9679-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MKW GBV_ILN_70 GBV_ILN_2006 GBV_ILN_4266 GBV_ILN_4307 AR 53 2009 2 24 03 199-209 |
| allfieldsSound |
10.1007/s11277-009-9679-2 doi (DE-627)OLC205376421X (DE-He213)s11277-009-9679-2-p DE-627 ger DE-627 rakwb eng 620 VZ Meng, Yan verfasserin aut The Linearly Constrained LSCMA for Blind Multi-user Detection 2009 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC. 2009 Abstract The least square constant modulus algorithm (LSCMA) is a popular constant modulus algorithm (CMA) because of its global convergence and stability. But the performance will degrade when it is affected by the problem of interference capture in the MC-CDMA system that has several constant modulus signals. In order to overcome this shortage, a linearly constrained LSCMA multiuser detection algorithm is proposed by using the spreading code of the desired user to impose linear constraint on the LSCMA. The proposed algorithm ensures the algorithm convergence to the desired user. Thus the performance of the system is improved. The simulation results demonstrate that the proposed algorithm offers faster convergence rate and provides better output signal-to-interference-plus-noise-ratio (SINR) and bit error rate (BER) performance compared with the traditional LSCMA. MC-CDMA Multiuser detection CMA LSCMA You, Ming-li aut Luo, Han-wen aut Liu, Gang aut Yang, Tao aut Enthalten in Wireless personal communications Springer US, 1994 53(2009), 2 vom: 24. März, Seite 199-209 (DE-627)188950273 (DE-600)1287489-9 (DE-576)049958909 0929-6212 nnns volume:53 year:2009 number:2 day:24 month:03 pages:199-209 https://doi.org/10.1007/s11277-009-9679-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MKW GBV_ILN_70 GBV_ILN_2006 GBV_ILN_4266 GBV_ILN_4307 AR 53 2009 2 24 03 199-209 |
| language |
English |
| source |
Enthalten in Wireless personal communications 53(2009), 2 vom: 24. März, Seite 199-209 volume:53 year:2009 number:2 day:24 month:03 pages:199-209 |
| sourceStr |
Enthalten in Wireless personal communications 53(2009), 2 vom: 24. März, Seite 199-209 volume:53 year:2009 number:2 day:24 month:03 pages:199-209 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
MC-CDMA Multiuser detection CMA LSCMA |
| dewey-raw |
620 |
| isfreeaccess_bool |
false |
| container_title |
Wireless personal communications |
| authorswithroles_txt_mv |
Meng, Yan @@aut@@ You, Ming-li @@aut@@ Luo, Han-wen @@aut@@ Liu, Gang @@aut@@ Yang, Tao @@aut@@ |
| publishDateDaySort_date |
2009-03-24T00:00:00Z |
| hierarchy_top_id |
188950273 |
| dewey-sort |
3620 |
| id |
OLC205376421X |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC205376421X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504074748.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2009 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11277-009-9679-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC205376421X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11277-009-9679-2-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Meng, Yan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The Linearly Constrained LSCMA for Blind Multi-user Detection</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2009</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC. 2009</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The least square constant modulus algorithm (LSCMA) is a popular constant modulus algorithm (CMA) because of its global convergence and stability. But the performance will degrade when it is affected by the problem of interference capture in the MC-CDMA system that has several constant modulus signals. In order to overcome this shortage, a linearly constrained LSCMA multiuser detection algorithm is proposed by using the spreading code of the desired user to impose linear constraint on the LSCMA. The proposed algorithm ensures the algorithm convergence to the desired user. Thus the performance of the system is improved. The simulation results demonstrate that the proposed algorithm offers faster convergence rate and provides better output signal-to-interference-plus-noise-ratio (SINR) and bit error rate (BER) performance compared with the traditional LSCMA.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">MC-CDMA</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiuser detection</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">CMA</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">LSCMA</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">You, Ming-li</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Luo, Han-wen</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liu, Gang</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yang, Tao</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Wireless personal communications</subfield><subfield code="d">Springer US, 1994</subfield><subfield code="g">53(2009), 2 vom: 24. März, Seite 199-209</subfield><subfield code="w">(DE-627)188950273</subfield><subfield code="w">(DE-600)1287489-9</subfield><subfield code="w">(DE-576)049958909</subfield><subfield code="x">0929-6212</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:53</subfield><subfield code="g">year:2009</subfield><subfield code="g">number:2</subfield><subfield code="g">day:24</subfield><subfield code="g">month:03</subfield><subfield code="g">pages:199-209</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11277-009-9679-2</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MKW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">53</subfield><subfield code="j">2009</subfield><subfield code="e">2</subfield><subfield code="b">24</subfield><subfield code="c">03</subfield><subfield code="h">199-209</subfield></datafield></record></collection>
|
| author |
Meng, Yan |
| spellingShingle |
Meng, Yan ddc 620 misc MC-CDMA misc Multiuser detection misc CMA misc LSCMA The Linearly Constrained LSCMA for Blind Multi-user Detection |
| authorStr |
Meng, Yan |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)188950273 |
| format |
Article |
| dewey-ones |
620 - Engineering & allied operations |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0929-6212 |
| topic_title |
620 VZ The Linearly Constrained LSCMA for Blind Multi-user Detection MC-CDMA Multiuser detection CMA LSCMA |
| topic |
ddc 620 misc MC-CDMA misc Multiuser detection misc CMA misc LSCMA |
| topic_unstemmed |
ddc 620 misc MC-CDMA misc Multiuser detection misc CMA misc LSCMA |
| topic_browse |
ddc 620 misc MC-CDMA misc Multiuser detection misc CMA misc LSCMA |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Wireless personal communications |
| hierarchy_parent_id |
188950273 |
| dewey-tens |
620 - Engineering |
| hierarchy_top_title |
Wireless personal communications |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)188950273 (DE-600)1287489-9 (DE-576)049958909 |
| title |
The Linearly Constrained LSCMA for Blind Multi-user Detection |
| ctrlnum |
(DE-627)OLC205376421X (DE-He213)s11277-009-9679-2-p |
| title_full |
The Linearly Constrained LSCMA for Blind Multi-user Detection |
| author_sort |
Meng, Yan |
| journal |
Wireless personal communications |
| journalStr |
Wireless personal communications |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
600 - Technology |
| recordtype |
marc |
| publishDateSort |
2009 |
| contenttype_str_mv |
txt |
| container_start_page |
199 |
| author_browse |
Meng, Yan You, Ming-li Luo, Han-wen Liu, Gang Yang, Tao |
| container_volume |
53 |
| class |
620 VZ |
| format_se |
Aufsätze |
| author-letter |
Meng, Yan |
| doi_str_mv |
10.1007/s11277-009-9679-2 |
| dewey-full |
620 |
| title_sort |
the linearly constrained lscma for blind multi-user detection |
| title_auth |
The Linearly Constrained LSCMA for Blind Multi-user Detection |
| abstract |
Abstract The least square constant modulus algorithm (LSCMA) is a popular constant modulus algorithm (CMA) because of its global convergence and stability. But the performance will degrade when it is affected by the problem of interference capture in the MC-CDMA system that has several constant modulus signals. In order to overcome this shortage, a linearly constrained LSCMA multiuser detection algorithm is proposed by using the spreading code of the desired user to impose linear constraint on the LSCMA. The proposed algorithm ensures the algorithm convergence to the desired user. Thus the performance of the system is improved. The simulation results demonstrate that the proposed algorithm offers faster convergence rate and provides better output signal-to-interference-plus-noise-ratio (SINR) and bit error rate (BER) performance compared with the traditional LSCMA. © Springer Science+Business Media, LLC. 2009 |
| abstractGer |
Abstract The least square constant modulus algorithm (LSCMA) is a popular constant modulus algorithm (CMA) because of its global convergence and stability. But the performance will degrade when it is affected by the problem of interference capture in the MC-CDMA system that has several constant modulus signals. In order to overcome this shortage, a linearly constrained LSCMA multiuser detection algorithm is proposed by using the spreading code of the desired user to impose linear constraint on the LSCMA. The proposed algorithm ensures the algorithm convergence to the desired user. Thus the performance of the system is improved. The simulation results demonstrate that the proposed algorithm offers faster convergence rate and provides better output signal-to-interference-plus-noise-ratio (SINR) and bit error rate (BER) performance compared with the traditional LSCMA. © Springer Science+Business Media, LLC. 2009 |
| abstract_unstemmed |
Abstract The least square constant modulus algorithm (LSCMA) is a popular constant modulus algorithm (CMA) because of its global convergence and stability. But the performance will degrade when it is affected by the problem of interference capture in the MC-CDMA system that has several constant modulus signals. In order to overcome this shortage, a linearly constrained LSCMA multiuser detection algorithm is proposed by using the spreading code of the desired user to impose linear constraint on the LSCMA. The proposed algorithm ensures the algorithm convergence to the desired user. Thus the performance of the system is improved. The simulation results demonstrate that the proposed algorithm offers faster convergence rate and provides better output signal-to-interference-plus-noise-ratio (SINR) and bit error rate (BER) performance compared with the traditional LSCMA. © Springer Science+Business Media, LLC. 2009 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MKW GBV_ILN_70 GBV_ILN_2006 GBV_ILN_4266 GBV_ILN_4307 |
| container_issue |
2 |
| title_short |
The Linearly Constrained LSCMA for Blind Multi-user Detection |
| url |
https://doi.org/10.1007/s11277-009-9679-2 |
| remote_bool |
false |
| author2 |
You, Ming-li Luo, Han-wen Liu, Gang Yang, Tao |
| author2Str |
You, Ming-li Luo, Han-wen Liu, Gang Yang, Tao |
| ppnlink |
188950273 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11277-009-9679-2 |
| up_date |
2024-07-03T20:31:59.276Z |
| _version_ |
1803591320103550976 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC205376421X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504074748.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2009 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11277-009-9679-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC205376421X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11277-009-9679-2-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Meng, Yan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The Linearly Constrained LSCMA for Blind Multi-user Detection</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2009</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC. 2009</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The least square constant modulus algorithm (LSCMA) is a popular constant modulus algorithm (CMA) because of its global convergence and stability. But the performance will degrade when it is affected by the problem of interference capture in the MC-CDMA system that has several constant modulus signals. In order to overcome this shortage, a linearly constrained LSCMA multiuser detection algorithm is proposed by using the spreading code of the desired user to impose linear constraint on the LSCMA. The proposed algorithm ensures the algorithm convergence to the desired user. Thus the performance of the system is improved. The simulation results demonstrate that the proposed algorithm offers faster convergence rate and provides better output signal-to-interference-plus-noise-ratio (SINR) and bit error rate (BER) performance compared with the traditional LSCMA.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">MC-CDMA</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiuser detection</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">CMA</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">LSCMA</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">You, Ming-li</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Luo, Han-wen</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liu, Gang</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yang, Tao</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Wireless personal communications</subfield><subfield code="d">Springer US, 1994</subfield><subfield code="g">53(2009), 2 vom: 24. März, Seite 199-209</subfield><subfield code="w">(DE-627)188950273</subfield><subfield code="w">(DE-600)1287489-9</subfield><subfield code="w">(DE-576)049958909</subfield><subfield code="x">0929-6212</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:53</subfield><subfield code="g">year:2009</subfield><subfield code="g">number:2</subfield><subfield code="g">day:24</subfield><subfield code="g">month:03</subfield><subfield code="g">pages:199-209</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11277-009-9679-2</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MKW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">53</subfield><subfield code="j">2009</subfield><subfield code="e">2</subfield><subfield code="b">24</subfield><subfield code="c">03</subfield><subfield code="h">199-209</subfield></datafield></record></collection>
|
| score |
7.399955 |