Improving the Evaluation Performance of Space-Time Trellis Code through Visualisation
In this paper we present a new visualisation approach in the effort of improving the evaluation strategy of space-time trellis code (STTC) generator matrix G. To our knowledge, although visualisation is widely used to handle a variety of problems, it has never been employed specifically to solve com...
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 | 474 |
|---|---|
| container_issue | |
| container_start_page | 471 |
| container_title | |
| container_volume | |
| creator | Harun, H. Chulan, U. A. I. U. Khazani, K. |
| description | In this paper we present a new visualisation approach in the effort of improving the evaluation strategy of space-time trellis code (STTC) generator matrix G. To our knowledge, although visualisation is widely used to handle a variety of problems, it has never been employed specifically to solve complexity problems that are related to generator matrix G evaluation. Most approaches are either mathematically or algorithmically inclined. As such, they tend to offer a series of refinement that enhances the current available method, but do not provide fresh insight on the problem at hand. By comparing it with the enhancement strategy that was discovered via the normal approach (i.e., by analysing algorithm) it was discovered that visualisation had inspired an entirely different pruning technique that outperformed the common approach by 20%. |
| doi_str_mv | 10.1109/IV.2011.20 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6004086</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6004086</ieee_id><sourcerecordid>6004086</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-a6fd4063946a5d9efc12a74e293ef64c92ac42344e3c20056a2babb4f94f2e793</originalsourceid><addsrcrecordid>eNotj81Kw0AYRQd_wFq7cetmXiB1_iezlFBroKBg2m35knzTjiRNmSQF396gbu6FC-fCIeSRsyXnzD3nu6VgnE9xRWZCWp0wLtNrsnA25Upby1KTpjdkxrVmiWHS3pH7vv9iTGlt9Yxs8_Ycu0s4HehwRLq6QDPCELoT_cDou9jCqULaefp5hgqTIrRIi4hNE3qadTVOVOzGw5HuQj_CtP7CD-TWQ9Pj4r_nZPu6KrK3ZPO-zrOXTRK41UMCxteKGemUAV079BUXYBUKJ9EbVTkBlRJSKZSVYEwbECWUpfJOeYHWyTl5-vsNiLg_x9BC_N6byW7ylj_QllHe</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Improving the Evaluation Performance of Space-Time Trellis Code through Visualisation</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Harun, H. ; Chulan, U. A. I. U. ; Khazani, K.</creator><creatorcontrib>Harun, H. ; Chulan, U. A. I. U. ; Khazani, K.</creatorcontrib><description>In this paper we present a new visualisation approach in the effort of improving the evaluation strategy of space-time trellis code (STTC) generator matrix G. To our knowledge, although visualisation is widely used to handle a variety of problems, it has never been employed specifically to solve complexity problems that are related to generator matrix G evaluation. Most approaches are either mathematically or algorithmically inclined. As such, they tend to offer a series of refinement that enhances the current available method, but do not provide fresh insight on the problem at hand. By comparing it with the enhancement strategy that was discovered via the normal approach (i.e., by analysing algorithm) it was discovered that visualisation had inspired an entirely different pruning technique that outperformed the common approach by 20%.</description><identifier>ISSN: 1550-6037</identifier><identifier>ISBN: 9781457708688</identifier><identifier>ISBN: 145770868X</identifier><identifier>EISSN: 2375-0138</identifier><identifier>DOI: 10.1109/IV.2011.20</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Approximation algorithms ; Complexity theory ; Convolutional codes ; generator matrix ; Generators ; heuristic ; Heuristic algorithms ; Space-time trellis code ; visualisation tool ; Visualization</subject><ispartof>2011 15th International Conference on Information Visualisation, 2011, p.471-474</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/6004086$$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/6004086$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Harun, H.</creatorcontrib><creatorcontrib>Chulan, U. A. I. U.</creatorcontrib><creatorcontrib>Khazani, K.</creatorcontrib><title>Improving the Evaluation Performance of Space-Time Trellis Code through Visualisation</title><title>2011 15th International Conference on Information Visualisation</title><addtitle>iv</addtitle><description>In this paper we present a new visualisation approach in the effort of improving the evaluation strategy of space-time trellis code (STTC) generator matrix G. To our knowledge, although visualisation is widely used to handle a variety of problems, it has never been employed specifically to solve complexity problems that are related to generator matrix G evaluation. Most approaches are either mathematically or algorithmically inclined. As such, they tend to offer a series of refinement that enhances the current available method, but do not provide fresh insight on the problem at hand. By comparing it with the enhancement strategy that was discovered via the normal approach (i.e., by analysing algorithm) it was discovered that visualisation had inspired an entirely different pruning technique that outperformed the common approach by 20%.</description><subject>Algorithm design and analysis</subject><subject>Approximation algorithms</subject><subject>Complexity theory</subject><subject>Convolutional codes</subject><subject>generator matrix</subject><subject>Generators</subject><subject>heuristic</subject><subject>Heuristic algorithms</subject><subject>Space-time trellis code</subject><subject>visualisation tool</subject><subject>Visualization</subject><issn>1550-6037</issn><issn>2375-0138</issn><isbn>9781457708688</isbn><isbn>145770868X</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj81Kw0AYRQd_wFq7cetmXiB1_iezlFBroKBg2m35knzTjiRNmSQF396gbu6FC-fCIeSRsyXnzD3nu6VgnE9xRWZCWp0wLtNrsnA25Upby1KTpjdkxrVmiWHS3pH7vv9iTGlt9Yxs8_Ycu0s4HehwRLq6QDPCELoT_cDou9jCqULaefp5hgqTIrRIi4hNE3qadTVOVOzGw5HuQj_CtP7CD-TWQ9Pj4r_nZPu6KrK3ZPO-zrOXTRK41UMCxteKGemUAV079BUXYBUKJ9EbVTkBlRJSKZSVYEwbECWUpfJOeYHWyTl5-vsNiLg_x9BC_N6byW7ylj_QllHe</recordid><startdate>201107</startdate><enddate>201107</enddate><creator>Harun, H.</creator><creator>Chulan, U. A. I. U.</creator><creator>Khazani, K.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201107</creationdate><title>Improving the Evaluation Performance of Space-Time Trellis Code through Visualisation</title><author>Harun, H. ; Chulan, U. A. I. U. ; Khazani, K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-a6fd4063946a5d9efc12a74e293ef64c92ac42344e3c20056a2babb4f94f2e793</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Algorithm design and analysis</topic><topic>Approximation algorithms</topic><topic>Complexity theory</topic><topic>Convolutional codes</topic><topic>generator matrix</topic><topic>Generators</topic><topic>heuristic</topic><topic>Heuristic algorithms</topic><topic>Space-time trellis code</topic><topic>visualisation tool</topic><topic>Visualization</topic><toplevel>online_resources</toplevel><creatorcontrib>Harun, H.</creatorcontrib><creatorcontrib>Chulan, U. A. I. U.</creatorcontrib><creatorcontrib>Khazani, K.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Harun, H.</au><au>Chulan, U. A. I. U.</au><au>Khazani, K.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Improving the Evaluation Performance of Space-Time Trellis Code through Visualisation</atitle><btitle>2011 15th International Conference on Information Visualisation</btitle><stitle>iv</stitle><date>2011-07</date><risdate>2011</risdate><spage>471</spage><epage>474</epage><pages>471-474</pages><issn>1550-6037</issn><eissn>2375-0138</eissn><isbn>9781457708688</isbn><isbn>145770868X</isbn><abstract>In this paper we present a new visualisation approach in the effort of improving the evaluation strategy of space-time trellis code (STTC) generator matrix G. To our knowledge, although visualisation is widely used to handle a variety of problems, it has never been employed specifically to solve complexity problems that are related to generator matrix G evaluation. Most approaches are either mathematically or algorithmically inclined. As such, they tend to offer a series of refinement that enhances the current available method, but do not provide fresh insight on the problem at hand. By comparing it with the enhancement strategy that was discovered via the normal approach (i.e., by analysing algorithm) it was discovered that visualisation had inspired an entirely different pruning technique that outperformed the common approach by 20%.</abstract><pub>IEEE</pub><doi>10.1109/IV.2011.20</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1550-6037 |
| ispartof | 2011 15th International Conference on Information Visualisation, 2011, p.471-474 |
| issn | 1550-6037 2375-0138 |
| language | eng |
| recordid | cdi_ieee_primary_6004086 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Algorithm design and analysis Approximation algorithms Complexity theory Convolutional codes generator matrix Generators heuristic Heuristic algorithms Space-time trellis code visualisation tool Visualization |
| title | Improving the Evaluation Performance of Space-Time Trellis Code through Visualisation |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T03%3A16%3A02IST&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=Improving%20the%20Evaluation%20Performance%20of%20Space-Time%20Trellis%20Code%20through%20Visualisation&rft.btitle=2011%2015th%20International%20Conference%20on%20Information%20Visualisation&rft.au=Harun,%20H.&rft.date=2011-07&rft.spage=471&rft.epage=474&rft.pages=471-474&rft.issn=1550-6037&rft.eissn=2375-0138&rft.isbn=9781457708688&rft.isbn_list=145770868X&rft_id=info:doi/10.1109/IV.2011.20&rft_dat=%3Cieee_6IE%3E6004086%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6004086&rfr_iscdi=true |