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

Kamyar Rohani

dblp:26/2695 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2006
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-authorComputer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 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
1 paper
Physical-layer communications · 87% Network optimization and economics · 13%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel state information
0.112006
Optimal bandwidth allocation for the data and feedback channels in MISO-FDD systems · IEEE Trans. Commun. 2006
Physical-layer communications › channel state information › channel state information feedback
limited feedback
0.112006
Optimal bandwidth allocation for the data and feedback channels in MISO-FDD systems · IEEE Trans. Commun. 2006
Physical-layer communications
MIMO
0.112006
Optimal bandwidth allocation for the data and feedback channels in MISO-FDD systems · IEEE Trans. Commun. 2006
Physical-layer communications › multiple-antenna systems
MISO systems
0.112006
Optimal bandwidth allocation for the data and feedback channels in MISO-FDD systems · IEEE Trans. Commun. 2006
Network optimization and economics › resource allocation
bandwidth allocation
0.012006
Optimal bandwidth allocation for the data and feedback channels in MISO-FDD systems · IEEE Trans. Commun. 2006
Network optimization and economics
resource allocation
0.012006
Optimal bandwidth allocation for the data and feedback channels in MISO-FDD systems · IEEE Trans. Commun. 2006
Coding theory › source coding
rate-distortion theory
0.012006
Optimal bandwidth allocation for the data and feedback channels in MISO-FDD systems · IEEE Trans. Commun. 2006

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

quantization codebook analysis · 0.1distortion-rate theory · 0.1beamforming · 0.1
YearPublicationVenuePosition
2006 Optimal bandwidth allocation for the data and feedback channels in MISO-FDD systems
abstract
In frequency-division duplex (FDD) systems, channel-state information (CSI) is estimated by the receiver and then fed back to the transmitter through a feedback link, which inevitably requires additional bandwidth and power. In this letter, we jointly study optimal bandwidth allocation between the data channel, modeled as a flat-fading multiple-input single-output (MISO) channel, and the feedback channel for maximum average throughput in the data channel using a beamforming scheme. We consider two models of the partial CSI at the transmitter (CSIT): the noisy CSIT, modeled as jointly Gaussian with the actual channel state, and the quantized CSIT. In the first model, we use distortion-rate theory to relate the CSIT accuracy to the feedback-link bandwidth. In the second model, we derive a lower bound on the achievable rate of the data channel based on the ensemble of a set of random quantization codebooks. We show that in the MISO flat-fading channel case, beamforming based on feedback CSI can achieve an average rate larger than the capacity without CSIT under a wide range of mobility conditions.
Yongzhe Xie, Costas N. Georghiades, Kamyar Rohani
IEEE Trans. Commun.3
2001 CDMA receiver performance for multiple-input multiple-output antenna systems
abstract
We consider the performance of a forward link (base-to-mobile) shared channel with and without a multiple-input multiple-output (MIMO) antenna system. A CDMA shared channel is analyzed and simulated for which users are served in a time division multiplexed (TDM) manner. The slot structure and chip rate are based on the wideband CDMA standard. Link-level simulations are presented to compare the performances of two different receivers: linear minimum mean-square-error (MMSE), and nonlinear (turbo/iterative) MMSE. In addition, MIMO performance is compared with and without antenna array weight feedback.
Mansoor Ahmed, Joseph Pautler, Kamyar Rohani
VTC Fall3
2001 On application of multiple-input multiple-output antennas to CDMA cellular systems
abstract
Our focus in this paper is on applying multiple-input multiple-output (MIMO) antenna systems to the time division multiplexed (TDM) shared channel on the WCDMA forward link. We describe cellular system-level simulations with and without MIMO. These simulations include multipath channel models and they account for other-cell interference. We compute the SINR at the output of a linear MMSE receiver and map these values to throughput using simulated turbo code results. Simulation results are presented with various numbers of antennas at the transmitter and receiver. We show that with two transmit and two receive antennas, system capacity can be doubled relative to one transmit and one receive antenna. Two transmit and four receive antennas can provide three times the capacity of a one transmit and one receive antenna system. Also, results are presented that compare three sector systems to six sector systems.
Joseph Pautler, Mansoor Ahmed, Kamyar Rohani
VTC Fall3
1992 Nonlinear neural network filters for image processing
abstract
Neural image processing filters provide an efficient means for synthesis of high-order nonlinear systems. Parallel hardware implementations are feasible. A modular design methodology for analysis and synthesis of nonlinear neural network filters is described. This method is based on a building block approach: subnetworks are designed separately and assembled via linear connecting layers. Efficient neural filters are designed by removing the connecting layers. Classical image processing filters such as Volterra, order statistic, and morphological filters are synthesized using large multilayer networks.>
Kamyar Rohani, Michael T. Manry
ICASSP1
1992 Neural subnet design by direct polynomial mapping
abstract
In a recent paper by M. Chen and M. Maury (1990), it was shown that multilayer perceptron neural networks can be used to form products of any number of inputs, thereby constructively proving universal approximation. This result is extended, and a method for the analysis and synthesis of single-input, single-output neural subnetworks is described. Given training samples of a function to be approximated, a feedforward neural network is designed which implements a polynomial approximation of the function with arbitrary accuracy. For comparison, example subnets are designed by classical backpropagation training and by mapping. The examples illustrate that the mapped subnets avoid local minima which backpropagation-trained subnets get trapped in and that the mapping approach is much faster.
Kamyar Rohani, Mu-Song Chen, Michael T. Manry
IEEE Trans. Neural Networks1