Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chandrasekar Sankaran

dblp:47/5386 · also Chandy Sankaran · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Physical-layer communications · 46% Wireless networking · 18% Internet architecture and protocols · 18%
Theoretical computer science
1 paper
Coding theory · 77% Mathematical optimization · 23%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications › signal detection
multiuser detection
0.122002
The use of multiuser detectors for multicasting in wireless ad hoc CDMA networks · IEEE Trans. Inf. Theory 2002
Solving a Class of Optimum Multiuser Detection Problems with Polynomial Complexity · IEEE Trans. Inf. Theory 1998
Physical-layer communications › signal detection › multiuser detection
linear multiuser detection
0.012002
The use of multiuser detectors for multicasting in wireless ad hoc CDMA networks · IEEE Trans. Inf. Theory 2002
Wireless networking
mobile ad hoc networks
0.012002
The use of multiuser detectors for multicasting in wireless ad hoc CDMA networks · IEEE Trans. Inf. Theory 2002
Internet architecture and protocols
multicast
0.012002
The use of multiuser detectors for multicasting in wireless ad hoc CDMA networks · IEEE Trans. Inf. Theory 2002
Routing and switching
routing
0.012002
The use of multiuser detectors for multicasting in wireless ad hoc CDMA networks · IEEE Trans. Inf. Theory 2002
Coding theory › error-correcting codes
code construction
0.011998
Solving a Class of Optimum Multiuser Detection Problems with Polynomial Complexity · IEEE Trans. Inf. Theory 1998
Mathematical optimization
discrete optimization
0.011998
Solving a Class of Optimum Multiuser Detection Problems with Polynomial Complexity · IEEE Trans. Inf. Theory 1998

Methods — techniques the papers use, named apart from their topics

polynomial complexity analysis · 0.0graph theory transformation · 0.0session admission control · 0.0CDMA · 0.0
YearPublicationVenuePosition
2009 Performance of Frequency Selective Scheduling and Fractional Frequency Reuse Schemes for WIMAX
abstract
WiMaX is the commercial name for the 4G OFDM based wireless broadband data transmission standard 802.16, developed by IEEE ([1] and [2]). It is currently being deployed in several countries around the world. Sub-channels (which are the basic unit of resource allocation) are formed by grouping together sub-carriers in one of two formats - PUSC or AMC. In PUSC the set of sub-carriers in a sub-channel are distributed throughout the bandwidth while in AMC the sub-carriers in a subchannel are contiguous within a portion of the bandwidth. In this paper we study two candidates that offer the potential to improve the system performance of PUSC and identify scenarios when this improvement is possible: (i) compare the performance of PUSC with two flavors of AMC; and (ii) study how the PUSC performance can be improved by a Fractional Frequency Reuse (FFR) scheme that tries to perform interference mitigation/co-ordination and improve the throughput of users at the edge of the cell.
Chandrasekar Sankaran, Amitava Ghosh
VTC Spring1
2007 WiMAX System Performance with Multiple Transmit and Multiple Receive Antennas
abstract
In this paper, the performance of WiMAX networks using multiple transmit and multiple receiver antennas are analyzed via system simulations. For downlink, two kinds of technologies are studied: i) open loop: where the base station has no knowledge of channel and uses mobile mode selection feedback to switch between single data stream STBC and multi-stream spatial multiplexing MIMO (SM-MIMO); ii) closed loop: where base station has explicit knowledge of downlink channel and transmits using adaptive beamforming. This paper compares the WiMAX downlink system performance using open loop and closed loop MIMO technologies with various frequency reuse factors and different data traffic models. The performance of WiMAX uplink is also analyzed with multiple receive antennas and using both single input multiple output (SIMO) and multi-user MIMO (MU-MIMO, a.k.a. SDMA).
Amitava Ghosh, Chandrasekar Sankaran, Stanley J. Benes
VTC Spring3
2006 WiMAX Overview and System Performance
abstract
In this paper, the performance of WiMax network with DL SIMO, DL MIMO and UL SIMO is analyzed via system simulations. Two data traffic models are considered, namely Web browsing (HTTP) and full buffer sessions, operating in multi path fading channels such as the ITU pedestrian-B and vehicular-A channels. The control channel coverage and reliability of WiMAX using realistic overhead is also analyzed in this paper.
Amitava Ghosh, Chandrasekar Sankaran, Philip J. Fleming
VTC Fall3
2002 The use of multiuser detectors for multicasting in wireless ad hoc CDMA networks
abstract
In this paper, we address the issue of performance of linear multiuser detectors for a multicasting application in an ad hoc wireless network. Using a code-division multiple-access (CDMA) framework, we demonstrate how capacity results for multiuser detectors can be adapted to do session admission control for the multicasting problem. We then develop a multicast routing algorithm for ad hoc wireless networks. Using the session admission control mechanism and the multicast routing algorithm, we evaluate the performance of three different linear multiuser detectors for the multicasting application.
Chandrasekar Sankaran, Anthony Ephremides
IEEE Trans. Inf. Theory1
1998 Solving a Class of Optimum Multiuser Detection Problems with Polynomial Complexity
abstract
We identify a class of optimum multiuser detection problems which can be solved with polynomial complexity in the number of users. The identification is based on transforming a quadratic 0-1 programming problem into an equivalent problem in graph theory. For a synchronous direct sequence code-division multiple access (CDMA) system, the result translates to designing a set of pseudorandom codes with the property that the cross correlation between every pair of codes in the set over one symbol period is nonpositive. We give two sets of codes with good correlation properties that fall within this class. Finally, we derive a bound on the cardinality of a signal set in an n-dimensional space, having the property that the cross correlation between every pair of signals in the set is nonpositive.
Chandrasekar Sankaran, Anthony Ephremides
IEEE Trans. Inf. Theory1