Ozgun Yilmaz Bursalioglu
Research Subjects
Ozgun Yilmaz Bursalioglu has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Giuseppe Caire
Technische Universität Berlin
2 shared publications Haralabos C. Papadopoulos
DOCOMO Innovations Inc., Palo Alto, CA, USA
2 shared publicationsQiaoyang Ye
WNCG, The University of Texas at Austin, Austin, TX, USA
2 shared publications- Chenwei Wang
DOCOMO Innovations Inc., Palo Alto, CA, USA
1 shared publication - Constantine Caramanis
University of Texas, Austin, USA
1 shared publication - Dan Goldman
Google, United States of America
1 shared publication
Latest Publications
- Open Access
- 25 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Generative AI for 2D Character Animation
In this pilot project, we teamed up with artists to develop new workflows for 2D animation while producing a short educational cartoon. We created several workflows streamlining the animation process, bringing the artists’ vision to the screen more effectively.
- 25 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Open AccessGenerative AI for 2D Character Animation
In this pilot project, we teamed up with artists to develop new workflows for 2D animation while producing a short educational cartoon. We created several workflows streamlining the animation process, bringing the artists’ vision to the screen more effectively.
- Open Access
- 1 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3-10
A novel alternative to cloud RAN for throughput densification: Coded pilots and fast user-packet scheduling at remote radio heads
We consider wireless networks of remote radio heads (RRH) with large antenna-arrays, operated in TDD, with uplink (UL) training and channel-reciprocity based downlink (DL) transmission. To achieve large area spectral efficiencies, we advocate the use of methods that rely on rudimentary scheduling, decentralized operation at each RRH and user-centric DL transmission. A slotted system is assumed, whereby users are randomly scheduled (e.g., via shuffled round robin) in slots and across the limited pilot dimensions per slot. As a result, multiple users in the vicinity of an RRH can simultaneously transmit pilots on the same pilot dimension (and thus interfering with one another). Each RRH performs rudimentary processing of the pilot observations in “sectors”. In a sector, the RRH is able to resolve a scheduled user's channel when that user is determined to be the only one among the scheduled users (on the same pilot dimension) with significant received power in the sector. Subsequently, only the subset of scheduled users whose channels are resolved in at least one sector can be served by the system. We consider a spatially consistent evaluation of the area multi-plexing gains by means of a Poisson Point Process (PPP) problem formulation where RRHs, blockers, scatterers and scheduled user terminals are all PPPs with individual intensities. Also, we study directional training at the user terminals. Our simulations suggest that, by controlling the intensity of the scheduled user PPP and the user-pilot beam-width, many fold improvements can be expected in area multiplexing gains with respect to conventional spatial pilot reuse systems.
- 1 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3-10
Open AccessA novel alternative to cloud RAN for throughput densification: Coded pilots and fast user-packet scheduling at remote radio heads
We consider wireless networks of remote radio heads (RRH) with large antenna-arrays, operated in TDD, with uplink (UL) training and channel-reciprocity based downlink (DL) transmission. To achieve large area spectral efficiencies, we advocate the use of methods that rely on rudimentary scheduling, decentralized operation at each RRH and user-centric DL transmission. A slotted system is assumed, whereby users are randomly scheduled (e.g., via shuffled round robin) in slots and across the limited pilot dimensions per slot. As a result, multiple users in the vicinity of an RRH can simultaneously transmit pilots on the same pilot dimension (and thus interfering with one another). Each RRH performs rudimentary processing of the pilot observations in “sectors”. In a sector, the RRH is able to resolve a scheduled user's channel when that user is determined to be the only one among the scheduled users (on the same pilot dimension) with significant received power in the sector. Subsequently, only the subset of scheduled users whose channels are resolved in at least one sector can be served by the system. We consider a spatially consistent evaluation of the area multi-plexing gains by means of a Poisson Point Process (PPP) problem formulation where RRHs, blockers, scatterers and scheduled user terminals are all PPPs with individual intensities. Also, we study directional training at the user terminals. Our simulations suggest that, by controlling the intensity of the scheduled user PPP and the user-pilot beam-width, many fold improvements can be expected in area multiplexing gains with respect to conventional spatial pilot reuse systems.
- Open Access
- 29 March 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 64 (5) , 2049-2065
User Association and Interference Management in Massive MIMO HetNets
Two key traits of 5G cellular networks are much higher base station (BS) densities-especially in the case of low-power BSs-and the use of massive MIMO at these BSs. This paper explores how massive MIMO can be used to jointly maximize the offloading gains and minimize the interference challenges arising from adding small cells. We consider two interference management approaches: joint transmission (JT) with local precoding, where users are served simultaneously by multiple BSs without requiring channel state information exchanges among cooperating BSs, and resource blanking, where some macro BS resources are left blank to reduce the interference in the small cell downlink. A key advantage offered by massive MIMO is channel hardening, which enables to predict instantaneous rates a priori. This allows us to develop a unified framework, where resource allocation is cast as a network utility maximization (NUM) problem, and to demonstrate large gains in cell-edge rates based on the NUM solution. We propose an efficient dual subgradient based algorithm, which converges towards the NUM solution. A scheduling scheme is also proposed to approach the NUM solution. Simulations illustrate more than 2x rate gain for 10th percentile users vs. an optimal association without interference management.
- 29 March 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 64 (5) , 2049-2065
Open AccessUser Association and Interference Management in Massive MIMO HetNets
Two key traits of 5G cellular networks are much higher base station (BS) densities-especially in the case of low-power BSs-and the use of massive MIMO at these BSs. This paper explores how massive MIMO can be used to jointly maximize the offloading gains and minimize the interference challenges arising from adding small cells. We consider two interference management approaches: joint transmission (JT) with local precoding, where users are served simultaneously by multiple BSs without requiring channel state information exchanges among cooperating BSs, and resource blanking, where some macro BS resources are left blank to reduce the interference in the small cell downlink. A key advantage offered by massive MIMO is channel hardening, which enables to predict instantaneous rates a priori. This allows us to develop a unified framework, where resource allocation is cast as a network utility maximization (NUM) problem, and to demonstrate large gains in cell-edge rates based on the NUM solution. We propose an efficient dual subgradient based algorithm, which converges towards the NUM solution. A scheduling scheme is also proposed to approach the NUM solution. Simulations illustrate more than 2x rate gain for 10th percentile users vs. an optimal association without interference management.
- Open Access
- 1 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Harmonized Cellular and Distributed Massive MIMO: Load Balancing and Scheduling
Multi-tier networks with large-array base stations (BSs) that are able to operate in the "massive MIMO" regime are envisioned to play a key role in meeting the exploding wireless traffic demands. Operated over small cells with reciprocity-based training, massive MIMO promises large spectral efficiencies per unit area with low overheads. Also, near-optimal user-BS association and resource allocation are possible in cellular massive MIMO HetNets using simple admission control mechanisms and rudimentary BS schedulers, since scheduled user rates can be predicted a priori with massive MIMO. Reciprocity-based training naturally enables coordinated multi-point transmission (CoMP), as each uplink pilot inherently trains antenna arrays at all nearby BSs. In this paper we consider a distributed-MIMO form of CoMP, which improves cell-edge performance without requiring channel state information exchanges among cooperating BSs. We present methods for harmonized operation of distributed and cellular massive MIMO in the downlink that optimize resource allocation at a coarser time scale across the network. We also present scheduling policies at the resource block level which target approaching the optimal allocations. Simulations reveal that the proposed methods can significantly outperform the network-optimized cellular-only massive MIMO operation (i.e., operation without CoMP), especially at the cell edge.
- 1 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Open AccessHarmonized Cellular and Distributed Massive MIMO: Load Balancing and Scheduling
Multi-tier networks with large-array base stations (BSs) that are able to operate in the "massive MIMO" regime are envisioned to play a key role in meeting the exploding wireless traffic demands. Operated over small cells with reciprocity-based training, massive MIMO promises large spectral efficiencies per unit area with low overheads. Also, near-optimal user-BS association and resource allocation are possible in cellular massive MIMO HetNets using simple admission control mechanisms and rudimentary BS schedulers, since scheduled user rates can be predicted a priori with massive MIMO. Reciprocity-based training naturally enables coordinated multi-point transmission (CoMP), as each uplink pilot inherently trains antenna arrays at all nearby BSs. In this paper we consider a distributed-MIMO form of CoMP, which improves cell-edge performance without requiring channel state information exchanges among cooperating BSs. We present methods for harmonized operation of distributed and cellular massive MIMO in the downlink that optimize resource allocation at a coarser time scale across the network. We also present scheduling policies at the resource block level which target approaching the optimal allocations. Simulations reveal that the proposed methods can significantly outperform the network-optimized cellular-only massive MIMO operation (i.e., operation without CoMP), especially at the cell edge.
- Open Access
- 15 September 2008
- Published by Wiley in International Journal of Digital Multimedia Broadcasting
- Vol. 2008, 1-18
Lossy Joint Source-Channel Coding Using Raptor Codes
The straightforward application of Shannon's separation principle may entail a significant suboptimality in practical systems with limited coding delay and complexity. This is particularly evident when the lossy source code is based on entropy-coded quantization. In fact, it is well known that entropy coding is not robust to residual channel errors. In this paper, a joint source-channel coding scheme is advocated that combines the advantages and simplicity of entropy-coded quantization with the robustness of linear codes. The idea is to combine entropy coding and channel coding into a single linear encoding stage. If the channel is symmetric, the scheme can asymptotically achieve the optimal rate-distortion limit. However, its advantages are more clearly evident under finite coding delay and complexity. The sequence of quantization indices is decomposed into bitplanes, and each bitplane is independently mapped onto a sequence of channel coded symbols. The coding rate of each bitplane is chosen according to the bitplane conditional entropy rate. The use of systematic raptor encoders is proposed, in order to obtain a continuum of coding rates with a single basic encoding algorithm. Simulations show that the proposed scheme can outperform the separated baseline scheme for finite coding length and comparable complexity and, as expected, it is much more robust to channel errors in the case of channel capacity mismatch.
- 15 September 2008
- Published by Wiley in International Journal of Digital Multimedia Broadcasting
- Vol. 2008, 1-18
Open AccessLossy Joint Source-Channel Coding Using Raptor Codes
The straightforward application of Shannon's separation principle may entail a significant suboptimality in practical systems with limited coding delay and complexity. This is particularly evident when the lossy source code is based on entropy-coded quantization. In fact, it is well known that entropy coding is not robust to residual channel errors. In this paper, a joint source-channel coding scheme is advocated that combines the advantages and simplicity of entropy-coded quantization with the robustness of linear codes. The idea is to combine entropy coding and channel coding into a single linear encoding stage. If the channel is symmetric, the scheme can asymptotically achieve the optimal rate-distortion limit. However, its advantages are more clearly evident under finite coding delay and complexity. The sequence of quantization indices is decomposed into bitplanes, and each bitplane is independently mapped onto a sequence of channel coded symbols. The coding rate of each bitplane is chosen according to the bitplane conditional entropy rate. The use of systematic raptor encoders is proposed, in order to obtain a continuum of coding rates with a single basic encoding algorithm. Simulations show that the proposed scheme can outperform the separated baseline scheme for finite coding length and comparable complexity and, as expected, it is much more robust to channel errors in the case of channel capacity mismatch.