default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammad Gharavi-Alkhansari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j10]Javier M. Paredes, Alex B. Gershman, Mohammad Gharavi-Alkhansari:
A New Full-Rate Full-Diversity Space-Time Block Code With Nonvanishing Determinants and Simplified Maximum-Likelihood Decoding. IEEE Trans. Signal Process. 56(6): 2461-2469 (2008)- 2007
- [c17]Javier M. Paredes, Alex B. Gershman, Mohammad Gharavi-Alkhansari:
A 2x2 Space-Time Code with Non-Vanishing Determinants and Fast Maximum Likelihood Decoding. ICASSP (2) 2007: 877-880 - 2005
- [j9]Mohammad Gharavi-Alkhansari, Alex B. Gershman:
Constellation space invariance of orthogonal space-time block codes. IEEE Trans. Inf. Theory 51(1): 331-334 (2005) - [j8]Mohammad Gharavi-Alkhansari, Alex B. Gershman:
On diversity and coding gains and optimal matrix constellations for space-time block codes. IEEE Trans. Signal Process. 53(10): 3703-3717 (2005) - [c16]Rasha Ibrahim, Mohammad Gharavi-Alkhansari, Alex B. Gershman:
Exact error probability analysis of multimedia multicast transmission in MIMO wireless networks using orthogonal space-time block codes. ICASSP (4) 2005: 889-892 - 2004
- [j7]Mohammad Gharavi-Alkhansari, Alex B. Gershman:
Exact symbol-error probability analysis for orthogonal space-time block codes: two- and higher dimensional constellations cases. IEEE Trans. Commun. 52(7): 1068-1073 (2004) - [j6]Mohammad Gharavi-Alkhansari, Alex B. Gershman:
Fast antenna subset selection in MIMO systems. IEEE Trans. Signal Process. 52(2): 339-347 (2004) - [j5]Shahram Shahbazpanahi
, Mohammadali Beheshti, Alex B. Gershman, Mohammad Gharavi-Alkhansari, Kon Max Wong:
Minimum variance linear receivers for multiaccess MIMO wireless systems with space-time block coding. IEEE Trans. Signal Process. 52(12): 3306-3313 (2004) - [c15]Shahram Shahbazpanahi, Mohammadali Beheshti, Alex B. Gershman, Mohammad Gharavi-Alkhansari, Kon Max Wong:
Linear receivers for multiple-access MIMO systems with space-time block coding. ICC 2004: 608-612 - [c14]Shahram Shahbazpanahi, Mohammadali Beheshti, Alex B. Gershman, Mohammad Gharavi-Alkhansari, Kon Max Wong:
Linear receivers for joint space-time decoding and interference rejection in multiuser uplink MIMO communication systems. WSA 2004: 182-188 - [c13]Mohammad Gharavi-Alkhansari, Alex B. Gershman, Martin Haardt:
Exact error probability analysis of orthogonal space-time block codes over correlated Rician fading channels. WSA 2004: 274-278 - 2003
- [j4]Masoud Sharif, Mohammad Gharavi-Alkhansari, Babak Hossein Khalaj:
On the peak-to-average power of OFDM signals based on oversampling. IEEE Trans. Commun. 51(1): 72-78 (2003) - [c12]Mohammad Gharavi-Alkhansari, Alex B. Gershman:
Constellation space invariance of orthogonal space-time block codes with application to evaluation of the exact probability of error. GLOBECOM 2003: 1920-1924 - [c11]Mohammad Gharavi-Alkhansari, Alex B. Gershman:
Fast antenna subset selection in wireless MIMO systems. ICASSP (5) 2003: 57-60 - [c10]Mehrtash Tafazzoli Harandi, Mohammad Gharavi-Alkhansari:
Low bitrate image compression using self-organized Kohonen maps. ICIP (2) 2003: 267-270 - 2002
- [c9]Masoud Sharif, Mohammad Gharavi-Alkhansari, Babak Hossein Khalaj:
New results on the peak power of OFDM signals based on oversampling. ICC 2002: 866-871 - 2001
- [j3]Mohammad Gharavi-Alkhansari:
A fast globally optimal algorithm for template matching using low-resolution pruning. IEEE Trans. Image Process. 10(4): 526-533 (2001) - [c8]Mohammad Gharavi-Alkhansari:
A fast motion estimation algorithm equivalent to exhaustive search. ICASSP 2001: 1201-1204 - [c7]Mohammad Gharavi-Alkhansari:
A fast full-search equivalent algorithm using energy compacting transforms. ICIP (2) 2001: 713-716
1990 – 1999
- 1998
- [j2]Mohammad Gharavi-Alkhansari, Thomas S. Huang:
Causal fractal compression of video sequences using matching pursuit. Int. J. Imaging Syst. Technol. 9(5): 305-319 (1998) - [c6]Mohammad Gharavi-Alkhansari, Thomas S. Huang:
A fast orthogonal matching pursuit algorithm. ICASSP 1998: 1389-1392 - [c5]Mohammad Gharavi-Alkhansari:
A Model for Entropy Coding in Matching Pursuit. ICIP (1) 1998: 779-782 - 1997
- [b1]Mohammad Gharavi-Alkhansari:
Fractal-Based Image and Video Coding Using Matching Pursuit. University of Illinois Urbana-Champaign, USA, 1997 - [j1]Mohammad Gharavi-Alkhansari, Thomas S. Huang:
A Generalized Method for Image Coding Using Fractal-Based Techniques. J. Vis. Commun. Image Represent. 8(2): 208-225 (1997) - [c4]Mohammad Gharavi-Alkhansari, Thomas S. Huang:
A system/graph theoretical analysis of attractor coders. ICASSP 1997: 2705-2708 - 1996
- [c3]Mohammad Gharavi-Alkhansari, Thomas S. Huang:
Fractal video coding by matching pursuit. ICIP (1) 1996: 157-160 - 1994
- [c2]Mohammad Gharavi-Alkhansari, Thomas S. Huang:
Fractal-Based Techniques for a Generalized Image Coding Method. ICIP (3) 1994: 122-126 - 1993
- [c1]Mohammad Gharavi-Alkhansari, Thomas S. Huang:
A fractal-based image block-coding algorithm. ICASSP (5) 1993: 345-348
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 2025-01-09 13:07 CET 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:
