Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where John S. Sadowsky is active.

Publication


Featured researches published by John S. Sadowsky.


Computer Networks | 2004

Traffic aided opportunistic scheduling for wireless networks: algorithms and performance bounds

Ming Hu; Junshan Zhang; John S. Sadowsky

In multiuser wireless networks, opportunistic scheduling can improve the system throughput and thus reduce the total completion time. In this paper, we explore the possibility of reducing the completion time further by incorporating traffic information into opportunistic scheduling. More specifically, we first establish convexity properties for opportunistic scheduling with file size information. Then, we develop new traffic aided opportunistic scheduling (TAOS) schemes by making use of file size information and channel variation in a unified manner. We also derive lower bounds and upper bounds on the total completion time, which serve as benchmarks for examining the performance of the TAOS schemes. Our results show that the proposed TAOS schemes can yield significant reduction in the total completion time. The impact of fading, file size distributions, and random arrivals and departures, on the system performance, is also investigated. In particular, in the presence of user dynamics, the proposed TAOS schemes perform well when the arrival rate is reasonably high.


international conference on computer communications | 2004

Traffic aided opportunistic scheduling for downlink transmissions: algorithms and performance bounds

Ming Hu; Junshan Zhang; John S. Sadowsky

In multiuser wireless networks, opportunistic scheduling can improve the system throughput and thus reduce the total completion time. In this paper, we explore the possibility of reducing the completion time further by incorporating traffic information into opportunistic scheduling. In particular, we first establish general properties for opportunistic scheduling with file size information. Then, we develop new traffic aided opportunistic scheduling (TAOS) schemes by making use of file size information and channel variation in a unified manner. We also derive lower and upper bounds on the total completion time. Our results show that the proposed TAOS schemes can yield significant reduction in the total completion time


vehicular technology conference | 2003

Cancellation accuracy in CDMA pilot interference cancellation

Shimon Moshavi; Daniel Yellin; Yoni Perets; John S. Sadowsky

Pilot interference cancellation (IC) in mobile receivers has recently gained attention for CDMA cellular networks. In this paper we address the accuracy of the pilot interference cancellation at the receiver. In doing so, we consider the effects of channel estimation, timing estimation, receiver tap-spacing granularity, and the other receiver imperfections. The analytical and simulation results illustrate that high cancellation accuracy is feasible for the pilot IC receiver. These result indicate that the significant potential capacity gains reported in [3GPP TR 25.99, 2001, J.S. Sadowski et al., 2003] for pilot IC, are achievable under realistic receiver conditions.


wireless communications and networking conference | 2003

Capacity gains from pilot cancellation in CDMA networks

John S. Sadowsky; Daniel Yellin; Shimon Moshavi; Yoni Perets

Common pilot cancellation in mobile receivers has recently gained attention for CDMA cellular networks. This paper presents system simulation results showing that the network capacity gains achievable from both ideal and hardware resource limited pilot cancellation receivers are significant. We show that the highest gains are achievable from both ideal and hardware resource limited pilot cancellation receivers are significant. We show that the highest gains are achieved for networks populated with high rate data users, rather than voice users. We also pay special attention to the interaction between pilot cancellation and soft handoff in a power controlled network. We show that pilot cancellation allows the network to operate with fewer mobiles in soft handoff, hence reducing network signaling overhead and infrastructure costs.


Archive | 2004

High-throughput multicarrier communication systems and methods for exchanging channel state information

Alexander Maltsev; Ali S. Sadri; Vadim Sergeyev; Adrian P. Stephens; John S. Sadowsky


Archive | 2004

Symbol de-mapping methods in multiple-input multiple-output systems

John S. Sadowsky


Archive | 2003

Systems and methods for adaptive bit loading in a multiple antenna orthogonal frequency division multiplexed communication system

John S. Sadowsky; Minnie Ho; Sumeet Sandhu; Alexander Maltsev; Eric A. Jacobsen; Ali S. Sadri


Archive | 2004

OFDM system with per subcarrier phase rotation

John S. Sadowsky; Shmuel Levy; Sumeet Sandhu; Keith Holt


Archive | 2013

Method for signaling information by modifying modulation constellations

Adrian P. Stephens; John S. Sadowsky


Archive | 2005

Increased discrete point processing in an OFDM communication system

John S. Sadowsky; Alexander Maltsev; Vadim Sergeyev; Alexei Davydov

Collaboration


Dive into the John S. Sadowsky's collaboration.

Researchain Logo
Decentralizing Knowledge