2018 Twenty Fourth National Conference on Communications (NCC)最新文献_第10页

Region Selective Information Augmentation for Retinal Images 视网膜图像的区域选择性信息增强

2018 Twenty Fourth National Conference on Communications (NCC) Pub Date : 2018-02-01 DOI: 10.1109/NCC.2018.8600258

Vineeta Das, S. Dandapat, P. Bora

引用次数: 0

Minimizing Energy Theft by Statistical Distance based Theft Detector in AMI AMI中基于统计距离的盗窃检测器最小化能源盗窃

2018 Twenty Fourth National Conference on Communications (NCC) Pub Date : 2018-02-01 DOI: 10.1109/NCC.2018.8600016

S. Singh, R. Bose, A. Joshi

引用次数: 7

State-Space Digital Filters with Minimum Weighted Round-off Noise and Pole Sensitivity Subject to $pmb{l}_{2}$ -Scaling Constraints 基于$pmb{l}_{2}$ -尺度约束的最小加权舍入噪声和极点灵敏度的状态空间数字滤波器

2018 Twenty Fourth National Conference on Communications (NCC) Pub Date : 2018-02-01 DOI: 10.1109/NCC.2018.8600044

Y. Hinamoto, A. Doi

引用次数: 0

Design of Enhanced Gain Two Element Linear Microstrip Antenna Array 增强增益双元线性微带天线阵列的设计

2018 Twenty Fourth National Conference on Communications (NCC) Pub Date : 2018-02-01 DOI: 10.1109/NCC.2018.8599982

P. K, P. V. Hunugund, Vani R.M

引用次数: 1

Power System Frequency and Amplitude Estimation Using Variational Mode Decomposition and Chebfun Approximation System 基于变分模态分解和Chebfun近似系统的电力系统频率和幅值估计

2018 Twenty Fourth National Conference on Communications (NCC) Pub Date : 2018-02-01 DOI: 10.1109/NCC.2018.8600233

N. Mohan, Soman K.P.

引用次数: 12

Communication and State Estimation over a State-Dependent Gaussian Multiple-Access Channel 状态相关高斯多址信道的通信与状态估计

2018 Twenty Fourth National Conference on Communications (NCC) Pub Date : 2018-02-01 DOI: 10.1109/NCC.2018.8600241

Viswanathan Ramachandrar, S. R. B. Pillai, V. Prabhakaran

引用次数: 2

A Rate-Optimal Construction of Codes with Sequential Recovery with Low Block Length 低块长顺序恢复码的速率最优构造

2018 Twenty Fourth National Conference on Communications (NCC) Pub Date : 2018-01-21 DOI: 10.1109/NCC.2018.8600259

Balaji Srinivasan Babu, Ganesh Ramachandra Kini, P. V. Kumar

引用次数: 5

On Maximally Recoverable Codes for Product Topologies 关于产品拓扑的最大可恢复代码

2018 Twenty Fourth National Conference on Communications (NCC) Pub Date : 2018-01-10 DOI: 10.1109/NCC.2018.8599965

D. Shivakrishna, V. Rameshwar, V. Lalitha, B. Sasidharan

{"title":"On Maximally Recoverable Codes for Product Topologies","authors":"D. Shivakrishna, V. Rameshwar, V. Lalitha, B. Sasidharan","doi":"10.1109/NCC.2018.8599965","DOIUrl":"https://doi.org/10.1109/NCC.2018.8599965","url":null,"abstract":"Given a topology of local parity-check constraints, a maximally recoverable code (MRC) can correct all erasure patterns that are information-theoretically correctable. In a grid-like topology, there are $a$ local constraints in every column forming a column code, $b$ local constraints in every row forming a row code, and $h$ global constraints in an (m × n) grid of codeword. Recently, Gopalan et al. initiated the study of MRCs under grid-like topology, and derived a necessary and sufficient condition, termed as the regularity condition, for an erasure pattern to be recoverable when $a = 1, h = 0$. In this paper, we consider MRCs for product topology ($h = 0$). First, we construct a certain bipartite graph based on the erasure pattern satisfying the regularity condition for product topology (any $a, b, h = 0$) and show that there exists a complete matching in this graph. We then present an alternate direct proof of the sufficient condition when $a = 1, h = 0$. We later extend our technique to study the topology for $a = 2, h = 0$, and characterize a subset of recoverable erasure patterns in that case. For both $a = 1, 2$, our method of proof is uniform, i.e., by constructing tensor product Gcol ⊗ Growof generator matrices of column and row codes such that certain square sub-matrices retain full rank. The full-rank condition is proved by resorting to the matching identified earlier and also another set of matchings in erasure sub-patterns.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123506047","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Optimal Index Codes via a Duality between Index Coding and Network Coding 基于索引编码与网络编码对偶性的最优索引编码

2018 Twenty Fourth National Conference on Communications (NCC) Pub Date : 2017-11-17 DOI: 10.1109/NCC.2018.8599997

Ashok Choudhary, Vamsi Krishna Gummadi, Prasad Krishnan

{"title":"Optimal Index Codes via a Duality between Index Coding and Network Coding","authors":"Ashok Choudhary, Vamsi Krishna Gummadi, Prasad Krishnan","doi":"10.1109/NCC.2018.8599997","DOIUrl":"https://doi.org/10.1109/NCC.2018.8599997","url":null,"abstract":"In Index Coding, the goal is to use a broadcast channel as efficiently as possible to communicate information from a source to multiple receivers which can possess some of the information symbols at the source as side-information. In this work, we present a duality relationship between index coding (IC) and multiple-unicast network coding (NC). It is known that the IC problem can be represented using a side-information graph $G$ (with number of vertices $n$ equal to the number of source symbols). The size of the maximum acyclic induced subgraph, denoted by MAI S is a lower bound on the broadcast rate. For IC problems with MAIS = n - 1 and MAI S = n - 2, prior work has shown that binary (over F 2) linear index codes achieve the MAI S lower bound for the broadcast rate and thus are optimal. In this work, we use the the duality relationship between NC and IC to show that for a class of IC problems with MAIS = n - 3, binary linear index codes achieve the MAI S lower bound on the broadcast rate. In contrast, it is known that there exists IC problems with MAIS = n - 3 and optimal broadcast rate strictly greater than MAIS.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129259058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Energy-Delay-Distortion Problem Energy-Delay-Distortion问题

2018 Twenty Fourth National Conference on Communications (NCC) Pub Date : 2017-11-14 DOI: 10.1109/NCC.2018.8600172

R. Vaze, Shreyas Chaudhari, Akshat Choube, Nitin Aggarwal

{"title":"Energy-Delay-Distortion Problem","authors":"R. Vaze, Shreyas Chaudhari, Akshat Choube, Nitin Aggarwal","doi":"10.1109/NCC.2018.8600172","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600172","url":null,"abstract":"An energy-limited source trying to transmit multiple packets to a destination with possibly different sizes is considered. With limited energy, the source cannot potentially transmit all bits of all packets. In addition, there is a delay cost associated with each packet. Thus, the source has to choose, how many bits to transmit for each packet, and the order in which to transmit these bits, to minimize the cost of distortion (introduced by transmitting lower number of bits) and queueing plus transmission delay, across all packets. Assuming an exponential metric for distortion loss and linear delay cost, we show that the optimal order of transmission is the increasing order of packet sizes and optimization problem is jointly convex. Hence, the problem can be exactly solved using convex solvers, however, because of the complicated expression derived from the KKT conditions, no closed form solution can be found even with the simplest cost function choice made in the paper. To facilitate a more structured solution, a discretized version of the problem is also considered, where time and energy are divided in discrete amounts. In any time slot (fixed length), bits belonging to any one packet can be transmitted, while any discrete number of energy quanta can be used in any slot corresponding to any one packet, such that the total energy constraint is satisfied. The discretized problem is a special case of a multi-partitioning problem, where each packet's utility is super-modular and the proposed greedy solution is shown to incur cost that is at most 2-times of the optimal cost.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130230745","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1