Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Aamod Khandekar"'
Publikováno v:
GLOBECOM
We design novel mechanisms and algorithms for fast, simple, and distributed interference management and scheduling in wireless femto networks via exchange of information over-the-air (OTA). We focus on the Long Term Evolution (LTE) of the 3GPP standa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13f8e0f5052aa5fff8acdd69c3d8e1b1
https://doi.org/10.1109/glocom.2010.5684257
https://doi.org/10.1109/glocom.2010.5684257
Autor:
Aamod Khandekar, Tingfang Ji, Jaber Mohammad Borran, Ashwin Sampath, Ritesh K. Madan, Naga Bhushan
Publikováno v:
GLOBECOM
We consider wireless femtocell networks where scheduling of transmissions is coordinated across multiple cells to mitigate interference and deliver fairness and quality of service (QoS). Coordination across multiple cells entails (i)~exchange of (ser
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::971f6b1312bb2c7443c53fe916849273
https://doi.org/10.1109/glocom.2010.5683280
https://doi.org/10.1109/glocom.2010.5683280
Publikováno v:
2010 European Wireless Conference (EW).
Long-Term Evolution (LTE) allows operators to use new and wider spectrum and complements 3G networks with higher data rates, lower latency and a flat IP-based architecture. To further improve broadband user experience in a ubiquitous and cost effecti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64532b59883069e3afa2ec65caa23bad
https://doi.org/10.1109/ew.2010.5483516
https://doi.org/10.1109/ew.2010.5483516
Autor:
Aamod Khandekar, R. Palanki
Publikováno v:
Proceedings IEEE International Symposium on Information Theory.
In this paper, we review the performance of irregular repeat accumulate (IRA) codes. We present simulation results on the performance of IRA codes in two non-binary modulation schemes viz., turbo-coded modulation and multilevel coding. These results
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::95ffe785af19519c4ae317b80b25d02a
https://doi.org/10.1109/isit.2002.1023443
https://doi.org/10.1109/isit.2002.1023443
Autor:
Aamod Khandekar, Robert J. McEliece
We discuss the complexity of achieving channel capacity on the binary erasure channel (BEC) in view of recent advances. We also extrapolate to conjecture complexity bounds on more general channels.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1e28bb1a0532cd370443ad0f95dbb643
https://resolver.caltech.edu/CaltechAUTHORS:20111104-122318374
https://resolver.caltech.edu/CaltechAUTHORS:20111104-122318374
Publikováno v:
Codes, Systems, and Graphical Models ISBN: 9780387951737
In this paper, we develop a method for closely estimating noise threshold values for ensembles of binary linear codes on the binary symmetric channel. Our method, based on the “typical pairs” decoding algorithm pioneered by Shannon, completely de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::31d856835e807ebf0621d46262fb6d72
https://doi.org/10.1007/978-1-4613-0165-3_11
https://doi.org/10.1007/978-1-4613-0165-3_11