发布求助
文献互助 智能选刊 最新文献

2019 National Conference on Communications (NCC)最新文献

筛选
英文 中文
MIMO-FBMC Channel Estimation with Limited, and Imperfect Knowledge of Channel Correlations 基于有限和不完全信道相关知识的MIMO-FBMC信道估计
2019 National Conference on Communications (NCC) Pub Date : 2019-02-01 DOI: 10.1109/NCC.2019.8732183
Prem Singh, K. Vasudevan
{"title":"MIMO-FBMC Channel Estimation with Limited, and Imperfect Knowledge of Channel Correlations","authors":"Prem Singh, K. Vasudevan","doi":"10.1109/NCC.2019.8732183","DOIUrl":"https://doi.org/10.1109/NCC.2019.8732183","url":null,"abstract":"This paper presents and analyses the performance of training-based least squares (LS) and minimum mean square error (MMSE) channel estimation schemes for multiple input multiple output (MIMO) filter bank multicarrier (FBMC) systems based on the offset quadrature amplitude modulation (OQAM) in the presence of limited, and imperfect knowledge of the channel correlations. First, a linear MMSE (LMMSE) technique for MIMO-FBMC channel estimation, which require a priori knowledge of channel correlation matrix, is examined by utilizing the second-order statistical properties of the intrinsic interference in FBMC systems. A biased LS (BLS) and relaxed LMMSE (RLMMSE) MIMO-FBMC channel estimation schemes, which require prior knowledge of the trace of the channel correlation matrix, are proposed. The LS-BLS and LS-RLMMSE schemes for MIMO-FBMC channel estimation are investigated in the presence of imperfect knowledge of the channel correlations. The mean square error is derived for the proposed schemes by exploiting statistical properties of the intrinsic interference. Simulation results show that the proposed schemes present an excellent trade-off between the achieved performance and required a priori knowledge of the channel correlations.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"40 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77993960","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
Full Reference Stereoscopic Video Quality Assessment Based On Spatio-Depth Saliency And Motion Strength 基于空间深度显著性和运动强度的全参考立体视频质量评估
2019 National Conference on Communications (NCC) Pub Date : 2019-02-01 DOI: 10.1109/NCC.2019.8732261
Sameeulla Khan, Sumohana S. Channappayya
{"title":"Full Reference Stereoscopic Video Quality Assessment Based On Spatio-Depth Saliency And Motion Strength","authors":"Sameeulla Khan, Sumohana S. Channappayya","doi":"10.1109/NCC.2019.8732261","DOIUrl":"https://doi.org/10.1109/NCC.2019.8732261","url":null,"abstract":"Stereoscopic video quality is a perceptual phenomena that is related to the human visual system (HVS). In this paper, we present a spatio-depth saliency and motion strength based full reference stereoscopic video quality metric (FRSVQA). Initially, we obtain a spatial distortion map on every video frame to estimate spatial quality. The spatial distortion map is then refined by the depth salient maps to estimate depth quality. We also estimate the temporal quality by refining the spatial distortion map with the inter-frame difference map at the locations specified by motion edges. The spatial, depth and temporal qualities are systematically combined and averaged over the frames to estimate the overall stereo video quality metric.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"25 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84514351","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}
引用次数: 3
High Performance Multiplierless Serial Pipelined VLSI Architecture for Real-Valued FFT 用于实值FFT的高性能无乘法器串行流水线VLSI架构
2019 National Conference on Communications (NCC) Pub Date : 2019-02-01 DOI: 10.1109/NCC.2019.8732236
Jinti Hazarika, Mohd. Tasleem Khan, S. Ahamed, H. Nemade
{"title":"High Performance Multiplierless Serial Pipelined VLSI Architecture for Real-Valued FFT","authors":"Jinti Hazarika, Mohd. Tasleem Khan, S. Ahamed, H. Nemade","doi":"10.1109/NCC.2019.8732236","DOIUrl":"https://doi.org/10.1109/NCC.2019.8732236","url":null,"abstract":"This paper presents a high-performance multiplierless serial pipelined architecture for real-valued fast Fourier transform (FFT). A new data mapping scheme (DMS) is suggested for the proposed serial pipelined FFT architecture. The performance is enhanced by performing FFT computations in $log_{2}N-1$ stages followed by a select-store-feedback (SSF) stage, where $N$ is the number of points in FFT. Further enhancement in performance is achieved by employing quarter-complex multiplierless unit made up of memory and combinational logic in every stage. The memory stores half number of partial products while the remaining partial products are taken care by external combinational logic. Compared with the best existing scheme, the proposed design reduces the computational workload on half-butterfly (H-BF) units by $(2N-8)$. Application specific integrated circuit (ASIC) and field programmable gate array (FPGA) results show that the proposed design for 1024-point achieves 31.54% less area, 30.13% less power, 33.56% less area-delay product (ADP), 27.11% less sliced look-up tables (SLUTs) and 28.37% less flip-flops (FFs) as compared to the best existing scheme.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"6 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85421894","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}
引用次数: 2
A Circular Fractal Antenna Array 圆形分形天线阵列
2019 National Conference on Communications (NCC) Pub Date : 2019-02-01 DOI: 10.1109/NCC.2019.8732218
R. Chauhan, Sanjeev Gupta
{"title":"A Circular Fractal Antenna Array","authors":"R. Chauhan, Sanjeev Gupta","doi":"10.1109/NCC.2019.8732218","DOIUrl":"https://doi.org/10.1109/NCC.2019.8732218","url":null,"abstract":"In this paper, different arrays of the circular fractal antenna are analyzed. The various array design configurations are 1 $times 2,1times 4,2times 2$ and $2times 4$. The substrate used is FR4 whose dimension is varied according to the array configurations. A $pmb{50}Omega$ microstrip feed line is used to excite the antenna for all the configurations. The antenna shows stable radiation pattern and have good $S_{11}$ characteristics. All the analysis is done in HFSS 2014.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"77 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74446051","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}
引用次数: 5
Proximity Fed Broadband Equilateral Triangular Microstrip Antenna Using Parasitic Rectangular Patches 基于矩形寄生贴片的近距离馈电宽带等边三角形微带天线
2019 National Conference on Communications (NCC) Pub Date : 2019-02-01 DOI: 10.1109/NCC.2019.8732200
S. Deshmukh, Akshay Doshi, A. Deshmukh
{"title":"Proximity Fed Broadband Equilateral Triangular Microstrip Antenna Using Parasitic Rectangular Patches","authors":"S. Deshmukh, Akshay Doshi, A. Deshmukh","doi":"10.1109/NCC.2019.8732200","DOIUrl":"https://doi.org/10.1109/NCC.2019.8732200","url":null,"abstract":"Gap coupled design of proximity fed equilateral triangular microstrip antenna along with variations of rectangular microstrip antennas are proposed. Design of equilateral triangular microstrip antenna provides a bandwidth of 302 MHz (25%) with broadside gain of 7.6 dBi. Enhancement in bandwidth and gain is realized by gap coupling rectangular patches. Optimum result with VSWR bandwidth of more than 670 MHz (57%), showing peak gain of 9.7 dBi is obtained in gap coupled configuration with two adjacent layers of two and four rectangular patches. Proposed design is simpler in implementation and measured results show close agreement.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"338 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75934127","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
Slot Cut Modified Triangular Shape Microstrip Antenna for Circular Polarization 圆极化槽切改进三角形微带天线
2019 National Conference on Communications (NCC) Pub Date : 2019-02-01 DOI: 10.1109/NCC.2019.8732180
Akshay Doshi, A. Deshmukh, S. Deshmukh, K. P. Ray
{"title":"Slot Cut Modified Triangular Shape Microstrip Antenna for Circular Polarization","authors":"Akshay Doshi, A. Deshmukh, S. Deshmukh, K. P. Ray","doi":"10.1109/NCC.2019.8732180","DOIUrl":"https://doi.org/10.1109/NCC.2019.8732180","url":null,"abstract":"Modified design of triangular microstrip antenna obtained by combining two triangular shape patches is discussed. The offset distance between two patches tunes the spacing between orthogonal mode frequencies of the patch which yields circular polarized response with axial ratio bandwidth of 5%. Further to realize compact configuration, slot cut design of offset triangular overlap patches is studied. The rectangular slot helps in tuning the spacing between offset triangular patches along with offset distance to yield circular polarization. The detailed parametric study for the effects of slot along with offset distance in circular polarized antenna is presented. The tuning of orthogonal frequencies is obtained at lower offset distance between two patches for slot cut antenna. The optimum axial ratio bandwidth of 70 MHz in 1500 MHz frequency band is obtained along with broadside gain of 7 dBi and VSWR Bandwidth of 747 MHz. In optimum case slot cut overlapped design offers 42% reduction in patch area.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"40 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79091748","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}
引用次数: 2
Saliency Guided Image Detail Enhancement 显著性引导图像细节增强
2019 National Conference on Communications (NCC) Pub Date : 2019-02-01 DOI: 10.1109/NCC.2019.8732250
Sanjay Ghosh, Ruturaj G. Gavaskar, K. Chaudhury
{"title":"Saliency Guided Image Detail Enhancement","authors":"Sanjay Ghosh, Ruturaj G. Gavaskar, K. Chaudhury","doi":"10.1109/NCC.2019.8732250","DOIUrl":"https://doi.org/10.1109/NCC.2019.8732250","url":null,"abstract":"The use of visual saliency for perceptual enhancement of images has drawn significant attention. In this paper, we explore the idea of selectively enhancing salient regions of an image. Moreover, we develop an algorithm based on adaptive bilateral filtering for this purpose. In most of the filtering based methods, detail enhancement is performed by decomposing the image into base and detail layers; the detail layer is amplified and added back to the base layer to obtain the enhanced image. The decomposition is performed using edge-preserving smoothing such as bilateral filtering. The present novelty is that we use the saliency map to locally guide the smoothing (and the enhancement) action of the bilateral filter. The effectiveness of our proposal is demonstrated using visual results. In particular, our method does not suffer from gradient reversals and halo artifacts, and does not amplify fine details in non-salient regions that often appear as noise grains in the enhanced image. Moreover, if we choose to perform the filtering channelwise, then our method can be efficiently implemented using an existing fast algorithm.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"27 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84369352","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}
引用次数: 17
A Minimax Theorem for Finite Blocklength Joint Source-Channel Coding over an AVC AVC上有限块长度联合信信道编码的极大极小定理
2019 National Conference on Communications (NCC) Pub Date : 2019-02-01 DOI: 10.1109/NCC.2019.8732205
Anuj S. Vora, Ankur A. Kulkarni
{"title":"A Minimax Theorem for Finite Blocklength Joint Source-Channel Coding over an AVC","authors":"Anuj S. Vora, Ankur A. Kulkarni","doi":"10.1109/NCC.2019.8732205","DOIUrl":"https://doi.org/10.1109/NCC.2019.8732205","url":null,"abstract":"We pose the finite blocklength communication problem in the presence of a jammer as a zero-sum game between the encoder-decoder team and the jammer, where the communicators, as well as the jammer, are allowed locally randomized strategies. The minimax value of the game corresponds to joint sourcechannel coding over an Arbitrarily Varying Channel (AVC), which in the channel coding setting is known to admit a strong converse. The communicating team's problem is non-convex and hence, in general, a minimax theorem need not hold for this game. However, we show that an approximate minimax theorem holds in the sense that the minimax and maximin values of the game approach each other asymptotically. In particular, for rates above a critical threshold, both the minimax and maximin values approach unity. This result is stronger than the usual strong converse for channel coding over an AVC, which only says that the minimax value approaches unity for such rates.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"1 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89703290","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
Design of Frequency-Signature Based Multiresonators Using Quarter Wavelength Open Ended Stub for Chipless RFID Tag 基于四分之一波长开放式存根的无芯片RFID标签频率特征多谐振器设计
2019 National Conference on Communications (NCC) Pub Date : 2019-02-01 DOI: 10.1109/NCC.2019.8732229
P. Prabavathi, S. S. Rani
{"title":"Design of Frequency-Signature Based Multiresonators Using Quarter Wavelength Open Ended Stub for Chipless RFID Tag","authors":"P. Prabavathi, S. S. Rani","doi":"10.1109/NCC.2019.8732229","DOIUrl":"https://doi.org/10.1109/NCC.2019.8732229","url":null,"abstract":"A quarter wavelength open stub multiresonators are proposed for chipless Radio Frequency Identification (RFID) tag. The data capacity of the tag is 10 bit and open stub resonator operates in the frequency band of 2 GHz to 4 GHz. The data in the tag is encoded using absence or presence coding and frequency shift coding (FSC). The data stored is read and transmitted using the planar circular patch monopole ultra-wide band (UWB) antenna. The tag consists of two cross polarized sending and receiving planar circular patch (PCP) monopole UWB antennas connected to the multiresonators. The span of the multiresonator based chipless RFID tag is 23.8mmx17mm which is designed on FR4 substrate with dielectric permittivity of 4.4 and tangent loss of 0.01. It is designed and tested under simulation using ADS software and the vector network analyzer (VNA) after fabrication. The tag has the insertion loss in the range of -10 dB to -30 dB and a bit density of 2.47bits/cm2.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"63 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89283980","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}
引用次数: 8
Splitting Merged Characters of Kannada Benchmark Dataset using Simplified Paired-Valleys and L-Cut 基于简化成对谷和l -切的卡纳达语基准数据集合并字符分割
2019 National Conference on Communications (NCC) Pub Date : 2019-02-01 DOI: 10.1109/NCC.2019.8732239
H. Kumar, A. Madhavaraj, A. Ramakrishnan
{"title":"Splitting Merged Characters of Kannada Benchmark Dataset using Simplified Paired-Valleys and L-Cut","authors":"H. Kumar, A. Madhavaraj, A. Ramakrishnan","doi":"10.1109/NCC.2019.8732239","DOIUrl":"https://doi.org/10.1109/NCC.2019.8732239","url":null,"abstract":"We reduce the computational complexity of the paired-valley algorithm for splitting merged characters, from Θ(N2) down to Θ(N), where $N$ is the number of symbols merged. We also propose an effective way (L-cut algorithm) to separate the merged half-consonants (known in Kannada as ottus) from the base symbols. We have created a benchmark dataset of 4033 sub-word images in Kannada, each comprising two or more merged characters. We test the recognition accuracy of Tesseract OCR on the created benchmark dataset, before and after applying our technique. The accuracy of Tesseract v3 OCR on the created dataset of 61.6% increases by 20% to a value of 81.7% after the splitting of the characters by our method. The algorithm's scalability to other scripts has been explored by limited experiments on Telugu and Tamil.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"29 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85012273","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}
引用次数: 4
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信