Pub Date : 2011-03-17DOI: 10.1109/NCC.2011.5734769
G. V. V. Sharma
In this paper, we provide exact expressions for the bit error rate (BER) for single relay maximal ratio combining (MRC) based decode and forward (DF) cooperative systems in Nakagami-m fading. This is done by expressing the decision variable as a sum of gamma conditionally Gaussian (CG) random variables. The characteristic function (CF) of gamma CG variables is then derived and used to obtain the BER expressions using the Gil-Pelaez inversion formula. A tight closed form approximation for the BER is also derived and used to obtain the diversity order. Numerical results, including simulations, are provided to verify the validity of the derived analytical expressions.
{"title":"Exact error analysis for decode and forward cooperation with maximal ratio combining","authors":"G. V. V. Sharma","doi":"10.1109/NCC.2011.5734769","DOIUrl":"https://doi.org/10.1109/NCC.2011.5734769","url":null,"abstract":"In this paper, we provide exact expressions for the bit error rate (BER) for single relay maximal ratio combining (MRC) based decode and forward (DF) cooperative systems in Nakagami-m fading. This is done by expressing the decision variable as a sum of gamma conditionally Gaussian (CG) random variables. The characteristic function (CF) of gamma CG variables is then derived and used to obtain the BER expressions using the Gil-Pelaez inversion formula. A tight closed form approximation for the BER is also derived and used to obtain the diversity order. Numerical results, including simulations, are provided to verify the validity of the derived analytical expressions.","PeriodicalId":158295,"journal":{"name":"2011 National Conference on Communications (NCC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124002975","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}
Pub Date : 2011-03-17DOI: 10.1109/NCC.2011.5734762
B. Deka, P. Bora
This paper proposes a novel two-stage denoising method for removing random-valued impulse noise from an image. First, an impulse noise detection scheme is used to detect the pixels which are likely to be corrupted by the impulse noise (called the noise candidates). Then the noise candidates are reconstructed by using the image inpainting method based on sparse representation in an iterative manner until convergence. The proposed method leads to a simple and very effective denoising algorithm for the random-valued impulse noise removal. It is experimentally shown that the proposed algorithm outperforms the state-of-the-art denoising techniques for the removal of impulse noise both visually and quantitatively.
{"title":"Removal of random-valued impulse noise using sparse representation","authors":"B. Deka, P. Bora","doi":"10.1109/NCC.2011.5734762","DOIUrl":"https://doi.org/10.1109/NCC.2011.5734762","url":null,"abstract":"This paper proposes a novel two-stage denoising method for removing random-valued impulse noise from an image. First, an impulse noise detection scheme is used to detect the pixels which are likely to be corrupted by the impulse noise (called the noise candidates). Then the noise candidates are reconstructed by using the image inpainting method based on sparse representation in an iterative manner until convergence. The proposed method leads to a simple and very effective denoising algorithm for the random-valued impulse noise removal. It is experimentally shown that the proposed algorithm outperforms the state-of-the-art denoising techniques for the removal of impulse noise both visually and quantitatively.","PeriodicalId":158295,"journal":{"name":"2011 National Conference on Communications (NCC)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123075031","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}
Pub Date : 2011-03-17DOI: 10.1109/NCC.2011.5734756
B. Durai, T. Gonsalves, K. Sivalingam
In telecommunication network management systems, pull and push are the conventional methods for data collection. The manager (also called client) entity manages a large number of network elements (NE, also called server) that send monitoring data to the manager. The pull approach does not depend on data changes and is not efficient. The push approach serves the data strictly based on the data changes and is hence more efficient. However, the push approach does not consider the manager's capabilities; hence, the efforts spent on serving the data will be wasted when the manager is unable or unwilling to process the data. Ideally, data collection should be done based on the manager's capabilities, load and other service level criteria. In this paper, we present an adaptive push technique that combines the best of push's advantages while providing the manager with control over demand in data. This approach is compared with pull and push techniques in terms of metrics such as benefit, cost and optimum.
{"title":"Adaptive push based data collection method for online performance monitoring","authors":"B. Durai, T. Gonsalves, K. Sivalingam","doi":"10.1109/NCC.2011.5734756","DOIUrl":"https://doi.org/10.1109/NCC.2011.5734756","url":null,"abstract":"In telecommunication network management systems, pull and push are the conventional methods for data collection. The manager (also called client) entity manages a large number of network elements (NE, also called server) that send monitoring data to the manager. The pull approach does not depend on data changes and is not efficient. The push approach serves the data strictly based on the data changes and is hence more efficient. However, the push approach does not consider the manager's capabilities; hence, the efforts spent on serving the data will be wasted when the manager is unable or unwilling to process the data. Ideally, data collection should be done based on the manager's capabilities, load and other service level criteria. In this paper, we present an adaptive push technique that combines the best of push's advantages while providing the manager with control over demand in data. This approach is compared with pull and push techniques in terms of metrics such as benefit, cost and optimum.","PeriodicalId":158295,"journal":{"name":"2011 National Conference on Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129662386","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}
Pub Date : 2011-03-17DOI: 10.1109/NCC.2011.5734783
B. Deka, P. Bora
Finding sparse solutions to under-determined systems of linear equations has recently got a plethora of applications in the field of signal processing. It is assumed that an ideal noiseless signal has sufficiently sparse representation. But in practice a noisy version of such signal can only be observed. In this paper, we propose a new initialization scheme and a stopping condition for the recently introduced Bayesian Pursuit Algorithm (BPA) for sparse representation in the noisy settings. Experimental results show that the proposed modifications lead to a better quality of sparse solution and faster rate of convergence over the existing BPA especially at low noise levels.
{"title":"Enhancing the performance of the Bayesian Pursuit Algorithm","authors":"B. Deka, P. Bora","doi":"10.1109/NCC.2011.5734783","DOIUrl":"https://doi.org/10.1109/NCC.2011.5734783","url":null,"abstract":"Finding sparse solutions to under-determined systems of linear equations has recently got a plethora of applications in the field of signal processing. It is assumed that an ideal noiseless signal has sufficiently sparse representation. But in practice a noisy version of such signal can only be observed. In this paper, we propose a new initialization scheme and a stopping condition for the recently introduced Bayesian Pursuit Algorithm (BPA) for sparse representation in the noisy settings. Experimental results show that the proposed modifications lead to a better quality of sparse solution and faster rate of convergence over the existing BPA especially at low noise levels.","PeriodicalId":158295,"journal":{"name":"2011 National Conference on Communications (NCC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125604254","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}
Pub Date : 2011-03-17DOI: 10.1109/NCC.2011.5734718
J. Satyanarayana, A. G. Ramakrishnan
Signal acquisition under a compressed sensing scheme offers the possibility of acquisition and reconstruction of signals sparse on some basis incoherent with measurement kernel with sub-Nyquist number of measurements. In particular when the sole objective of the acquisition is the detection of the frequency of a signal rather than exact reconstruction, then an undersampling framework like CS is able to perform the task. In this paper we explore the possibility of acquisition and detection of frequency of multiple analog signals, heavily corrupted with additive white Gaussian noise. We improvise upon the MOSAICS architecture proposed by us in our previous work to include a wider class of signals having non-integral frequency components. This makes it possible to perform multiplexed compressed sensing for general frequency sparse signals.
{"title":"Frequency detection from multiplexed compressed sensing of noisy signals","authors":"J. Satyanarayana, A. G. Ramakrishnan","doi":"10.1109/NCC.2011.5734718","DOIUrl":"https://doi.org/10.1109/NCC.2011.5734718","url":null,"abstract":"Signal acquisition under a compressed sensing scheme offers the possibility of acquisition and reconstruction of signals sparse on some basis incoherent with measurement kernel with sub-Nyquist number of measurements. In particular when the sole objective of the acquisition is the detection of the frequency of a signal rather than exact reconstruction, then an undersampling framework like CS is able to perform the task. In this paper we explore the possibility of acquisition and detection of frequency of multiple analog signals, heavily corrupted with additive white Gaussian noise. We improvise upon the MOSAICS architecture proposed by us in our previous work to include a wider class of signals having non-integral frequency components. This makes it possible to perform multiplexed compressed sensing for general frequency sparse signals.","PeriodicalId":158295,"journal":{"name":"2011 National Conference on Communications (NCC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126653852","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}
Pub Date : 2011-03-17DOI: 10.1109/NCC.2011.5734697
S. Kini, Sankalp Gulati, P. Rao
The automatic classification of musical genre from audio signals has been a topic of active research in recent years. Although the identification of genre is a subjective task that likely involves high-level musical attributes such as instrumentation, style, rhythm and melody, low-level acoustic features have been widely applied to the automatic task with varying degrees of success. In this work, we consider the genres of the music of northern India, in particular the devotional music sub-genres of bhajan and qawwali. Both are rooted in the framework of North Indian classical music and are similar in the sense of serving the identical socio-cultural function even if for different religious communities of the same region. Features representing timbre, as well as temporal characteristics in the form of tempo and modulation spectra of timbral features, are shown to be potentially effective discriminators as seen by classification experiments performed on a database of excerpts drawn from the two music genres.
{"title":"Automatic genre classification of North Indian devotional music","authors":"S. Kini, Sankalp Gulati, P. Rao","doi":"10.1109/NCC.2011.5734697","DOIUrl":"https://doi.org/10.1109/NCC.2011.5734697","url":null,"abstract":"The automatic classification of musical genre from audio signals has been a topic of active research in recent years. Although the identification of genre is a subjective task that likely involves high-level musical attributes such as instrumentation, style, rhythm and melody, low-level acoustic features have been widely applied to the automatic task with varying degrees of success. In this work, we consider the genres of the music of northern India, in particular the devotional music sub-genres of bhajan and qawwali. Both are rooted in the framework of North Indian classical music and are similar in the sense of serving the identical socio-cultural function even if for different religious communities of the same region. Features representing timbre, as well as temporal characteristics in the form of tempo and modulation spectra of timbral features, are shown to be potentially effective discriminators as seen by classification experiments performed on a database of excerpts drawn from the two music genres.","PeriodicalId":158295,"journal":{"name":"2011 National Conference on Communications (NCC)","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115232677","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}
Pub Date : 2011-03-17DOI: 10.1109/NCC.2011.5734741
Avishek Majumdar, Nikhil Krishnan, S. R. Pillai, R. Velmurugan
Compressed Sensing (CS) provides a set of mathematical results showing that sparse signals can be exactly reconstructed from a relatively small number of random linear measurements. A particularly appealing greedy-approach to signal reconstruction from CS measurements is the so called Orthogonal Matching Pursuit (OMP). We propose two modifications to the basic OMP algorithm, which can be handy in different situations.
{"title":"Extensions to Orthogonal Matching Pursuit for Compressed Sensing","authors":"Avishek Majumdar, Nikhil Krishnan, S. R. Pillai, R. Velmurugan","doi":"10.1109/NCC.2011.5734741","DOIUrl":"https://doi.org/10.1109/NCC.2011.5734741","url":null,"abstract":"Compressed Sensing (CS) provides a set of mathematical results showing that sparse signals can be exactly reconstructed from a relatively small number of random linear measurements. A particularly appealing greedy-approach to signal reconstruction from CS measurements is the so called Orthogonal Matching Pursuit (OMP). We propose two modifications to the basic OMP algorithm, which can be handy in different situations.","PeriodicalId":158295,"journal":{"name":"2011 National Conference on Communications (NCC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121618747","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}
Pub Date : 2011-03-17DOI: 10.1109/NCC.2011.5734721
R. Saran, A. Sarje
Mathematical morphology is widely used in the area of signal and image analysis. It has enormous applications in detection of weak targets, object recognition and feature extraction, edge detection, image enhancement and many more. However, its use has long been hampered by its algorithmic complexity as the size of the structuring element or image grows. With the trend toward larger images and proportionally larger structuring element, the need for a fast and more efficient morphological processing algorithms become pressing. The performance of morphological processing algorithm can be speedup using AltiVec vetor processing unit. But the AltiVec programmers are frequently disappointed to discover that their AltiVec code is not much faster than their pre-existing scalar code. In some cases it may even be slower. In this correspondence, a new, simple yet much faster vectorized algorithm using AltiVec exhibiting constant-time complexity is described and analyzed. It is compared against the scalar version of the algorithm and other implementations. The proposed vectorized constant-time gray-scale morphological processing algorithm using AltiVec outperforms the 2-D naïve implementation, IXLib-AV library based implementation and the scalar version of constant-time morphological processing algorithm. It also exhibits the run time complexity independent of size of structuring element.
{"title":"Vectorization of constant-time gray-scale morphological processing algorithm using AltiVec","authors":"R. Saran, A. Sarje","doi":"10.1109/NCC.2011.5734721","DOIUrl":"https://doi.org/10.1109/NCC.2011.5734721","url":null,"abstract":"Mathematical morphology is widely used in the area of signal and image analysis. It has enormous applications in detection of weak targets, object recognition and feature extraction, edge detection, image enhancement and many more. However, its use has long been hampered by its algorithmic complexity as the size of the structuring element or image grows. With the trend toward larger images and proportionally larger structuring element, the need for a fast and more efficient morphological processing algorithms become pressing. The performance of morphological processing algorithm can be speedup using AltiVec vetor processing unit. But the AltiVec programmers are frequently disappointed to discover that their AltiVec code is not much faster than their pre-existing scalar code. In some cases it may even be slower. In this correspondence, a new, simple yet much faster vectorized algorithm using AltiVec exhibiting constant-time complexity is described and analyzed. It is compared against the scalar version of the algorithm and other implementations. The proposed vectorized constant-time gray-scale morphological processing algorithm using AltiVec outperforms the 2-D naïve implementation, IXLib-AV library based implementation and the scalar version of constant-time morphological processing algorithm. It also exhibits the run time complexity independent of size of structuring element.","PeriodicalId":158295,"journal":{"name":"2011 National Conference on Communications (NCC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133144802","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}
Pub Date : 2011-01-01DOI: 10.1109/NCC.2011.5734724
Varun Jog, S. R. Pillai, A. Karandikar
We consider a two user discrete memoryless broadcast channel (DMBC) with perfect feedback from both the receivers. The best known achievable region for the general DMBC without feedback is known as the Marton's region, where the achievable strategy employs random coding. By effectively using the available feedback, we construct explicit coding schemes which achieve any rate-pair in the Marton's region.
{"title":"On achieving Marton's region for broadcast channel using feedback","authors":"Varun Jog, S. R. Pillai, A. Karandikar","doi":"10.1109/NCC.2011.5734724","DOIUrl":"https://doi.org/10.1109/NCC.2011.5734724","url":null,"abstract":"We consider a two user discrete memoryless broadcast channel (DMBC) with perfect feedback from both the receivers. The best known achievable region for the general DMBC without feedback is known as the Marton's region, where the achievable strategy employs random coding. By effectively using the available feedback, we construct explicit coding schemes which achieve any rate-pair in the Marton's region.","PeriodicalId":158295,"journal":{"name":"2011 National Conference on Communications (NCC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121973632","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}
Pub Date : 2011-01-01DOI: 10.1109/NCC.2011.5734705
Gauri Joshi, A. Karandikar
In this paper, we address the problem of optimal relay placement in cellular networks for maximum extension of coverage area. We present a novel definition of the coverage radius after the introduction of relays. Using this, we determine the optimal relay positions to maximize the coverage radius and estimate the number of relays required per cell. We also analyze relay placement in the multi-cell scenario, which takes into account inter-cell interference, a dominant factor in the next generation cellular Orthogonal Frequency Division Multiple Access (OFDMA) systems. Considering inter-cell interference in the multi-cell scenario, leads to an interesting iterative algorithm which is used to determine the optimal relay station (RS) positions.
{"title":"Optimal relay placement for cellular coverage extension","authors":"Gauri Joshi, A. Karandikar","doi":"10.1109/NCC.2011.5734705","DOIUrl":"https://doi.org/10.1109/NCC.2011.5734705","url":null,"abstract":"In this paper, we address the problem of optimal relay placement in cellular networks for maximum extension of coverage area. We present a novel definition of the coverage radius after the introduction of relays. Using this, we determine the optimal relay positions to maximize the coverage radius and estimate the number of relays required per cell. We also analyze relay placement in the multi-cell scenario, which takes into account inter-cell interference, a dominant factor in the next generation cellular Orthogonal Frequency Division Multiple Access (OFDMA) systems. Considering inter-cell interference in the multi-cell scenario, leads to an interesting iterative algorithm which is used to determine the optimal relay station (RS) positions.","PeriodicalId":158295,"journal":{"name":"2011 National Conference on Communications (NCC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134420709","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：