Determining the Complexity of FH/SS Sequences by Fuzzy Entropy
High complexity of frequency-hopping (FH)/spread- spectrum(SS) sequence is of great importance to high-security multiple-access communication systems, for it makes FH/SS sequence difficult to be analyzed. In this paper, a new complexity metric to evaluate the unpredictability of FH/SS sequence based...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 5 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | |
| container_volume | |
| creator | Xiaojun Chen Zan Li Jiangbo Si Benjian Hao Baoming Bai |
| description | High complexity of frequency-hopping (FH)/spread- spectrum(SS) sequence is of great importance to high-security multiple-access communication systems, for it makes FH/SS sequence difficult to be analyzed. In this paper, a new complexity metric to evaluate the unpredictability of FH/SS sequence based on the Fuzzy Entropy(FuzzyEn) is presented. Simulation and analytical results show that, the proposed FuzzyEn works can effectively discern the changing complexities of the FH/SS sequences, and are compared with complexity metric based on the Approximate Entropy(ApEn). The FuzzyEn scheme has obvious advantages in the robustness to resolution parameter, the dependence to observation length and the sensitivity to vector dimension. |
| doi_str_mv | 10.1109/icc.2011.5962500 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5962500</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5962500</ieee_id><sourcerecordid>5962500</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-b48bb462fb0092c66324f65516c374714558cdb16b460d28e8ac6393543725b13</originalsourceid><addsrcrecordid>eNo1kE9LwzAYh-M_cJu7C17yBdrlzZs3TS6CzNUJAw9T8DaWLNXI1ta2A7tP78B5eg7Pw-_wY-wWRAog7CR6n0oBkJLVkoQ4Y0PQII2SiO_nbAAWTQLG4AUb28z8O0mXR0ckEtQiu2bDtv0SgqRFGLD7x9CFZhfLWH7w7jPwabWrt-Endj2vCp7PJ8slX4bvfSh9aLnreb4_HHo-K7umqvsbdlWst20Ynzhib_nsdTpPFi9Pz9OHRRIhoy5xyjintCycEFZ6rVGqQhOB9pipDBSR8RsH-hiJjTTBrL1Gi6Qwk-QAR-zubzeGEFZ1E3frpl-dfsBfBjpK4A</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Determining the Complexity of FH/SS Sequences by Fuzzy Entropy</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Xiaojun Chen ; Zan Li ; Jiangbo Si ; Benjian Hao ; Baoming Bai</creator><creatorcontrib>Xiaojun Chen ; Zan Li ; Jiangbo Si ; Benjian Hao ; Baoming Bai</creatorcontrib><description>High complexity of frequency-hopping (FH)/spread- spectrum(SS) sequence is of great importance to high-security multiple-access communication systems, for it makes FH/SS sequence difficult to be analyzed. In this paper, a new complexity metric to evaluate the unpredictability of FH/SS sequence based on the Fuzzy Entropy(FuzzyEn) is presented. Simulation and analytical results show that, the proposed FuzzyEn works can effectively discern the changing complexities of the FH/SS sequences, and are compared with complexity metric based on the Approximate Entropy(ApEn). The FuzzyEn scheme has obvious advantages in the robustness to resolution parameter, the dependence to observation length and the sensitivity to vector dimension.</description><identifier>ISSN: 1550-3607</identifier><identifier>ISBN: 9781612842325</identifier><identifier>ISBN: 1612842321</identifier><identifier>EISSN: 1938-1883</identifier><identifier>EISBN: 161284233X</identifier><identifier>EISBN: 9781612842318</identifier><identifier>EISBN: 9781612842332</identifier><identifier>EISBN: 1612842313</identifier><identifier>DOI: 10.1109/icc.2011.5962500</identifier><language>eng</language><publisher>IEEE</publisher><subject>Chaotic communication ; Complexity theory ; Entropy ; IEEE Communications Society ; Robustness ; Sensitivity</subject><ispartof>2011 IEEE International Conference on Communications (ICC), 2011, p.1-5</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5962500$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5962500$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Xiaojun Chen</creatorcontrib><creatorcontrib>Zan Li</creatorcontrib><creatorcontrib>Jiangbo Si</creatorcontrib><creatorcontrib>Benjian Hao</creatorcontrib><creatorcontrib>Baoming Bai</creatorcontrib><title>Determining the Complexity of FH/SS Sequences by Fuzzy Entropy</title><title>2011 IEEE International Conference on Communications (ICC)</title><addtitle>icc</addtitle><description>High complexity of frequency-hopping (FH)/spread- spectrum(SS) sequence is of great importance to high-security multiple-access communication systems, for it makes FH/SS sequence difficult to be analyzed. In this paper, a new complexity metric to evaluate the unpredictability of FH/SS sequence based on the Fuzzy Entropy(FuzzyEn) is presented. Simulation and analytical results show that, the proposed FuzzyEn works can effectively discern the changing complexities of the FH/SS sequences, and are compared with complexity metric based on the Approximate Entropy(ApEn). The FuzzyEn scheme has obvious advantages in the robustness to resolution parameter, the dependence to observation length and the sensitivity to vector dimension.</description><subject>Chaotic communication</subject><subject>Complexity theory</subject><subject>Entropy</subject><subject>IEEE Communications Society</subject><subject>Robustness</subject><subject>Sensitivity</subject><issn>1550-3607</issn><issn>1938-1883</issn><isbn>9781612842325</isbn><isbn>1612842321</isbn><isbn>161284233X</isbn><isbn>9781612842318</isbn><isbn>9781612842332</isbn><isbn>1612842313</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1kE9LwzAYh-M_cJu7C17yBdrlzZs3TS6CzNUJAw9T8DaWLNXI1ta2A7tP78B5eg7Pw-_wY-wWRAog7CR6n0oBkJLVkoQ4Y0PQII2SiO_nbAAWTQLG4AUb28z8O0mXR0ckEtQiu2bDtv0SgqRFGLD7x9CFZhfLWH7w7jPwabWrt-Endj2vCp7PJ8slX4bvfSh9aLnreb4_HHo-K7umqvsbdlWst20Ynzhib_nsdTpPFi9Pz9OHRRIhoy5xyjintCycEFZ6rVGqQhOB9pipDBSR8RsH-hiJjTTBrL1Gi6Qwk-QAR-zubzeGEFZ1E3frpl-dfsBfBjpK4A</recordid><startdate>201106</startdate><enddate>201106</enddate><creator>Xiaojun Chen</creator><creator>Zan Li</creator><creator>Jiangbo Si</creator><creator>Benjian Hao</creator><creator>Baoming Bai</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201106</creationdate><title>Determining the Complexity of FH/SS Sequences by Fuzzy Entropy</title><author>Xiaojun Chen ; Zan Li ; Jiangbo Si ; Benjian Hao ; Baoming Bai</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-b48bb462fb0092c66324f65516c374714558cdb16b460d28e8ac6393543725b13</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Chaotic communication</topic><topic>Complexity theory</topic><topic>Entropy</topic><topic>IEEE Communications Society</topic><topic>Robustness</topic><topic>Sensitivity</topic><toplevel>online_resources</toplevel><creatorcontrib>Xiaojun Chen</creatorcontrib><creatorcontrib>Zan Li</creatorcontrib><creatorcontrib>Jiangbo Si</creatorcontrib><creatorcontrib>Benjian Hao</creatorcontrib><creatorcontrib>Baoming Bai</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Xiaojun Chen</au><au>Zan Li</au><au>Jiangbo Si</au><au>Benjian Hao</au><au>Baoming Bai</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Determining the Complexity of FH/SS Sequences by Fuzzy Entropy</atitle><btitle>2011 IEEE International Conference on Communications (ICC)</btitle><stitle>icc</stitle><date>2011-06</date><risdate>2011</risdate><spage>1</spage><epage>5</epage><pages>1-5</pages><issn>1550-3607</issn><eissn>1938-1883</eissn><isbn>9781612842325</isbn><isbn>1612842321</isbn><eisbn>161284233X</eisbn><eisbn>9781612842318</eisbn><eisbn>9781612842332</eisbn><eisbn>1612842313</eisbn><abstract>High complexity of frequency-hopping (FH)/spread- spectrum(SS) sequence is of great importance to high-security multiple-access communication systems, for it makes FH/SS sequence difficult to be analyzed. In this paper, a new complexity metric to evaluate the unpredictability of FH/SS sequence based on the Fuzzy Entropy(FuzzyEn) is presented. Simulation and analytical results show that, the proposed FuzzyEn works can effectively discern the changing complexities of the FH/SS sequences, and are compared with complexity metric based on the Approximate Entropy(ApEn). The FuzzyEn scheme has obvious advantages in the robustness to resolution parameter, the dependence to observation length and the sensitivity to vector dimension.</abstract><pub>IEEE</pub><doi>10.1109/icc.2011.5962500</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1550-3607 |
| ispartof | 2011 IEEE International Conference on Communications (ICC), 2011, p.1-5 |
| issn | 1550-3607 1938-1883 |
| language | eng |
| recordid | cdi_ieee_primary_5962500 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Chaotic communication Complexity theory Entropy IEEE Communications Society Robustness Sensitivity |
| title | Determining the Complexity of FH/SS Sequences by Fuzzy Entropy |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T19%3A38%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Determining%20the%20Complexity%20of%20FH/SS%20Sequences%20by%20Fuzzy%20Entropy&rft.btitle=2011%20IEEE%20International%20Conference%20on%20Communications%20(ICC)&rft.au=Xiaojun%20Chen&rft.date=2011-06&rft.spage=1&rft.epage=5&rft.pages=1-5&rft.issn=1550-3607&rft.eissn=1938-1883&rft.isbn=9781612842325&rft.isbn_list=1612842321&rft_id=info:doi/10.1109/icc.2011.5962500&rft_dat=%3Cieee_6IE%3E5962500%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=161284233X&rft.eisbn_list=9781612842318&rft.eisbn_list=9781612842332&rft.eisbn_list=1612842313&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5962500&rfr_iscdi=true |