OKOnur Ozan Koyluoglu

Onur Ozan Koyluoglu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Onur Ozan Koyluoglu has a total of 33 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • On the Organization of Grid and Place Cells: Neural Denoising via Subspace Learning

    by David M. Schwartz, O. Ozan Koyluoglu

    Place cells in the hippocampus (HC) are active when an animal visits a certain location (referred to as a place field) within an environment. Grid cells in the medial entorhinal cortex (MEC) respond at multiple locations, with firing fields that form a periodic and hexagonal tiling of the environment. The joint activity of grid and place cell populations, as a function of location, forms a neural code for space. In this article, we develop an understanding of the relationships between coding theoretically relevant properties of the combined activity of these populations and how these properties limit the robustness of this representation to noise-induced interference. These relationships are revisited by measuring the performances of biologically realizable algorithms implemented by networks of place and grid cell populations, as well as constraint neurons, which perform denoising operations. Contributions of this work include the investigation of coding theoretic limitations of the mammalian neural code for location and how communication between grid and place cell networks may improve the accuracy of each population's representation. Simulations demonstrate that denoising mechanisms analyzed here can significantly improve the fidelity of this neural representation of space. Furthermore, patterns observed in connectivity of each population of simulated cells predict that anti-Hebbian learning drives decreases in inter-HC-MEC connectivity along the dorsoventral axis.


  • Repair Strategies for Mobile Storage Systems

    by Gokhan Calis, Swetha Shivaramaiah, O. Ozan Koyluoglu, Loukas Lazos

    We study the data reliability problem for devices forming a dynamic distributed storage system. Such systems are commonplace in traditional cloud storage applications where storage node failures and updates are frequent. We consider the application of regenerating codes for file maintenance. Such codes require lower bandwidth to regenerate lost data fragments compared to file replication or reconstruction. We investigate threshold-based repair strategies where data repair is initiated after a threshold number of data fragments have been lost. We show that at a low departure-to-repair rate regime, in which repairs are initiated after several nodes have left the system outperforms if repairs are initiated after a single node departure. This optimality is reversed when the node turnover is high. We further compare distributed and centralized repair strategies and derive the optimal repair threshold for minimizing the average repair cost per unit of time. In addition, we examine cooperative repair strategies and show performance improvements. We investigate several models for the time needed for node repair including a simple fixed time model and a more realistic model that takes into account the number of repaired nodes. Finally, an extended model where additional failures are allowed during the repair process is investigated.


  • The impact of encoding–decoding schemes and weight normalization in spiking neural networks

    by Zhengzhong Liang, David Schwartz, Gregory Ditzler, O. Ozan Koyluoglu


  • Centralized Repair of Multiple Node Failures With Applications to Communication Efficient Secret Sharing

    by Ankit Singh Rawat, Onur Ozan Koyluoglu, Sriram Vishwanath

    This paper considers a distributed storage system, where multiple storage nodes can be reconstructed simultaneously at a centralized location. This centralized multi-node repair (CMR) model is a generalization of regenerating codes that allow for bandwidth efficient repair of a single failed node. This work focuses on the trade-off between the amount of data stored and repair bandwidth in the CMR model. In particular, repair bandwidth bounds are derived for the minimum storage multi-node repair (MSMR) and the minimum bandwidth multinode repair (MBMR) operating points. The tightness of these bounds is analyzed via code constructions. The MSMR point is characterized by codes achieving this point under functional repair for the general set of CMR parameters, as well as with codes enabling exact repair for certain CMR parameters. The MBMR point, on the other hand, is characterized with exact repair codes for all CMR parameters for systems that satisfy a certain entropy accumulation property. Finally, the model proposed here is utilized for the secret sharing problem, where the codes for the multi-node repair problem are used to construct communication efficient secret sharing schemes with the property of bandwidth efficient share repair.


  • Open Access

    On the organization of grid and place cells: Neural de-noising via subspace learning

    by David M. Schwartz, O. Ozan Koyluoglu

    Place cells in the hippocampus are active when an animal visits a certain location (referred to as a place field) within an environment. Grid cells in the medial entorhinal cortex (MEC) respond at multiple locations, with firing fields that form a periodic and hexagonal tiling of the environment. The joint activity of grid and place cell populations, as a function of location, forms a neural code for space. An ensemble of codes is generated by varying grid and place cell population parameters. For each code in this ensemble, codewords are generated by stimulating a network with a discrete set of locations. In this manuscript, we develop an understanding of the relationships between coding theoretic properties of these combined populations and code construction parameters. These relationships are revisited by measuring the performances of biologically realizable algorithms implemented by networks of place and grid cell populations, as well as constraint neurons, which perform de-noising operations. Objectives of this work include the investigation of coding theoretic limitations of the mammalian neural code for location and how communication between grid and place cell networks may improve the accuracy of each population's representation. Simulations demonstrate that de-noising mechanisms analyzed here can significantly improve fidelity of this neural representation of space. Further, patterns observed in connectivity of each population of simulated cells suggest that inter-hippocampal-medial-entorhinal-cortical connectivity decreases downward along the dorsoventral axis.

  • Collective Secrecy Over the $K$ -Transmitter Multiple Access Channel

    by Yanling Chen, O. Ozan Koyluoglu, A. J. Han Vinck

    This paper studies the problem of secure communication over a K-transmitter multiple access channel (MAC) in the presence of an external eavesdropper, subject to a collective secrecy constraint (i.e., information leakage rate to an eavesdropper on a collection of messages that are from a pre-specified subset of the K transmitters, say S ⊆ K = {1, 2, ..., K}, is made vanishing). Since secrecy is of concern only to transmitters {i|i ∈ S} but not to transmitters {i|i ∈ Sc}, where Sc = K/S, different transmission strategies could be employed at transmitters {i|i ∈ Sc}. Consider the following two scenarios: 1) transmitters {i|i ∈ Sc} use deterministic encoders (which are conventionally used for MAC without secrecy), competing for the channel resource (i.e., being competitive); 2) transmitters {i|i ∈ Sc} use stochastic encoders, helping to hide other transmitters’ messages from the eavesdropper (i.e., being cooperative). As a result, we establish the respective S-collective secrecy achievable rate regions and demonstrate the advantage of being cooperative theoretically and numerically. To this end, in addition to the standard techniques, our results build upon two techniques. The first is a generalization of Chia-El Gamal’s lemma on entropy bound for a set of codewords given partial information. The second is to utilize a compact representation of a list of sets that, together with submodular properties of mutual information functions involved, leads to an efficient Fourier-Motzkin elimination. These two approaches allow to derive achievable regions in this work, and could also be of independent interest in other context.


  • Open Access

    Architecture-aware coding for distributed storage: Repairable block failure resilient codes

    by Gokhan Calis, O. Ozan Koyluoglu

    In large scale distributed storage systems (DSS) deployed in cloud computing, correlated failures resulting in simultaneous failure (or, unavailability) of blocks of nodes are common. In such scenarios, the stored data or a content of a failed node can only be reconstructed from the available live nodes belonging to the available blocks. To analyze the resilience of the system against such block failures, this work introduces the framework of Block Failure Resilient (BFR) codes, wherein the data (e.g., a file in DSS) can be decoded by reading out from a same number of codeword symbols (nodes) from a subset of available blocks of the underlying codeword. Further, repairable BFR codes are introduced, wherein any codeword symbol in a failed block can be repaired by contacting a subset of remaining blocks in the system. File size bounds for repairable BFR codes are derived, and the trade-off between per node storage and repair bandwidth is analyzed, and the corresponding minimum storage regenerating (BFR-MSR) and minimum bandwidth regenerating (BFR-MBR) points are derived. Explicit codes achieving the two operating points for a special case of parameters are constructed, wherein the underlying regenerating codewords are distributed to BFR codeword symbols according to combinatorial designs. Finally, BFR locally repairable codes (BFR-LRC) are introduced, an upper bound on the resilience is derived and optimal code construction are provided by a concatenation of Gabidulin and MDS codes. Repair efficiency of BFR-LRC is further studied via the use of BFR-MSR/MBR codes as local codes. Code constructions achieving optimal resilience for BFR-MSR/MBR-LRCs are provided for certain parameter regimes. Overall, this work introduces the framework of block failures along with optimal code constructions, and the study of architecture-aware coding for distributed storage systems.


  • Open Access

    Vulnerabilities of Massive MIMO Systems Against Pilot Contamination Attacks

    by Berk Akgun, Marwan Krunz, O. Ozan Koyluoglu

    We consider a single-cell massive MIMO system in which a base station (BS) with a large number of antennas transmits simultaneously to several single-antenna users in the presence of an attacker.The BS acquires the channel state information (CSI) based on uplink pilot transmissions. In this work, we demonstrate the vulnerability of CSI estimation phase to malicious attacks. For that purpose, we study two attack models. In the first model, the attacker aims at minimizing the sum-rate of downlink transmissions by contaminating the uplink pilots. In the second model, the attacker exploits its in-band full-duplex capabilities to generate jamming signals in both the CSI estimation and data transmission phases. We study these attacks under two downlink power allocation strategies when the attacker knows and does not know the locations of the BS and users. The formulated problems are solved using stochastic optimization, Lagrangian minimization, and game-theoretic methods. A closed-form solution for a special case of the problem is obtained. Furthermore, we analyze the achievable individual secrecy rates under a pilot contamination attack, and provide an upper bound on these rates. Our results indicate that the proposed attacks degrade the throughput of a massive MIMO system by more than half.

  • Open Access

    Fundamental bound on the persistence and capacity of short-term memory stored as graded persistent activity

    by Onur Ozan Koyluoglu, Yoni Pertzov, Sanjay Manohar, Masud Husain, Ila R Fiete

    It is widely believed that persistent neural activity underlies short-term memory. Yet, as we show, the degradation of information stored directly in such networks behaves differently from human short-term memory performance. We build a more general framework where memory is viewed as a problem of passing information through noisy channels whose degradation characteristics resemble those of persistent activity networks. If the brain first encoded the information appropriately before passing the information into such networks, the information can be stored substantially more faithfully. Within this framework, we derive a fundamental lower-bound on recall precision, which declines with storage duration and number of stored items. We show that human performance, though inconsistent with models involving direct (uncoded) storage in persistent activity networks, can be well-fit by the theoretical bound. This finding is consistent with the view that if the brain stores information in patterns of persistent activity, it might use codes that minimize the effects of noise, motivating the search for such codes in the brain.


  • Open Access

    Individual Secrecy for Broadcast Channels With Receiver Side Information

    by Yanling Chen, O. Ozan Koyluoglu, Aydin Sezgin

    This paper studies the problem of secure communication over the broadcast channel with receiver-side information under the lens of individual secrecy constraints, that is, the transmitter wants to send two independent messages to two receivers, which have, respectively, the desired message of the other receiver as side information, while keeping the eavesdropper ignorant of each message (i.e., the information leakage rate from each message to the eavesdropper is made vanishing). Building upon one-time pad, secrecy coding, and broadcasting schemes, achievable rate regions are investigated, and the capacity region for special cases of either a weak or strong eavesdropper (compared to both legitimate receivers) is characterized. Interestingly, the capacity region for the former corresponds to a line and the latter corresponds to a rectangle with missing corners; a phenomenon occurring due to the coupling between user's rates. Moreover, the individual secrecy capacity region is also fully characterized for the case where the eavesdropper's channel is deterministic. In addition to discrete memoryless setup, Gaussian scenarios are studied. For the Gaussian model, in addition to the strong and weak eavesdropper cases, the capacity region is characterized for the low and high SNR regimes when the eavesdropper's channel is stronger than one receiver but weaker than the other. Remarkably, positive secure transmission rates are always guaranteed under the individual secrecy constraint, unlike the case of the joint secrecy constraint (i.e., the information leakage rate from both messages to the eavesdropper is made vanishing). Thus, this notion of secrecy serves as an appropriate candidate for trading off secrecy level and transmission rate, making secrecy more affordable but still acceptable to the end user.