default search action
Farbod Kayhan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c21]Yasaman Omid, Zohre Mashayekh Bakhsh, Farbod Kayhan, Yi Ma, Rahim Tafazolli:
Space MIMO: Direct Unmodified Handheld to Multi-Satellite Communication. GLOBECOM 2023: 1447-1452 - [c20]Yasaman Omid, Zohre Mashayekh Bakhsh, Farbod Kayhan, Yi Ma, Fan Wang, Rahim Tafazolli:
On Capacity of Handheld to Multi-Satellite Communication. PIMRC 2023: 1-5 - [i13]Yasaman Omid, Zohre Mashayekh Bakhsh, Farbod Kayhan, Yi Ma, Rahim Tafazolli:
Space MIMO: Direct Unmodified Handheld to Multi-Satellite Communication. CoRR abs/2305.19049 (2023) - 2022
- [j11]Farbod Kayhan
, Guido Montorsi:
Short-length rate-compatible code design for noncoherent detection. Int. J. Satell. Commun. Netw. 40(1): 27-38 (2022) - 2021
- [j10]Alireza Haqiqatnejad
Energy-Efficient Hybrid Symbol-Level Precoding for Large-Scale mmWave Multiuser MIMO Systems. IEEE Trans. Commun. 69(5): 3119-3134 (2021) - [j9]Alireza Haqiqatnejad
Finite-Alphabet Symbol-Level Multiuser Precoding for Massive MU-MIMO Downlink. IEEE Trans. Signal Process. 69: 5595-5610 (2021) - 2020
- [j8]Alireza Haqiqatnejad
Robust SINR-Constrained Symbol-Level Multiuser Precoding With Imperfect Channel Knowledge. IEEE Trans. Signal Process. 68: 1837-1852 (2020) - [c19]Alireza Haqiqatnejad, Farbod Kayhan, Björn E. Ottersten:
Energy-Efficient Hybrid Symbol-Level Precoding via Phase Shifter Selection in mmWave MU-MIMO Systems. GLOBECOM 2020: 1-6 - [c18]Alireza Haqiqatnejad, Farbod Kayhan, Shahram Shahbazpanahi
One-Bit Quantized Constructive Interference Based Precoding for Massive Multiuser MIMO Downlink. ICC 2020: 1-6
2010 – 2019
- 2019
- [c17]Alireza Haqiqatnejad, Farbod Kayhan, Björn E. Ottersten:
An Approximate Solution for Symbol-Level Multiuser Precoding Using Support Recovery. SPAWC 2019: 1-5 - 2018
- [j7]Farbod Kayhan
On hierarchical modulation for satellite broadcasting. Int. J. Satell. Commun. Netw. 36(6): 460-473 (2018) - [j6]Ali R. Haqiqatnejad
Constructive Interference for Generic Constellations. IEEE Signal Process. Lett. 25(4): 586-590 (2018) - [j5]Alireza Haqiqatnejad
Power Minimizer Symbol-Level Precoding: A Closed-Form Suboptimal Solution. IEEE Signal Process. Lett. 25(11): 1730-1734 (2018) - [j4]Alireza Haqiqatnejad
Symbol-Level Precoding Design Based on Distance Preserving Constructive Interference Regions. IEEE Trans. Signal Process. 66(22): 5817-5832 (2018) - [c16]Farbod Kayhan, Guido Montorsi:
Code Design for Non-Coherent Detection of Frame Headers in Precoded Satellite Systems. ASMS/SPSC 2018: 1-6 - [c15]Alireza Haqiqatnejad, Farbod Kayhan, Björn E. Ottersten:
Robust Design of Power Minimizing Symbol-Level Precoder under Channel Uncertainty. GLOBECOM 2018: 1-6 - [c14]Alireza Haqiqatnejad, Farbod Kayhan, Björn E. Ottersten:
Symbol-Level Precoding Design for Max-Min SINR in Multiuser MISO Broadcast Channels. SPAWC 2018: 1-5 - [i12]Ali R. Haqiqatnejad, Farbod Kayhan, Björn E. Ottersten:
Symbol-Level Precoding Design for Max-Min SINR in Multiuser MISO Broadcast Channels. CoRR abs/1803.06871 (2018) - [i11]Alireza Haqiqatnejad, Farbod Kayhan, Björn E. Ottersten:
Symbol-Level Precoding Design Based on Distance Preserving Constructive Interference Regions. CoRR abs/1804.00930 (2018) - [i10]Alireza Haqiqatnejad, Farbod Kayhan, Björn E. Ottersten:
Robust Design of Power Minimizing Symbol-Level Precoder under Channel Uncertainty. CoRR abs/1805.02395 (2018) - [i9]Farbod Kayhan, Guido Montorsi:
Code Design for Non-Coherent Detection of Frame Headers in Precoded Satellite Systems. CoRR abs/1806.02607 (2018) - [i8]Alireza Haqiqatnejad, Farbod Kayhan, Björn E. Ottersten:
Power Minimizer Symbol-Level Precoding: A Closed-Form Sub-Optimal Solution. CoRR abs/1807.10619 (2018) - 2017
- [c13]Farbod Kayhan:
On Low Complexity Detection for QAM Isomorphic Constellations. GLOBECOM 2017: 1-5 - [i7]Farbod Kayhan:
On Low Complexity Detection for QAM Isomorphic Constellations. CoRR abs/1704.05334 (2017) - [i6]Guido Montorsi, Farbod Kayhan:
Low Complexity Two-Stage Soft/Hard Decoders. CoRR abs/1705.03242 (2017) - 2016
- [j3]Farbod Kayhan, Guido Montorsi:
Code design for adaptive coding and modulation indicator in broadcast systems. Int. J. Satell. Commun. Netw. 34(6): 771-785 (2016) - [c12]Farbod Kayhan:
QAM to circular isomorphic constellations. ASMS/SPSC 2016: 1-5 - [c11]Alberto Mengali, Farbod Kayhan, Bhavani Shankar, Björn E. Ottersten:
Low complexity transmit processing for multibeam satellite systems with non-linear channels. ASMS/SPSC 2016: 1-7 - [c10]Nicolò Mazzali
Four-dimensional constellations for dual-polarized satellite communications. ICC 2016: 1-6 - 2015
- [c9]Guido Montorsi, Farbod Kayhan:
Analog Digital Belief Propagation and its application to multi stage decoding systems. BlackSeaCom 2015: 82-86 - [c8]Paolo Spallaccini, Farbod Kayhan, Stefano Chinnici, Guido Montorsi:
Parallel Methods for Optimizing High Order Constellations on GPUs. IPDPS Workshops 2015: 1014-1023 - [c7]Farbod Kayhan, Nicolò Mazzali
Constellation design in four dimensions under average power constraint. SCVT 2015: 1-6 - [c6]Farbod Kayhan, Guido Montorsi, Giorgio Taricco
Comparative assessment of orthogonal and nonorthogonal multiplexing techniques for differentiated satellite broadcasting services. SCVT 2015: 1-6 - 2014
- [j2]Farbod Kayhan, Guido Montorsi:
Constellation Design for Memoryless Phase Noise Channels. IEEE Trans. Wirel. Commun. 13(5): 2874-2883 (2014) - 2013
- [c5]Farbod Kayhan, Guido Montorsi:
Constellation design for channels affected by phase noise. ICC 2013: 3154-3158 - 2012
- [j1]Farbod Kayhan, Guido Montorsi:
Joint signal-labeling optimization under peak power constraint. Int. J. Satell. Commun. Netw. 30(6): 251-263 (2012) - [c4]Farbod Kayhan, Guido Montorsi:
Constellation design for transmission over nonlinear satellite channels. GLOBECOM 2012: 3401-3406 - [i5]Farbod Kayhan, Guido Montorsi:
Constellation Design for Channels Affected by Phase Noise. CoRR abs/1210.1752 (2012) - [i4]Farbod Kayhan, Guido Montorsi:
Constellation Design for Transmission over Nonlinear Satellite Channels. CoRR abs/1210.1762 (2012) - 2011
- [i3]Alfredo Braunstein, Farbod Kayhan, Riccardo Zecchina:
Efficient data compression from statistical physics of codes over finite fields. CoRR abs/1108.6239 (2011) - 2010
- [c3]Farbod Kayhan, Guido Montorsi:
Joint Signal-Labeling Optimization for Pragmatic Capacity under Peak-Power Constraint. GLOBECOM 2010: 1-5
2000 – 2009
- 2009
- [c2]Alfredo Braunstein
Efficient LDPC codes over GF(q) for lossy data compression. ISIT 2009: 1978-1982 - [i2]Alfredo Braunstein, Farbod Kayhan, Riccardo Zecchina:
Efficient LDPC Codes over GF(q) for Lossy Data Compression. CoRR abs/0901.4467 (2009) - 2007
- [c1]Alfredo Braunstein
Encoding for the Blackwell Channel with Reinforced Belief Propagation. ISIT 2007: 1891-1895 - [i1]Alfredo Braunstein, Farbod Kayhan, Guido Montorsi, Riccardo Zecchina:
Encoding for the Blackwell Channel with Reinforced Belief Propagation. CoRR abs/0705.0423 (2007)
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-24 22:48 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: