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

Javad Razavilar

dblp:49/10710 · DBLP profile ↗
← Back
6ranked-venue papers
6as first author
0since 2021 · last 2002
—ORCID · none

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

Computer networks · 4 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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
3 papers
Physical-layer communications · 38% Cellular and mobile networks · 18% Network performance modeling · 17%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › beamforming
adaptive beamforming
0.122000
Traffic improvements in wireless communication networks using antenna arrays · IEEE J. Sel. Areas Commun. 2000
Software radio architecture with smart antennas: a tutorial on algorithms and complexity · IEEE J. Sel. Areas Commun. 1999
Physical-layer communications › antenna arrays
smart antennas
0.122000
Traffic improvements in wireless communication networks using antenna arrays · IEEE J. Sel. Areas Commun. 2000
Software radio architecture with smart antennas: a tutorial on algorithms and complexity · IEEE J. Sel. Areas Commun. 1999
Network optimization and economics
optimal control policy
0.012002
Jointly optimized bit-rate/delay control policy for wireless packet networks with fading channels · IEEE Trans. Commun. 2002
Cellular and mobile networks
radio resource management
0.012002
Jointly optimized bit-rate/delay control policy for wireless packet networks with fading channels · IEEE Trans. Commun. 2002
Transport protocols and congestion control
rate control
0.012002
Jointly optimized bit-rate/delay control policy for wireless packet networks with fading channels · IEEE Trans. Commun. 2002
Network performance modeling › loss systems
blocking probability
0.012000
Traffic improvements in wireless communication networks using antenna arrays · IEEE J. Sel. Areas Commun. 2000
Network performance modeling
queueing analysis
0.012000
Traffic improvements in wireless communication networks using antenna arrays · IEEE J. Sel. Areas Commun. 2000
Physical-layer communications › beamforming › beamforming design
joint beamforming and power allocation
0.011999
Software radio architecture with smart antennas: a tutorial on algorithms and complexity · IEEE J. Sel. Areas Commun. 1999
Cellular and mobile networks
power control
0.011999
Software radio architecture with smart antennas: a tutorial on algorithms and complexity · IEEE J. Sel. Areas Commun. 1999
Routing and switching
traffic engineering
0.012000
Traffic improvements in wireless communication networks using antenna arrays · IEEE J. Sel. Areas Commun. 2000
Wireless networking
software radio
0.011999
Software radio architecture with smart antennas: a tutorial on algorithms and complexity · IEEE J. Sel. Areas Commun. 1999

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

fading channel model · 0.0dynamic programming · 0.0queueing analysis · 0.0adaptive beamforming · 0.0handoff algorithm · 0.0complexity analysis · 0.0
YearPublicationVenuePosition
2002 Jointly optimized bit-rate/delay control policy for wireless packet networks with fading channels
abstract
We consider the downlink rate control problem in a wireless channel. A dynamic programming optimization method is introduced to obtain the optimal bit-rate/delay control policy in the downlink for packet transmission in wireless networks with fading channels. We assume that the base station is capable of transmitting data packets in the downlink with different bit rates, R/sub 0/<R/sub 1/</spl middot//spl middot//spl middot/
Javad Razavilar, K. J. Ray Liu, Steven I. Marcus
IEEE Trans. Commun.1
2000 Traffic improvements in wireless communication networks using antenna arrays
abstract
A wireless network with beamforming capabilities at the receiver is considered that allows two or more transmitters to share the same channel to communicate with the base station. A novel approach is introduced, which combines the effects of the digital signal processing (adaptive beamforming) at the physical layer with the traffic policies at the network layer on the overall queuing model of a cell. The effect of signal processing on the queuing model of the cell is represented by a parameter in the final cell model. Each cell is modeled by a multiuser/multiserver service facility, where each server is a beamformed channel formed by the cell's base station. From this effective cell model, we find the closed form solutions for blocking probabilities of the calls and total carried traffic in a wireless network with adaptive arrays. Our analytical as well as numerical results show that adaptive beamforming at the receiver reduces the blocking probability of the calls and increases the total carried traffic in the system.
Javad Razavilar, Farrokh Rashid-Farrokhi, K. J. Ray Liu
IEEE J. Sel. Areas Commun.1
1999 Joint beamforming and handoff for traffic improvements in wireless networks
abstract
A cellular wireless network with beamforming capabilities at the receiver is considered which allows two or more transmitters to share the same channel for communicating with the base station. A novel approach is introduced which combines the effects of the digital signal processing at the physical layer along with the network layer protocol on the overall queuing model of a cell. From this effective cell model, we find the closed form solutions for blocking probabilities of the calls and total carried traffic in the system. Our analytical as well as numerical results show that adaptive beamforming at the receiver reduces the blocking probability of the calls and increases the total carried traffic in the system.
Javad Razavilar, Farrokh Rashid-Farrokhi, K. J. Ray Liu
ICC1
1999 Software radio architecture with smart antennas: a tutorial on algorithms and complexity
abstract
Abstract — Recently, there has been considerable interest in using antenna arrays in wireless communication networks to increase the capacity and decrease the cochannel interference. Adaptive beamforming with smart antennas at the receiver increases the carrier-to-interference ratio (CIR) in a wireless link. This paper considers a wireless network with beamforming capabilities at the receiver which allows two or more transmitters to share the same channel to communicate with the base station. The concrete computational complexity and algorithm structure of a base station are considered in terms of a software radio system model, initially with an omnidirectional antenna. The software radio computational model is then expanded to characterize a network with smart antennas. The application of the software radio smart antenna is demonstrated through two examples. First, traffic improvement in a network with a smart antenna is considered, and the implementation of a hand-off algorithm in the software radio is presented. The blocking probabilities of the calls and total carried traffic in the system under different traffic policies are derived. The analytical and numerical results show that adaptive beamforming at the receiver reduces the probability of blocking and forced termination of the calls and increases the total carried traffic in the system. Then, a joint beamforming and power control algorithm is implemented in a software radio smart antenna in a CDMA network. This shows that, by using smart antennas, each user can transmit with much lower power, and therefore the system capacity increases significantly. Index Terms—Adaptive beamforming, handoff, power control, smart antennas, software radio. I.
Javad Razavilar, Farrokh Rashid-Farrokhi, K. J. Ray Liu
IEEE J. Sel. Areas Commun.1
1998 A structured low-rank matrix pencil for spectral estimation and system identification
Javad Razavilar, Geoffrey Ye Li, K. J. Ray Liu
Signal Process.1
1996 Spectral estimation based on structured low rank matrix pencil
abstract
This paper proposes a new parameter estimation algorithm for damped sinusoidal signals. Parameter estimation for damped sinusoidal signals with additive white noise is a problem of significant interest in many signal processing applications, like analysis of NMR data and system identification. The new algorithm estimates the signal parameters using a matrix pencil constructed from the measured data. To reduce the noise effect, a rank deficient Hankel approximation of the prediction matrix is used. The performance of the new algorithm is significantly improved by structured low rank approximation of the prediction matrix. Computer simulations show that the noise threshold of the new algorithm is significantly better than the existing algorithms.
Javad Razavilar, Geoffrey Ye Li, K. J. Ray Liu
ICASSP1