Остановите войну!
for scientists:
default search action
Pavan K. Vitthaladevuni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [c8]Danlu Zhang, Pavan K. Vitthaladevuni, Jilei Hou, Bibhu Mohanty:
Performance Gains of Single-Frequency Dual-Cell HSDPA. GLOBECOM 2011: 1-6 - [c7]Pavan K. Vitthaladevuni, Rohit Kapoor, Ozcan Ozturk, Wei Zeng:
CSoHS voice capacity in HSPA networks with realistic overhead channel modeling. PIMRC 2011: 2122-2127 - 2010
- [c6]Pavan K. Vitthaladevuni, Haitong Sun, Danlu Zhang, Sharad Sambhwani, Jilei Hou:
MIMO in HSDPA and Legacy-MIMO Co-Existence. GLOBECOM 2010: 1-5 - [c5]Vinay Chande, Haitong Sun, Pavan K. Vitthaladevuni, Jilei Hou, Bibhu Mohanty:
Performance Analysis of 64-QAM and MIMO in Release 7 WCDMA (HSPA+) Systems. VTC Spring 2010: 1-5 - [c4]Danlu Zhang, Pavan K. Vitthaladevuni, Bibhu Mohanty, Jilei Hou:
Performance Analysis of Dual-Carrier HSDPA. VTC Spring 2010: 1-5
2000 – 2009
- 2006
- [j9]Md. Jahangir Hossain, Pavan K. Vitthaladevuni, Mohamed-Slim Alouini, Vijay K. Bhargava, Andrea J. Goldsmith:
Adaptive hierarchical modulation for simultaneous voice and multiclass data transmission over fading channels. IEEE Trans. Veh. Technol. 55(4): 1181-1194 (2006) - 2005
- [j8]Pavan K. Vitthaladevuni, Mohamed-Slim Alouini:
Effect of imperfect phase and timing synchronization on the bit-error rate performance of PSK modulations. IEEE Trans. Commun. 53(7): 1096-1099 (2005) - [j7]Pavan K. Vitthaladevuni, Mohamed-Slim Alouini, John C. Kieffer:
Exact BER computation for cross QAM constellations. IEEE Trans. Wirel. Commun. 4(6): 3039-3050 (2005) - 2004
- [j6]Pavan K. Vitthaladevuni, Mohamed-Slim Alouini:
A tight upper bound on the BER of linear systematic block codes. IEEE Commun. Lett. 8(5): 299-301 (2004) - [j5]Pavan K. Vitthaladevuni, Mohamed-Slim Alouini:
A closed-form expression for the exact BER of generalized PAM and QAM constellations. IEEE Trans. Commun. 52(5): 698-700 (2004) - 2003
- [j4]Pavan K. Vitthaladevuni, Mohamed-Slim Alouini:
Discussion of "Economic Load Dispatch - A Comparative Study on Heuristic Optimization Techniques With an Improved Coordinated Aggregation-Based PSO". IEEE Trans. Broadcast. 49(4): 408 (2003) - [j3]Pavan K. Vitthaladevuni, Mohamed-Slim Alouini:
Exact BER computation of generalized hierarchical PSK constellations. IEEE Trans. Commun. 51(12): 2030-2037 (2003) - [j2]Pavan K. Vitthaladevuni, Mohamed-Slim Alouini:
A recursive algorithm for the exact BER computation of generalized hierarchical QAM constellations. IEEE Trans. Inf. Theory 49(1): 297-307 (2003) - 2002
- [c3]Pavan K. Vitthaladevuni, Mohamed-Slim Alouini:
Exact BER computation of generalized hierarchical PSK constellations. ICC 2002: 1974-1978 - [c2]Pavan K. Vitthaladevuni, Mohamed-Slim Alouini:
BER computation of 4/M-QAM hierarchical constellations. PIMRC 2002: B85-B89 - 2001
- [j1]Pavan K. Vitthaladevuni, Mohamed-Slim Alouini:
BER computation of 4/M-QAM hierarchical constellations. IEEE Trans. Broadcast. 47(3): 228-239 (2001) - [c1]Pavan K. Vitthaladevuni, Mohamed-Slim Alouini:
BER computation of generalized QAM constellations. GLOBECOM 2001: 632-636
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 2023-09-28 02: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