2010 National Conference On Communications (NCC)最新文献_第6页

Krylov algorithms for FEXT cancellation in upstream MIMO VDSL 上游MIMO VDSL中文本对消的Krylov算法

2010 National Conference On Communications (NCC) Pub Date : 2010-03-15 DOI: 10.1109/NCC.2010.5430228

S. M. Zafaruddin, P. Agrawal, S. Prakriya, S. Prasad

引用次数: 1

Mobile payment architectures for India 印度的移动支付架构

2010 National Conference On Communications (NCC) Pub Date : 2010-03-15 DOI: 10.1109/NCC.2010.5430160

Deepti Kumar, T. Gonsalves, A. Jhunjhunwala, Gaurav Raina

{"title":"Mobile payment architectures for India","authors":"Deepti Kumar, T. Gonsalves, A. Jhunjhunwala, Gaurav Raina","doi":"10.1109/NCC.2010.5430160","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430160","url":null,"abstract":"Mobile payments are a new and alternative payment method. Instead of using traditional methods like cash, cheque, or credit cards, a customer can use a mobile phone to transfer money or to pay for goods and services. Mobile payments have numerous advantages over traditional payment methods. Apart from their apparent flexibility, they enable consumers who do not have easy access to banking facilities to participate readily in financial transactions. Unfortunately, existing mobile payment solutions in India are not interoperable; i.e. they only offer services for merchants registered with them and do not allow the transfer of money to, or between, users of other payment providers. This limitation reduces the widespread adoption of mobile payments. In this paper, we propose new mobile payment architectures that support interoperability. A key technical aspect of the mobile payment process is to lookup customer details, for which we propose the following three design options: (1) a central database, (2) a peer-to-peer query, or (3) a hierarchical lookup. These options are evaluated using relevant metrics such as the complexity of implementation and scalability with respect to system size. Based on our evaluation we recommend that initially the peer-to-peer design is chosen, and once the technology is more widespread, the central database option should be adopted.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123607240","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}

引用次数: 19

Trajectory and surface modeling of LSF for low rate speech coding 低速率语音编码LSF的轨迹和曲面建模

2010 National Conference On Communications (NCC) Pub Date : 2010-03-15 DOI: 10.1109/NCC.2010.5430192

M. Deepak, P. Rao

引用次数: 1

Proactive resource reservation in next-generation wireless networks 下一代无线网络中的主动资源预留

2010 National Conference On Communications (NCC) Pub Date : 2010-03-15 DOI: 10.1109/NCC.2010.5430157

A. Ukil, Jaydip Sen

{"title":"Proactive resource reservation in next-generation wireless networks","authors":"A. Ukil, Jaydip Sen","doi":"10.1109/NCC.2010.5430157","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430157","url":null,"abstract":"Resource reservation is a key management function in future wireless networks, particularly to provide high-end multimedia applications to mobile users with quality of service (QoS) guarantees and to optimize the overall system resource utilization. In prediction based resource reservation, the radio resource is reserved from an a priori estimation of the future traffic load. In this paper, we have presented a scheme for proactive resource reservation in next generation wireless networks. In this scheme, the future traffic estimation is based on Normalized Least Mean Square (NLMS) adaptive filtering method. Based on the estimated characteristic of future traffic load, network congestion notification and network utility factor are evaluated. We have applied tele-traffic theory based on these two parameters to optimize the resource reservation scheme. The novelty of the scheme is the integration of adaptive filtering and tele-traffic theory in a coupled manner in order to find an optimum solution for resource reservation in next generation wireless networks like WiMAX. To show the effectiveness of our proposed scheme and the efficacy of the different parameters for optimizing the overall resource reservation process, we have presented computer simulation results, which include traffic estimation and predictive resource reservation.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129144322","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

Generalised pseudocirculants: Dual-rate systems, cyclostationary signals 广义伪循环:双速率系统，周期平稳信号

2010 National Conference On Communications (NCC) Pub Date : 2010-03-15 DOI: 10.1109/NCC.2010.5430196

R. Dhuli, Brejesh Lall

引用次数: 0

On optimal timer-based distributed selection for rate-adaptive multi-user diversity systems 速率自适应多用户分集系统中基于最优定时器的分布式选择

2010 National Conference On Communications (NCC) Pub Date : 2010-03-15 DOI: 10.1109/NCC.2010.5430221

A. Suresh, N. Mehta, Virag Shah

{"title":"On optimal timer-based distributed selection for rate-adaptive multi-user diversity systems","authors":"A. Suresh, N. Mehta, Virag Shah","doi":"10.1109/NCC.2010.5430221","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430221","url":null,"abstract":"We develop an optimal, distributed, and low feedback timer-based selection scheme to enable next generation rate-adaptive wireless systems to exploit multi-user diversity. In our scheme, each user sets a timer depending on its signal to noise ratio (SNR) and transmits a small packet to identify itself when its timer expires. When the SNR-to-timer mapping is monotone non-decreasing, timers of users with better SNRs expire earlier. Thus, the base station (BS) simply selects the first user whose timer expiry it can detect, and transmits data to it at as high a rate as reliably possible. However, timers that expire too close to one another cannot be detected by the BS due to collisions. We characterize in detail the structure of the SNR-to-timer mapping that optimally handles these collisions to maximize the average data rate. We prove that the optimal timer values take only a discrete set of values, and that the rate adaptation policy strongly influences the optimal scheme's structure. The optimal average rate is very close to that of ideal selection in which the BS always selects highest rate user, and is much higher than that of the popular, but ad hoc, timer schemes considered in the literature.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133846528","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

Mean square robustness of linear game theoretic estimators 线性博弈论估计的均方鲁棒性

2010 National Conference On Communications (NCC) Pub Date : 2010-03-15 DOI: 10.1109/NCC.2010.5430185

R. Lakshminarayanan, K. Giridhar

引用次数: 0

Vocal emotion recognition in five languages of Assam using features based on MFCCs and Eigen Values of Autocorrelation Matrix in presence of babble noise 基于mfccc和自相关矩阵特征值的阿萨姆邦五种语言语音情感识别

2010 National Conference On Communications (NCC) Pub Date : 2010-03-15 DOI: 10.1109/NCC.2010.5430205

A. B. Kandali, A. Routray, T. Basu

{"title":"Vocal emotion recognition in five languages of Assam using features based on MFCCs and Eigen Values of Autocorrelation Matrix in presence of babble noise","authors":"A. B. Kandali, A. Routray, T. Basu","doi":"10.1109/NCC.2010.5430205","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430205","url":null,"abstract":"This work investigates whether vocal emotion expressions of (i) discrete emotion be distinguished from ‘no-emotion’ (i.e. neutral), (ii) one discrete emotion be distinguished from another, (iii) surprise, which is actually a cognitive component that could be present with any emotion, be also recognized as distinct emotion, (iv) discrete emotion be recognized cross-lingually. This study will enable us to get more information regarding nature and function of emotion. Furthermore, this work will help in developing a generalized vocal emotion recognition system, which will increase the efficiency of human-machine interaction systems. In this work, an emotional speech database consisting of short sentences of six full-blown basic emotions and neutral is created with 140 simulated utterances per speaker of five native languages of Assam. This database is validated by a Listening Test. A new feature set is proposed based on Eigen Values of Autocorrelation Matrix (EVAM) of each frame of the speech signal. The Gaussian Mixture Model (GMM) is used as classifier. The performance of the proposed feature set is compared with Mel Frequency Cepstral Coefficients (MFCCs) at sampling frequency of 8.1 kHz and with additive babble noise of 5 db and 0 db Signal-to-Noise Ratios (SNRs) under matched noise training and testing condition.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124242285","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}

引用次数: 7

Explicit codes uniformly reducing repair bandwidth in distributed storage 显式代码统一减少分布式存储中的修复带宽

2010 National Conference On Communications (NCC) Pub Date : 2010-03-15 DOI: 10.1109/NCC.2010.5430243

Nihar B. Shah, K. V. Rashmi, P. V. Kumar, K. Ramchandran

引用次数: 5

Fast approach to speaker identification for large population using MLLR and sufficient statistics 基于MLLR和充分统计量的大群体说话人识别方法

2010 National Conference On Communications (NCC) Pub Date : 2010-03-15 DOI: 10.1109/NCC.2010.5430206

A. K. Sarkar, S. Rath, S. Umesh

引用次数: 7