default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMashud Hyder
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j17]Md Mashud Hyder, Kaushik Mahata, Shah Mahdi Hasan:
A new target localization method for bistatic FDA radar. Digit. Signal Process. 108: 102902 (2021)- [j16]Shah Mahdi Hasan
, Kaushik Mahata, Md Mashud Hyder:
Uplink Grant-Free NOMA With Sinusoidal Spreading Sequences. IEEE Trans. Commun. 69(6): 3757-3770 (2021) - 2020
- [j15]Kaushik Mahata, Md Mashud Hyder:
A New Perspective on the Initial Uplink Synchronization Problem. IEEE Access 8: 212258-212279 (2020) - [j14]Kaushik Mahata, Md Mashud Hyder:
Sparse deconvolution via off-grid T.V minimization. Signal Process. 170: 107406 (2020) - [c11]Shah Mahdi Hasan, Kaushik Mahata, Md Mashud Hyder:
Sparse Code Multiple Access Codebook Design using Equiangular Tight Frames. ICC 2020: 1-6 - [i4]Shah Mahdi Hasan, Kaushik Mahata, Md Mashud Hyder:
Fast Uplink Grant-Free NOMA with Sinusoidal Spreading Sequences. CoRR abs/2010.00199 (2020)
2010 – 2019
- 2019
- [j13]Md Mashud Hyder, Kaushik Mahata:
Improved LTE like initial uplink synchronization via reduced problem dimension. Comput. Commun. 144: 57-65 (2019) - 2018
- [j12]Kaushik Mahata, Md Mashud Hyder:
Fast Frequency Estimation With Prior Information. IEEE Trans. Signal Process. 66(1): 264-273 (2018) - [p1]Md Mashud Hyder, Kaushik Mahata:
Fast and Flexible Initial Uplink Synchronization for Long-Term Evolution. Emerging Wireless Communication and Network Technologies 2018: 193-211 - 2017
- [j11]Md Mashud Hyder, Kaushik Mahata:
Fast Uplink Synchronization in LTE-Like Systems. IEEE Commun. Lett. 21(11): 2424-2427 (2017) - [j10]Kaushik Mahata, Md Mashud Hyder:
Grid-less T.V minimization for DOA estimation. Signal Process. 132: 155-164 (2017) - [j9]Mashud Hyder, Kaushik Mahata:
Zadoff-Chu Sequence Design for Random Access Initial Uplink Synchronization in LTE-Like Systems. IEEE Trans. Wirel. Commun. 16(1): 503-511 (2017) - 2016
- [j8]Md Mashud Hyder, Kaushik Mahata:
A Sparse Recovery Method for Initial Uplink Synchronization in OFDMA Systems. IEEE Trans. Commun. 64(1): 377-386 (2016) - [j7]Kaushik Mahata, Md Mashud Hyder:
Frequency Estimation From Arbitrary Time Samples. IEEE Trans. Signal Process. 64(21): 5634-5643 (2016) - [i3]Md Mashud Hyder, Kaushik Mahata:
Zadoff-Chu sequence design for random access initial uplink synchronization. CoRR abs/1604.01476 (2016) - 2015
- [i2]Mashud Hyder, Kaushik Mahata:
A sparse recovery method for initial ranging in IEEE 802.16 OFDMA systems. CoRR abs/1505.05935 (2015) - [i1]Md Mashud Hyder:
Multiuser Detection for Random Access Bandwidth Request in WiMAX. CoRR abs/1506.08478 (2015) - 2014
- [c10]Mashud Hyder, Reduan H. Khan, Kaushik Mahata:
An enhanced random access mechanism for Smart Grid M2M communications in WiMAX networks. SmartGridComm 2014: 356-361 - 2013
- [c9]Mashud Hyder, Kaushik Mahata:
Sparse sequence recovery via a maximum a posteriori estimation. ICIP 2013: 489-493 - [c8]Mashud Hyder, Kaushik Mahata:
On measurement unit placement for smart electrical grid fault localization. SmartGridComm 2013: 79-84 - [c7]Mashud Hyder, Reduan H. Khan, Kaushik Mahata, Jamil Y. Khan:
A predictive protection scheme based on adaptive synchrophasor communications. SmartGridComm 2013: 762-767 - 2012
- [j6]Mashud Hyder, Kaushik Mahata:
Maximum a Posteriori Based Approach for Target Detection in MTI Radar. IEEE J. Emerg. Sel. Topics Circuits Syst. 2(3): 392-401 (2012) - 2011
- [j5]Mashud Hyder, Kaushik Mahata:
Coherent Spectral Analysis of Asynchronously Sampled Signals. IEEE Signal Process. Lett. 18(2): 126-129 (2011) - [c6]Mashud Hyder, Kaushik Mahata:
Focuss is a convex-concave procedure. ICASSP 2011: 4216-4219 - [c5]Md Mashud Hyder, Kaushik Mahata:
Maximum a posteriori estimation approach to sparse recovery. DSP 2011: 1-6 - [c4]Md Mashud Hyder, Kaushik Mahata:
A joint sparse signal representation perspective for target detection using bistatic MIMO radar system. DSP 2011: 1-5 - 2010
- [j4]Mashud Hyder, Kaushik Mahata:
An improved smoothed l0approximation algorithm for sparse representation. IEEE Trans. Signal Process. 58(4): 2194-2205 (2010) - [j3]Mashud Hyder, Kaushik Mahata:
Direction-of-arrival estimation using a mixed l2, 0norm approximation. IEEE Trans. Signal Process. 58(9): 4646-4655 (2010) - [c3]Mashud Hyder, Kaushik Mahata:
An l0 norm based method for frequency estimation from irregularly sampled data. ICASSP 2010: 4022-4025
2000 – 2009
- 2009
- [j2]Mashud Hyder, Md. Monirul Islam, M. A. H. Akhand, Kazuyuki Murase:
Symmetry Axis Based Object Recognition under Translation, Rotation and Scaling. Int. J. Neural Syst. 19(1): 25-42 (2009) - [j1]Mashud Hyder, Kaushik Mahata:
A Robust Algorithm for Joint-Sparse Recovery. IEEE Signal Process. Lett. 16(12): 1091-1094 (2009) - [c2]Mashud Hyder, Kaushik Mahata:
An approximate L0 norm minimization algorithm for compressed sensing. ICASSP 2009: 3365-3368 - [c1]Mashud Hyder, Kaushik Mahata:
A fast decoder for Compressed Sensing based multiple description image coding. ICIP 2009: 2125-2128
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-04-25 05:38 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:
