default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMahmoud Farhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j12]Ahmad Ali Rafiee
, Mahmoud Farhang:
A deep convolutional neural network for salt-and-pepper noise removal using selective convolutional blocks. Appl. Soft Comput. 145: 110535 (2023)- [j11]Ahmad Ali Rafiee, Mahmoud Farhang:
A very fast and efficient multistage selective convolution filter for removal of salt and pepper noise. J. Ambient Intell. Humaniz. Comput. 14(9): 1-17 (2023) - [i1]Ahmad Ali Rafiee, Mahmoud Farhang:
A deep convolutional neural network for salt-and-pepper noise removal using selective convolutional blocks. CoRR abs/2302.05435 (2023) - 2022
- [j10]Sadjad Haddadi, Mahmoud Farhang, Mostafa Derakhtian:
Reliability-based quantization for soft decoding of LDPC codes in short-reach optical links. IET Commun. 16(1): 91-99 (2022) - 2021
- [j9]Sadjad Haddadi, Mahmoud Farhang, Mostafa Derakhtian:
Generalized weighted bit-flipping LDPC decoding for asymmetric optical channels. Phys. Commun. 47: 101369 (2021) - 2020
- [j8]Sadjad Haddadi, Mahmoud Farhang, Mostafa Derakhtian:
Low-complexity decoding of LDPC codes using reduced-set WBF-based algorithms. EURASIP J. Wirel. Commun. Netw. 2020(1): 180 (2020)
2010 – 2019
- 2018
- [j7]Saeed Mehboodi, Ali Jamshidi, Mahmoud Farhang:
Spreading sequence estimation algorithms based on ML detector in DSSS communication systems. IET Signal Process. 12(6): 802-809 (2018) - 2016
- [c1]Saeed Mehboodi, Ali Jamshidi, Mahmoud Farhang:
A low-complexity near-optimal algorithm for blind estimation of pseudo-noise sequences in DSSS communication systems. IST 2016: 218-221 - 2015
- [j6]Sedighe Sedaghatnejad, Mahmoud Farhang:
Detectability of Chaotic Direct-Sequence Spread-Spectrum Signals. IEEE Wirel. Commun. Lett. 4(6): 589-592 (2015) - 2014
- [j5]Morteza H. Shoreh, Hamid Hosseinianfar, Farhad Akhoundi, Ehsan Yazdian, Mahmoud Farhang, Jawad A. Salehi:
Design and Implementation of Spectrally-Encoded Spread-Time CDMA Transceiver. IEEE Commun. Lett. 18(5): 741-744 (2014) - 2011
- [j4]Mahmoud Farhang, Jawad A. Salehi:
Correction to "Optimum Receiver Design for Transmitted-Reference Signaling" [May 10 1589-1598]. IEEE Trans. Commun. 59(3): 911 (2011) - 2010
- [j3]Mahmoud Farhang, Jawad A. Salehi:
Optimum receiver design for transmitted-reference signaling. IEEE Trans. Commun. 58(5): 1589-1598 (2010)
2000 – 2009
- 2009
- [j2]Mahmoud Farhang, Jawad A. Salehi:
Optimum and suboptimum memoryless nonlinearities for the detection of ultrashort light pulses in Gaussian noise. IEEE Trans. Commun. 57(12): 3561-3565 (2009) - 2008
- [j1]Mahmoud Farhang, Jawad A. Salehi:
On the Performance of Spectrally-Encoded Spread-Time Ultrawideband CDMA Communication Systems. IEEE Trans. Wirel. Commun. 7(11-2): 4608-4616 (2008)
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:57 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:
