On Computational Aspects of Tchebichef Polynomials for Higher Polynomial Order

Tchebichef polynomials (TPs) and their moments are widely used in signal processing due to their remarkable performance in signal analysis, feature extraction, and compression capability. The common problem of the TP is that the coefficients computation is prone to numerical instabilities when the p...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE access Ročník 5; s. 2470 - 2478
Hlavní autori: Abdulhussain, Sadiq H., Ramli, Abd Rahman, Al-Haddad, Syed Abdul Rahman, Mahmmod, Basheera M., Jassim, Wissam A.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Piscataway IEEE 2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
ISSN:2169-3536, 2169-3536
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Tchebichef polynomials (TPs) and their moments are widely used in signal processing due to their remarkable performance in signal analysis, feature extraction, and compression capability. The common problem of the TP is that the coefficients computation is prone to numerical instabilities when the polynomial order becomes large. In this paper, a new algorithm is proposed to compute the TP coefficients (TPCs) for higher polynomial order by combining two existing recurrence algorithms: the three-term recurrence relations in the n-direction and x-direction. First, the TPCs are computed for x, n = 0, 1, ... , (N/2) - 1 using the recurrence in the x-direction. Second, the TPCs for x = 0, 1, ... , (N/2) - 1 and n = (N/2), (N/2) + 1, ... , N - 1 based on n and x directions are calculated. Finally, the symmetry condition is applied to calculate the rest of the coefficients for x = (N/2), (N/2) + 1, ... , N - 1. In addition to the ability of the proposed algorithm to reduce the numerical propagation errors, it also accelerates the computational speed of the TPCs. The performance of the proposed algorithm was compared to that of existing algorithms for the reconstruction of speech and image signals taken from different databases. The performance of the TPCs computed by the proposed algorithm was also compared with the performance of the discrete cosine transform coefficients for speech compression systems. Different types of speech quality measures were used for evaluation. According to the results of the comparative analysis, the proposed algorithm makes the computation of the TP superior to that of conventional recurrence algorithms when the polynomial order is large.
AbstractList Tchebichef polynomials (TPs) and their moments are widely used in signal processing due to their remarkable performance in signal analysis, feature extraction, and compression capability. The common problem of the TP is that the coefficients computation is prone to numerical instabilities when the polynomial order becomes large. In this paper, a new algorithm is proposed to compute the TP coefficients (TPCs) for higher polynomial order by combining two existing recurrence algorithms: the three-term recurrence relations in the n-direction and x-direction. First, the TPCs are computed for x, n = 0, 1, ... , (N/2) - 1 using the recurrence in the x-direction. Second, the TPCs for x = 0, 1, ... , (N/2) - 1 and n = (N/2), (N/2) + 1, ... , N - 1 based on n and x directions are calculated. Finally, the symmetry condition is applied to calculate the rest of the coefficients for x = (N/2), (N/2) + 1, ... , N - 1. In addition to the ability of the proposed algorithm to reduce the numerical propagation errors, it also accelerates the computational speed of the TPCs. The performance of the proposed algorithm was compared to that of existing algorithms for the reconstruction of speech and image signals taken from different databases. The performance of the TPCs computed by the proposed algorithm was also compared with the performance of the discrete cosine transform coefficients for speech compression systems. Different types of speech quality measures were used for evaluation. According to the results of the comparative analysis, the proposed algorithm makes the computation of the TP superior to that of conventional recurrence algorithms when the polynomial order is large.
Author Al-Haddad, Syed Abdul Rahman
Mahmmod, Basheera M.
Abdulhussain, Sadiq H.
Ramli, Abd Rahman
Jassim, Wissam A.
Author_xml – sequence: 1
  givenname: Sadiq H.
  surname: Abdulhussain
  fullname: Abdulhussain, Sadiq H.
  email: sadiqh76@yahoo.com
  organization: Dept. of Comput. & Commun. Syst. Eng., Univ. Putra Malaysia, Serdang, Malaysia
– sequence: 2
  givenname: Abd Rahman
  surname: Ramli
  fullname: Ramli, Abd Rahman
  organization: Dept. of Comput. & Commun. Syst. Eng., Univ. Putra Malaysia, Serdang, Malaysia
– sequence: 3
  givenname: Syed Abdul Rahman
  surname: Al-Haddad
  fullname: Al-Haddad, Syed Abdul Rahman
  organization: Dept. of Comput. & Commun. Syst. Eng., Univ. Putra Malaysia, Serdang, Malaysia
– sequence: 4
  givenname: Basheera M.
  surname: Mahmmod
  fullname: Mahmmod, Basheera M.
  organization: Dept. of Comput. & Commun. Syst. Eng., Univ. Putra Malaysia, Serdang, Malaysia
– sequence: 5
  givenname: Wissam A.
  surname: Jassim
  fullname: Jassim, Wissam A.
  organization: ADAPT Center, Univ. of Dublin, Dublin, Ireland
BookMark eNp9UU1LAzEUDKLgV39BLwueW_O12c2xLGoLYoXWc3ibJpqy3azJ9uC_N3WriAdzyAvDzOQxc4lOW98ahMYETwnB8nZWVXer1ZRiUkypEJKS8gRdUCLkhOVMnP56n6NRjFucTpmgvLhAT8s2q_yu2_fQO99Ck81iZ3QfM2-ztX4ztUuXzZ5989H6nYMmZtaHbO5e30z4BWfLsDHhGp3ZRDGj47xCL_d362o-eVw-LKrZ40RzXPYTnnPGtLQ8L0ooKU2TAgEAXVrKiLXSFqCtYDbHwDXjsrbYYsBlLoTAhl2hxeC78bBVXXA7CB_Kg1NfgA-vCkLvdGMU1TXFRgAxNeWcihrXwKQseHLmmyJPXjeDVxf8-97EXm39PqQookqL5TL9LmhiyYGlg48xGKu0GzLrA7hGEawObaihDXVoQx3bSFr2R_u98f-q8aByxpgfRZEikCVln4_xlsI
CODEN IAECCG
CitedBy_id crossref_primary_10_1007_s10851_017_0758_9
crossref_primary_10_1016_j_jvcir_2019_102731
crossref_primary_10_3390_e20040214
crossref_primary_10_1007_s11045_021_00810_y
crossref_primary_10_1088_1757_899X_1090_1_012100
crossref_primary_10_1016_j_ins_2020_02_019
crossref_primary_10_1088_1757_899X_1090_1_012102
crossref_primary_10_1109_ACCESS_2022_3170893
crossref_primary_10_3390_electronics12030745
crossref_primary_10_1007_s10851_018_0863_4
crossref_primary_10_1007_s11554_021_01093_z
crossref_primary_10_1016_j_patrec_2019_08_031
crossref_primary_10_1016_j_bspc_2023_105128
crossref_primary_10_1016_j_patcog_2022_108596
crossref_primary_10_1109_ACCESS_2020_2987870
crossref_primary_10_1109_ACCESS_2020_2977305
crossref_primary_10_1080_23311916_2020_1763553
crossref_primary_10_1371_journal_pone_0286878
crossref_primary_10_1007_s11042_022_14259_z
crossref_primary_10_1016_j_jksuci_2022_08_021
crossref_primary_10_3390_s21061999
crossref_primary_10_1016_j_ins_2019_12_044
crossref_primary_10_1109_ACCESS_2021_3107579
crossref_primary_10_1109_ACCESS_2019_2929864
crossref_primary_10_1186_s13634_022_00938_4
crossref_primary_10_1109_ACCESS_2017_2699782
crossref_primary_10_1002_cpe_7311
crossref_primary_10_1155_2018_1673283
crossref_primary_10_3390_a17090381
crossref_primary_10_1016_j_patrec_2018_08_020
crossref_primary_10_1109_ACCESS_2022_3217225
crossref_primary_10_1109_ACCESS_2021_3100139
crossref_primary_10_1007_s00034_020_01384_z
crossref_primary_10_1049_sil2_12109
crossref_primary_10_1109_ACCESS_2021_3063028
crossref_primary_10_1080_19479832_2017_1326405
crossref_primary_10_1109_ACCESS_2021_3133444
crossref_primary_10_1007_s11042_019_7364_3
crossref_primary_10_1049_iet_spr_2016_0449
crossref_primary_10_1007_s11042_023_15582_9
crossref_primary_10_1007_s11042_021_11206_2
crossref_primary_10_1080_23311916_2021_1927469
Cites_doi 10.1016/j.patcog.2005.05.015
10.1109/TCSVT.2011.2163980
10.1016/S0031-3203(02)00353-9
10.1109/TIP.2003.818019
10.1007/s11042-015-2475-y
10.1109/TIP.2010.2052276
10.1109/LSP.2007.898331
10.1109/TPAMI.2007.70709
10.1016/j.neucom.2015.05.147
10.1109/83.941859
10.1049/iet-ipr.2009.0195
10.1109/ICASSP.2001.941023
10.1016/j.patcog.2011.12.001
10.1016/0031-3203(93)90038-X
10.1016/0031-3203(93)90098-H
10.1049/iet-spr.2013.0322
10.1109/ICMTMA.2010.29
10.1016/j.dsp.2013.05.004
10.1109/TIP.2004.828430
10.1117/12.139804
10.1109/TASL.2007.911054
10.1016/0031-3203(91)90140-Z
10.1007/BF02986888
10.1109/ISM.2012.31
10.1201/b14529
10.1049/iet-spr.2011.0004
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017
DBID 97E
ESBDL
RIA
RIE
AAYXX
CITATION
7SC
7SP
7SR
8BQ
8FD
JG9
JQ2
L7M
L~C
L~D
DOA
DOI 10.1109/ACCESS.2017.2669218
DatabaseName IEEE Xplore (IEEE)
IEEE Xplore Open Access Journals
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Engineered Materials Abstracts
METADEX
Technology Research Database
Materials Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Materials Research Database
Engineered Materials Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
METADEX
Computer and Information Systems Abstracts Professional
DatabaseTitleList

Materials Research Database
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2169-3536
EndPage 2478
ExternalDocumentID oai_doaj_org_article_2cb20e6a1eb24426b0ba399740a44d75
10_1109_ACCESS_2017_2669218
7856982
Genre orig-research
GroupedDBID 0R~
4.4
5VS
6IK
97E
AAJGR
ABAZT
ABVLG
ACGFS
ADBBV
AGSQL
ALMA_UNASSIGNED_HOLDINGS
BCNDV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
ESBDL
GROUPED_DOAJ
IPLJI
JAVBF
KQ8
M43
M~E
O9-
OCL
OK1
RIA
RIE
RNS
AAYXX
CITATION
7SC
7SP
7SR
8BQ
8FD
JG9
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c408t-45433c9f4578a8224572a1aaac8f231ff9f7acf63f50a4c349bf0f0a0856660e3
IEDL.DBID RIE
ISICitedReferencesCount 48
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000397136900152&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2169-3536
IngestDate Fri Oct 03 12:41:58 EDT 2025
Sun Nov 09 08:12:36 EST 2025
Tue Nov 18 21:42:24 EST 2025
Sat Nov 29 06:21:59 EST 2025
Tue Aug 26 16:39:26 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/OAPA.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c408t-45433c9f4578a8224572a1aaac8f231ff9f7acf63f50a4c349bf0f0a0856660e3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-6439-0082
OpenAccessLink https://ieeexplore.ieee.org/document/7856982
PQID 2455934962
PQPubID 4845423
PageCount 9
ParticipantIDs crossref_primary_10_1109_ACCESS_2017_2669218
proquest_journals_2455934962
doaj_primary_oai_doaj_org_article_2cb20e6a1eb24426b0ba399740a44d75
crossref_citationtrail_10_1109_ACCESS_2017_2669218
ieee_primary_7856982
PublicationCentury 2000
PublicationDate 20170000
2017-00-00
20170101
2017-01-01
PublicationDateYYYYMMDD 2017-01-01
PublicationDate_xml – year: 2017
  text: 20170000
PublicationDecade 2010
PublicationPlace Piscataway
PublicationPlace_xml – name: Piscataway
PublicationTitle IEEE access
PublicationTitleAbbrev Access
PublicationYear 2017
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref15
ref14
ref11
ref10
ref2
ref1
ref17
ref16
ref19
ref23
ref26
ref20
ref22
ref21
ref27
ref8
loizou (ref24) 2013
sheikh (ref25) 2006
ref7
ref9
ref4
ref3
ref6
shu (ref18) 2010; 19
ref5
References_xml – ident: ref17
  doi: 10.1016/j.patcog.2005.05.015
– ident: ref19
  doi: 10.1109/TCSVT.2011.2163980
– ident: ref10
  doi: 10.1016/S0031-3203(02)00353-9
– ident: ref13
  doi: 10.1109/TIP.2003.818019
– ident: ref3
  doi: 10.1007/s11042-015-2475-y
– volume: 19
  start-page: 3171
  year: 2010
  ident: ref18
  article-title: Fast computation of Tchebichef moments for binary and grayscale images
  publication-title: IEEE Trans Image Process
  doi: 10.1109/TIP.2010.2052276
– ident: ref16
  doi: 10.1109/LSP.2007.898331
– ident: ref12
  doi: 10.1109/TPAMI.2007.70709
– ident: ref6
  doi: 10.1016/j.neucom.2015.05.147
– ident: ref11
  doi: 10.1109/83.941859
– ident: ref23
  doi: 10.1049/iet-ipr.2009.0195
– ident: ref27
  doi: 10.1109/ICASSP.2001.941023
– ident: ref22
  doi: 10.1016/j.patcog.2011.12.001
– ident: ref4
  doi: 10.1016/0031-3203(93)90038-X
– year: 2006
  ident: ref25
  publication-title: LIVE Image Quality Assessment Database Release 2
– ident: ref8
  doi: 10.1016/0031-3203(93)90098-H
– ident: ref15
  doi: 10.1049/iet-spr.2013.0322
– ident: ref14
  doi: 10.1109/ICMTMA.2010.29
– ident: ref20
  doi: 10.1016/j.dsp.2013.05.004
– ident: ref9
  doi: 10.1109/TIP.2004.828430
– ident: ref5
  doi: 10.1117/12.139804
– ident: ref26
  doi: 10.1109/TASL.2007.911054
– ident: ref7
  doi: 10.1016/0031-3203(91)90140-Z
– ident: ref21
  doi: 10.1007/BF02986888
– ident: ref2
  doi: 10.1109/ISM.2012.31
– year: 2013
  ident: ref24
  publication-title: Speech Enhancement Theory and Practice
  doi: 10.1201/b14529
– ident: ref1
  doi: 10.1049/iet-spr.2011.0004
SSID ssj0000816957
Score 2.3041184
Snippet Tchebichef polynomials (TPs) and their moments are widely used in signal processing due to their remarkable performance in signal analysis, feature extraction,...
SourceID doaj
proquest
crossref
ieee
SourceType Open Website
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 2470
SubjectTerms Algorithm design and analysis
Algorithms
Coefficients
Compression tests
Computation
Computers
Discrete cosine transform
Discrete cosine transforms
Electronic mail
Feature extraction
Image reconstruction
Indexes
numerical propagations errors
Orthogonal polynomials
Polynomials
recurrence algorithm
Signal analysis
Signal processing
Signal processing algorithms
Speech
Speech compression
Tchebichef polynomials
SummonAdditionalLinks – databaseName: DOAJ Directory of Open Access Journals
  dbid: DOA
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3PS1wxEA5FPNRDsbWlW23JwaNP8_Kym8xxuyg9lNWDgreQZDMgyG5xV8H_vjN5cXkg2EuvIe_HfDPJzITJN0IcZ1CI7SQ2FBqExrgFNhAdZSkKuYt0q20oPLO_7Xzubm_hatDqi2vCenrgHrgznaJWeRJaSgENuZOoYiCnao0KxixsYS9VFgbJVNmDXTuBsa00Q62Cs-lsRhJxLZc9JacEmtt8DFxRYeyvLVZe7cvF2Vzsiw81SpTT_u8-ind5-UnsDbgDD8T8cin7lgz1OE9Oy63JtVyhvCZVRC7yRHm1un_mq8dkZpICVNkXdgyG5SWzb34WNxfn17NfTW2O0CSj3Ia5yrsuARpacoFLQcdWhzaEkBxSzIYIaEPCSYdjQip1BiIqVIFCLMpYVO6-iJ3lapm_CtlmBMhgMRttol1Em5iFPjvMC3DKjYR-wcmnyhzODSzufckgFPgeXM_g-gruSJxsH_rTE2e8Pf0nK2A7lVmvywDZgq-24P9lCyNxwOrbvsSSrOD0SBy9qNPXFbr2BNgYmC1ff_sfnz4U71mc_nDmSOxsHh7zd7GbnjZ364cfxTj_ArmM5BE
  priority: 102
  providerName: Directory of Open Access Journals
Title On Computational Aspects of Tchebichef Polynomials for Higher Polynomial Order
URI https://ieeexplore.ieee.org/document/7856982
https://www.proquest.com/docview/2455934962
https://doaj.org/article/2cb20e6a1eb24426b0ba399740a44d75
Volume 5
WOSCitedRecordID wos000397136900152&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2169-3536
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000816957
  issn: 2169-3536
  databaseCode: DOA
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2169-3536
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000816957
  issn: 2169-3536
  databaseCode: M~E
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Na9wwEBVJyKE5tE3T0m3ToEOOcSLLsiUdt0tCD-0mhwRyE5KsgULYDbubQi_97Z2RFbPQUujFGCEZSU8fM-OZN4ydJisA6i5UKBr4SpkeKhsMaikCKIt0LbXPPLNf9Xxu7u_tzQ47G2NhUkrZ-Syd02v-l98v4xOZyi60aTtr8MDd1bobYrVGewolkLCtLsRCtbAX09kMx0DeW_ocryErKbHH1uWTOfpLUpU_TuJ8vVy9-r-OvWYvixjJpwPuh2wnLd6wgy1ywSM2v17wIWdDsffxaQ6rXPMl8FvEKpAXKPCb5cNPik3GdchRguWD58dWMb8mes637O7q8nb2pSrZE6qohNkQmXnTRAsK96QnX9FWS19776MBFOoALGgfoWugFV7FRtkAAoRHGQxVGpGad2xvsVyk94zXCaxNVkNSUgXdBx2Jpj4ZSL01wkyYfJ5WFwu1OGW4eHBZxRDWDVg4wsIVLCbsbGz0ODBr_Lv6Z8JrrEq02LkAgXBllzkZgxSp83UKKLbILojgUQLTCkeoet1O2BGBN36k4DZhx8_ou7KF1w4nrLVEpy8__L3VR_aCOjjYY47Z3mb1lD6x_fhj8329OsnKPT6__bo8ySv1N2Yg4-Q
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PaxQxFH6UKmgP_qriatUcPHbaTCYzSY7rYqm4bntYobeQZPJAKLvS3Rb8783LpMOCIngbwmRI8uXHy5v3vg_gYzQcse58lUwDV0ndY2W8TrcUjqQiXQvlMs_sXC0W-urKXO7B8ZgLE2PMwWfxhB7zv_x-HW7JVXaqdNsZnTbcB6ScVbK1Ro8KSUiYVhVqoZqb0-lslnpB8VvqJB1ERpC0x87xk1n6i6zKH3txPmDOnv5f057Bk2JIsumA_HPYi6sXcLBDL3gIi4sVG1QbisePTXNi5YatkS0TWp7iQJFdrq9_UXZymoks2bBsiP3YKWYXRND5Er6ffV7Ozquin1AFyfWW6MybJhiUaVU6ihZtlXC1cy5oTGYdokHlAnYNttzJ0EjjkSN3yQpLlxoem1ewv1qv4mtgdURjolEYpZBe9V4FIqqPGmNvNNcTEPfDakMhFyeNi2ubLxnc2AELS1jYgsUEjsdKPwdujX-__onwGl8lYuxckICwZZ1ZEbzgsXN19MlwEZ3n3iUbTMnUQ9mrdgKHBN74kYLbBI7u0bdlEW9sGrDWEKG-ePP3Wh_g0fny29zOvyy-voXH1NjBO3ME-9ub2_gOHoa77Y_Nzfs8U38DrLXlBw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+Computational+Aspects+of+Tchebichef+Polynomials+for+Higher+Polynomial+Order&rft.jtitle=IEEE+access&rft.au=Abdulhussain%2C+Sadiq+H.&rft.au=Ramli%2C+Abd+Rahman&rft.au=Al-Haddad%2C+Syed+Abdul+Rahman&rft.au=Mahmmod%2C+Basheera+M.&rft.date=2017&rft.pub=IEEE&rft.eissn=2169-3536&rft.volume=5&rft.spage=2470&rft.epage=2478&rft_id=info:doi/10.1109%2FACCESS.2017.2669218&rft.externalDocID=7856982
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2169-3536&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2169-3536&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2169-3536&client=summon