default search action
Mobien Shoaib
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j6]Amr Ragheb
, Habib Fathallah
Complexity reduction of equalization/pre-emphasis using set membership filtering for NG LR-PON. Photonic Netw. Commun. 33(2): 166-178 (2017) - 2014
- [i2]Muhammad S. Sohail, Muhammad Omer Bin Saeed, Syed Zeeshan Rizvi, Mobien Shoaib, Asrar U. H. Sheikh:
Low-Complexity Particle Swarm Optimization for Time-Critical Applications. CoRR abs/1401.0546 (2014) - 2013
- [j5]Mobien Shoaib, Saleh A. Alshebeili
Fixed-Point Implementation of Fast QR-Decomposition Recursive Least-Squares Algorithms (FQRD-RLS): Stability Conditions and Quantization Errors Analysis. Circuits Syst. Signal Process. 32(4): 1551-1574 (2013) - [c8]Marcelo Lucena, José Antonio Apolinário, Mobien Shoaib:
The inverse QRD set-membership RLS algorithm. EUSIPCO 2013: 1-5 - [c7]Mobien Shoaib, Saleh A. Alshebeili
A fastwidely-linear QR-decomposition least-squares (FWL-QRD-RLS) algorithm. ICASSP 2013: 4169-4172 - [i1]Muhammad Omer Bin Saeed, Muhammad S. Sohail, Syed Zeeshan Rizvi, Mobien Shoaib, Asrar U. H. Sheikh:
An accelerated CLPSO algorithm. CoRR abs/1304.3892 (2013) - 2012
- [j4]Alharbi Hazza, Mobien Shoaib, Saleh A. Alshebeili
Automatic modulation classification of digital modulations in presence of HF noise. EURASIP J. Adv. Signal Process. 2012: 238 (2012) - 2011
- [j3]Alharbi Hazza, Mobien Shoaib, Saleh A. Alshebeili, Alturki Fahd:
Robustness of digitally modulated signal features against variation in HF noise model. EURASIP J. Wirel. Commun. Netw. 2011: 24 (2011) - 2010
- [j2]Mobien Shoaib, Stefan Werner
Multichannel fast QR-decomposition algorithms: weight extraction method and its applications. IEEE Trans. Signal Process. 58(1): 175-188 (2010) - [c6]Alharbi Hazza, Mobien Shoaib, Saleh A. Alshebeili, Alturki Fahd:
A novel approach for automatic classification of digitally modulated signals in HF communications. ISSPIT 2010: 271-276 - [c5]Alharbi Hazza, Mobien Shoaib, Saleh A. Alshebeili, Alturki Fahd:
Classification of digitally modulated signals in presence of non-Gaussian HF noise. ISWCS 2010: 815-819
2000 – 2009
- 2009
- [c4]Mobien Shoaib, Stefan Werner, José Antonio Apolinário, Saleh A. Alshebieli:
Multi-input multi-output fast QR decomposition algorithm for active noise control. EUSIPCO 2009: 1745-1749 - 2008
- [j1]Mobien Shoaib, Stefan Werner
Reduced Complexity Solution for Weight Extraction in QRD-LSL Algorithms. IEEE Signal Process. Lett. 15: 277-280 (2008) - 2006
- [c3]Mobien Shoaib, Stefan Werner, José Antonio Apolinário, Timo I. Laakso:
Multichannel fast QR-decomposition RLS algorithms with explicit weight extraction. EUSIPCO 2006: 1-5 - [c2]Mobien Shoaib, Stefan Werner
Solution to the Weight Extraction Problem in Fast QR-Decomposition RLS Algorithms. ICASSP (3) 2006: 572-575 - [c1]Mobien Shoaib, Stefan Werner
Equivalent output-filtering using fast QRD-RLS algorithm for burst-type training applications. ISCAS 2006
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: