default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNambi Seshadri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Narendra Deconda, Nambi Seshadri, Ravinder David Koilpillai:
A Modified MRC Receiver for OTFS Systems with Oversampling. WCNC 2024: 1-6- [i3]Sudharsan Senthil, Shubham Paul, Nambi Seshadri, Ravinder David Koilpillai:
Learning Robust Representations for Communications over Noisy Channels. CoRR abs/2409.01129 (2024) - [i2]Shubham Paul, Sudharsan Senthil, Preethi Seshadri, Nambi Seshadri, Ravinder David Koilpillai:
Learning Robust Representations for Communications over Interference-limited Channels. CoRR abs/2410.19767 (2024) - 2023
- [c16]Shubham Paul, Nambi Seshadri, Ravinder David Koilpillai:
Deep-Learning based Equalization of Highly Compressed Faster Than Nyquist Signals. ANTS 2023: 396-401 - 2021
- [c15]G. Shishir, Romil Sonigra, Nambi Seshadri, Ravinder David Koilpillai:
Hybrid-ARQ Protocol for Next Generation Wi-Fi Systems. COMSNETS 2021: 342-350 - 2020
- [j30]Biswajit Dutta
, Rohit Budhiraja, Nambi Seshadri, Ravinder David Koilpillai:
Large-System Analysis of AF Full-Duplex Massive MIMO Two-Way MRC/MRT Relaying. IEEE Trans. Commun. 68(4): 2061-2077 (2020)
2010 – 2019
- 2019
- [c14]Akansh Jain, Sathwik Chadaga P, Nambi Seshadri, Ravinder David Koilpillai:
Faster-Than-Nyquist Signaling with Constraints on Pulse Shapes. PIMRC 2019: 1-6 - 2013
- [i1]Tsung-Yi Chen, Adam R. Williamson, Nambi Seshadri, Richard D. Wesel:
Feedback Communication Systems with Limitations on Incremental Redundancy. CoRR abs/1309.0707 (2013) - 2011
- [c13]Tsung-Yi Chen, Nambi Seshadri, Richard D. Wesel:
A Sphere-Packing Analysis of Incremental Redundancy with Feedback. ICC 2011: 1-5 - [c12]Joonsuk Kim, Sirikiat Lek Ariyavisitakul, Nambi Seshadri:
Closed-Loop Space Time Block Coding for High Data Rate with Angle Feedback. ICC 2011: 1-5 - [c11]Tsung-Yi Chen, Nambi Seshadri, Richard D. Wesel:
Incremental redundancy: A comparison of a sphere-packing analysis and convolutional codes. ITA 2011: 66-70 - 2010
- [c10]Tsung-Yi Chen, Nambi Seshadri, Ba-Zhong Shen:
Is feedback a performance equalizer of classic and modern codes? ITA 2010: 428-432
2000 – 2009
- 2008
- [c9]Joonsuk Kim, Sirikiat Lek Ariyavisitakul, Nambi Seshadri:
STBC/SFBC for 4 Transmit Antennas with 1-bit Feedback. ICC 2008: 3943-3947 - 2003
- [j29]Vahid Tarokh, Ayman F. Naguib, Nambi Seshadri, A. Robert Calderbank:
Errata to "space-time codes for high data rate wireless communications: performance criteria in the presence of channel estimation errors, mobility, and multiple paths". IEEE Trans. Commun. 51(12): 2141 (2003) - [j28]Hamid Jafarkhani, Nambi Seshadri:
Super-orthogonal space-time trellis codes. IEEE Trans. Inf. Theory 49(4): 937-950 (2003) - 2002
- [j27]Tim Fingscheidt, Thomas Hindelang, Richard V. Cox, Nambi Seshadri:
Joint source-channel (de-)coding for mobile communications. IEEE Trans. Commun. 50(2): 200-212 (2002) - 2001
- [j26]Gerhard Bauch, Joachim Hagenauer, Nambi Seshadri:
Turbo processing in transmit antenna diversity systems. Ann. des Télécommunications 56(7-8): 455-471 (2001) - [j25]Christina Fragouli, Nambirajan Seshadri, William Turin:
Reduced-trellis equalization using the M-BCJR algorithm. Wirel. Commun. Mob. Comput. 1(4): 397-406 (2001) - 2000
- [j24]Ayman F. Naguib, Nambi Seshadri, A. Robert Calderbank:
Increasing data rate over wireless channels. IEEE Signal Process. Mag. 17(3): 76-92 (2000) - [j23]A. Robert Calderbank, Gregory J. Pottie, Nambi Seshadri:
Cochannel interference suppression through time/space diversity. IEEE Trans. Inf. Theory 46(3): 922-932 (2000) - [c8]Thomas Hindelang, Tim Fingscheidt, Nambi Seshadri, Richard V. Cox:
Combined Source/Channel (De-)Coding: Can a Priori Information be Used Twice?. ICC (3) 2000: 1208-1212
1990 – 1999
- 1999
- [j22]Ye Li, Nambi Seshadri, Sirikiat Lek Ariyavisitakul:
Channel estimation for OFDM systems with transmitter diversity in mobile wireless channels. IEEE J. Sel. Areas Commun. 17(3): 461-471 (1999) - [j21]Vahid Tarokh, Ayman F. Naguib, Nambi Seshadri, A. Robert Calderbank:
Space-time codes for high data rate wireless communication: performance criteria in the presence of channel estimation errors, mobility, and multiple paths. IEEE Trans. Commun. 47(2): 199-207 (1999) - [j20]Vahid Tarokh, Ayman F. Naguib, Nambi Seshadri, A. Robert Calderbank:
Combined Array Processing and Space-Time Coding. IEEE Trans. Inf. Theory 45(4): 1121-1128 (1999) - [j19]Robert van Nobelen, Nambi Seshadri, Jim Whitehead, Shailender Timiri:
An adaptive radio link protocol with enhanced data rates for GSM evolution. IEEE Wirel. Commun. 6(1): 54-64 (1999) - [j18]Nelson Sollenberger, Nambi Seshadri, Richard V. Cox:
The evolution of IS-136 TDMA for third-generation wireless services. IEEE Wirel. Commun. 6(3): 8-18 (1999) - 1998
- [j17]Ayman F. Naguib, Vahid Tarokh, Nambi Seshadri, A. Robert Calderbank:
A space-time coding modem for high-data-rate wireless communications. IEEE J. Sel. Areas Commun. 16(8): 1459-1478 (1998) - [j16]Vahid Tarokh, Nambi Seshadri, A. Robert Calderbank:
Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction. IEEE Trans. Inf. Theory 44(2): 744-765 (1998) - 1997
- [j15]Oscar E. Agazzi, Nambirajan Seshadri:
On the use of tentative decisions to cancel intersymbol interference and nonlinear distortion (with application to magnetic recording channels). IEEE Trans. Inf. Theory 43(2): 394-408 (1997) - [c7]Vahid Tarokh, Nambi Seshadri, A. Robert Calderbank:
Space-Time Codes for High Data Rate Wireless Communication: Performance Criteria. ICC (1) 1997: 299-303 - [c6]Vahid Tarokh, Ayman F. Naguib, Nambi Seshadri, A. Robert Calderbank:
Space-Time Codes for High Data Rate Wireless Communication: Mismatch Analysis. ICC (1) 1997: 309-313 - [c5]Vahid Tarokh, Ayman F. Naguib, Nambi Seshadri, A. Robert Calderbank:
Low-rate multi-dimensional space-time codes for both slow and rapid fading channels. PIMRC 1997: 1206-1210 - 1996
- [c4]Wu Chou, Nambi Seshadri, Mazin G. Rahim:
Trellis encoded vector quantization for robust speech recognition. ICSLP 1996: 2001-2004 - 1995
- [j14]Ravi Prakash Ramachandran, Man Mohan Sondhi, Nambi Seshadri, Bishnu S. Atal:
A two codebook format for robust quantization of line spectral frequencies. IEEE Trans. Speech Audio Process. 3(3): 157-168 (1995) - 1994
- [j13]Carl-Erik W. Sundberg, Nambi Seshadri:
Response to comments on: Coded modulations for Rayleigh Fading Channels: An Overview. Eur. Trans. Telecommun. 5(4): 531 (1994) - [j12]Nambi Seshadri, Carl-Erik W. Sundberg:
List Viterbi decoding algorithms with applications. IEEE Trans. Commun. 42(234): 313-323 (1994) - [j11]Nambi Seshadri:
Joint data and channel estimation using blind trellis search techniques. IEEE Trans. Commun. 42(234): 1000-1011 (1994) - [c3]Wai-Choong Wong, Carl-Erik W. Sundberg, Nambi Seshadri:
STDD, an approach to low delay, high quality wireless speech communications. VTC 1994: 316-320 - 1993
- [j10]Carl-Erik W. Sundberg, Nambi Seshadri:
Coded Modulations for Fading Channels: An Overview. Eur. Trans. Telecommun. 4(3): 309-324 (1993) - [j9]Nambi Seshadri, Carl-Erik W. Sundberg:
Multi-Level Block Coded Modulations with Unequal Error Protection for the Rayleigh Fading Channel. Eur. Trans. Telecommun. 4(3): 325-334 (1993) - [j8]Nambi Seshadri, Carl-Erik W. Sundberg:
Multilevel trellis coded modulations for the Rayleigh fading channel. IEEE Trans. Commun. 41(9): 1300-1310 (1993) - [j7]A. Robert Calderbank, Nambirajan Seshadri:
Multilevel codes for unequal error protection. IEEE Trans. Inf. Theory 39(4): 1234-1248 (1993) - 1992
- [c2]David L. Neuhoff, Thrasyvoulos N. Pappas, Nambi Seshadri:
One-dimensional least-squares model-based halftoning. ICASSP 1992: 189-192 - 1991
- [j6]Richard V. Cox, Joachim Hagenauer, Nambi Seshadri, Carl-Erik W. Sundberg:
Subband speech coding and matched convolutional channel coding for mobile radio channels. IEEE Trans. Signal Process. 39(8): 1717-1731 (1991) - 1990
- [j5]Joachim Hagenauer, Nambi Seshadri, Carl-Erik W. Sundberg:
The performance of rate-compatible punctured convolutional codes for digital mobile radio. IEEE Trans. Commun. 38(7): 966-980 (1990)
1980 – 1989
- 1989
- [j4]Nambirajan Seshadri, John B. Anderson:
Decoding of severely filtered modulation codes using the (M, L) algorithm. IEEE J. Sel. Areas Commun. 7(6): 1006-1016 (1989) - 1988
- [j3]Richard V. Cox, Steven L. Gay, Yair Shoham, Schuyler R. Quackenbush, Nambirajan Seshadri, Nikil S. Jayant:
New directions in subband coding. IEEE J. Sel. Areas Commun. 6(2): 391-409 (1988) - [j2]Nambirajan Seshadri, John B. Anderson:
Asymptotic error performance of modulation codes in the presence of severe intersymbol interference. IEEE Trans. Inf. Theory 34(5): 1203-1216 (1988) - [c1]Richard V. Cox, Joachim Hagenauer, Nambi Seshadri, Carl-Erik W. Sundberg:
A sub-band coder designed for combined source and channel coding [speech coding]. ICASSP 1988: 235-238 - 1985
- [j1]Nambirajan Seshadri, P. R. Srikantakumar:
On Group Testing Protocols for Binary-Feedback Multiaccess Channel. IEEE Trans. Commun. 33(6): 574-577 (1985)
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-11-30 01:09 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:
