Pub Date : 2013-03-28DOI: 10.1109/NCC.2013.6487952
Vijay Anavangot, B. Dey, S. R. Pillai
We consider a two-user multipath fading MAC with distributed CSI. The fading distributions are assumed to be identical for each of the links. Each transmitter employs distributed power/rate adaptation schemes based on its own measured channel values, i.e. without knowing the fading parameters of the other user. In a block fading set up and under average power constraints, we propose communication strategies which will maximize the sum-throughput, at the same time ensuring that there is negligible outage in every transmission block. We then extend our schemes to MIMO communications in presence of multi-path fading, and show their performance.
{"title":"On the sum capacity of multipath fading MAC with distributed CSI","authors":"Vijay Anavangot, B. Dey, S. R. Pillai","doi":"10.1109/NCC.2013.6487952","DOIUrl":"https://doi.org/10.1109/NCC.2013.6487952","url":null,"abstract":"We consider a two-user multipath fading MAC with distributed CSI. The fading distributions are assumed to be identical for each of the links. Each transmitter employs distributed power/rate adaptation schemes based on its own measured channel values, i.e. without knowing the fading parameters of the other user. In a block fading set up and under average power constraints, we propose communication strategies which will maximize the sum-throughput, at the same time ensuring that there is negligible outage in every transmission block. We then extend our schemes to MIMO communications in presence of multi-path fading, and show their performance.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134093051","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 : 2013-03-28DOI: 10.1109/NCC.2013.6487933
M. P., S. Sameer
In this paper, we propose a novel pilot-aided joint carrier frequency offset (CFO) and channel estimation method for orthogonal frequency division multiple access (OFDMA) uplink systems operating in doubly-selective fading environments. The method makes use of Bernstein basis polynomials (BBP) for capturing the time variations of the channel. By representing the channel in terms of basis functions, we need to track only the slowly varying basis expansion coefficients instead of the actual channel impulse response. The exact solution to this problem requires a multidimensional search which is highly computationally complex. Our proposed method makes use of space alternating generalized expectation maximization (SAGE) algorithm which replaces the multidimensional search with many one dimensional searches. Hence it is suitable practical implementation like mobile wireless communication. Simulation studies demonstrate that the proposed method gives excellent performance even at high mobile velocities.
{"title":"Pilot aided joint estimation of doubly selective channel and carrier frequency offset in high mobility OFDMA uplink","authors":"M. P., S. Sameer","doi":"10.1109/NCC.2013.6487933","DOIUrl":"https://doi.org/10.1109/NCC.2013.6487933","url":null,"abstract":"In this paper, we propose a novel pilot-aided joint carrier frequency offset (CFO) and channel estimation method for orthogonal frequency division multiple access (OFDMA) uplink systems operating in doubly-selective fading environments. The method makes use of Bernstein basis polynomials (BBP) for capturing the time variations of the channel. By representing the channel in terms of basis functions, we need to track only the slowly varying basis expansion coefficients instead of the actual channel impulse response. The exact solution to this problem requires a multidimensional search which is highly computationally complex. Our proposed method makes use of space alternating generalized expectation maximization (SAGE) algorithm which replaces the multidimensional search with many one dimensional searches. Hence it is suitable practical implementation like mobile wireless communication. Simulation studies demonstrate that the proposed method gives excellent performance even at high mobile velocities.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125630807","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 : 2013-03-28DOI: 10.1109/NCC.2013.6487951
T. Gopi Krishna, Istdeo Singh, K. Giridhar
A novel, efficient, non-iterative algorithm to find the null-space of the block convolution matrix which gives rise to a particular block banded block Toeplitz matrix (BBTM) is developed. This BBTM structure arises in the context of a multiple input multiple output (MIMO) (Nr receivers and Nt transmitters) orthogonal frequency division multiplexing (OFDM) model where the effective L taps channel impulse response length is to be shortened using a N tap channel shortening prefilter. This computationally efficient algorithm to find the null-space is derived from standard Gaussian elimination and exploits the structure of the MIMO-OFDM channel matrix. When compared to standard Gaussian elimination with partial pivoting which has a complexity of O(N3) for a L-tap channel the proposed algorithm has a run-time complexity of only O(N).
{"title":"Null-space of block convolution matrix","authors":"T. Gopi Krishna, Istdeo Singh, K. Giridhar","doi":"10.1109/NCC.2013.6487951","DOIUrl":"https://doi.org/10.1109/NCC.2013.6487951","url":null,"abstract":"A novel, efficient, non-iterative algorithm to find the null-space of the block convolution matrix which gives rise to a particular block banded block Toeplitz matrix (BBTM) is developed. This BBTM structure arises in the context of a multiple input multiple output (MIMO) (Nr receivers and Nt transmitters) orthogonal frequency division multiplexing (OFDM) model where the effective L taps channel impulse response length is to be shortened using a N tap channel shortening prefilter. This computationally efficient algorithm to find the null-space is derived from standard Gaussian elimination and exploits the structure of the MIMO-OFDM channel matrix. When compared to standard Gaussian elimination with partial pivoting which has a complexity of O(N3) for a L-tap channel the proposed algorithm has a run-time complexity of only O(N).","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115694048","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 : 2013-03-28DOI: 10.1109/NCC.2013.6488036
A. Mitra, Subrat Kar, A. Lord
Optical networks are now evolving due to the high bit rate demands of multimedia applications and internet services. These applications demand high bandwidth and the current fixed grid network can no longer work for data rate of 400Gbps or higher. This paper focuses on Link Margin (LM) and its effect on the spectrum saving for the demand of 100Gbps and 1000Gbps in a point to point optical link. Optical Signal to Noise Ratio (OSNR) threshold values are calculated for various Link Margins to achieve a BER of 10−3 for all M-ary modulation. Minimum amount of optical spectrum is allocated using the calculated OSNR threshold. Under good LM conditions, for demand of 100Gbps and 1000Gbps optical spectrum saving up to 7500Km and 1000Km is possible. Finally, we highlight the advantages of Flexgrid over Fixed grid and how it can achieve the above savings.
{"title":"Effect of Link Margin on spectrum saving and advantages of flexgrid optical networking","authors":"A. Mitra, Subrat Kar, A. Lord","doi":"10.1109/NCC.2013.6488036","DOIUrl":"https://doi.org/10.1109/NCC.2013.6488036","url":null,"abstract":"Optical networks are now evolving due to the high bit rate demands of multimedia applications and internet services. These applications demand high bandwidth and the current fixed grid network can no longer work for data rate of 400Gbps or higher. This paper focuses on Link Margin (LM) and its effect on the spectrum saving for the demand of 100Gbps and 1000Gbps in a point to point optical link. Optical Signal to Noise Ratio (OSNR) threshold values are calculated for various Link Margins to achieve a BER of 10−3 for all M-ary modulation. Minimum amount of optical spectrum is allocated using the calculated OSNR threshold. Under good LM conditions, for demand of 100Gbps and 1000Gbps optical spectrum saving up to 7500Km and 1000Km is possible. Finally, we highlight the advantages of Flexgrid over Fixed grid and how it can achieve the above savings.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116337217","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 : 2013-03-28DOI: 10.1109/NCC.2013.6487984
Ramani Boothalingam, V. Sherlin Solomi, A. R. Gladston, S. Christina, P. Vijayalakshmi, N. Thangavelu, H. Murthy
An unrestricted text-to-speech system is expected to produce a speech signal, corresponding to the given text in a language, that is highly intelligible to a human listener. Presently, unit selection-based synthesis (USS) and statistical parametric synthesis techniques are the state-of-art techniques for this task. Earlier, in [3], a concatenative synthesizer was developed for the language, Tamil, using 12 hrs of speech data, and shown that syllable is the better subword unit. The current work focuses on building FestVox voices using phoneme/CV unit as the subword unit, for a reduced amount of speech data (5 hrs) and to compare their performances in terms of quality. Further, the focus is to compare the performance of this synthesizer with that of the well known HMM-based speech synthesizer. Among the phoneme and CV-based systems built, although there are bound to be more concatenation points in a phoneme-based system, it is observed that it triumphs the CV-based system with an MOS of 2.96, primarily because, there are more examples available for each phoneme for the given amount of speech data. Further, an HMM-based speech synthesis system is developed using 5 hrs data. Although, in the synthesized speech, the speaker identity is not completely preserved, there are no sonic-glitches and the quality obtained is much better than that of a phoneme/CV-based systems, with an MOS of 3.86. Further, the footprint size of the system is exorbitantly reduced from 1 GB in USS system to 6 MB in HMM-based speech synthesis system.
{"title":"Development and evaluation of unit selection and HMM-based speech synthesis systems for Tamil","authors":"Ramani Boothalingam, V. Sherlin Solomi, A. R. Gladston, S. Christina, P. Vijayalakshmi, N. Thangavelu, H. Murthy","doi":"10.1109/NCC.2013.6487984","DOIUrl":"https://doi.org/10.1109/NCC.2013.6487984","url":null,"abstract":"An unrestricted text-to-speech system is expected to produce a speech signal, corresponding to the given text in a language, that is highly intelligible to a human listener. Presently, unit selection-based synthesis (USS) and statistical parametric synthesis techniques are the state-of-art techniques for this task. Earlier, in [3], a concatenative synthesizer was developed for the language, Tamil, using 12 hrs of speech data, and shown that syllable is the better subword unit. The current work focuses on building FestVox voices using phoneme/CV unit as the subword unit, for a reduced amount of speech data (5 hrs) and to compare their performances in terms of quality. Further, the focus is to compare the performance of this synthesizer with that of the well known HMM-based speech synthesizer. Among the phoneme and CV-based systems built, although there are bound to be more concatenation points in a phoneme-based system, it is observed that it triumphs the CV-based system with an MOS of 2.96, primarily because, there are more examples available for each phoneme for the given amount of speech data. Further, an HMM-based speech synthesis system is developed using 5 hrs data. Although, in the synthesized speech, the speaker identity is not completely preserved, there are no sonic-glitches and the quality obtained is much better than that of a phoneme/CV-based systems, with an MOS of 3.86. Further, the footprint size of the system is exorbitantly reduced from 1 GB in USS system to 6 MB in HMM-based speech synthesis system.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129716731","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 : 2013-03-28DOI: 10.1109/NCC.2013.6487915
Neelakandan Rajmohan, A. P. Kannu
In a heterogeneous cellular network(HetNet), the mobile terminal (MT) receives the superposition of transmit signals from different BS in its vicinity. Because of the inherent transmit power difference of different kinds of BS(macro,femto,pico) and due to near far effect, the MT encounters strong interference from neighbouring BS. Every BS sends a known training signal (synchoronization signal) to enable the MT to perform necessary physical layer operations and decode relevant information for further communication. The synchronization signals are unique to every BS. In this paper we consider the problem of a MT synchoronizing to a BS, whose received power is relatively weak and the MT encounters a strong interference from another BS. For this we propose different alignment methodologies for the location of training signals of strong power BS and weak power BS in their respective frames. We show that when these two training signals corresponding to strong and weak BS have an offset in time equal to half the training signal duration, the detection performance of weaker BS can be significantly improved.
{"title":"Frame alignment and interference cancellation strategies for cell search in HetNets","authors":"Neelakandan Rajmohan, A. P. Kannu","doi":"10.1109/NCC.2013.6487915","DOIUrl":"https://doi.org/10.1109/NCC.2013.6487915","url":null,"abstract":"In a heterogeneous cellular network(HetNet), the mobile terminal (MT) receives the superposition of transmit signals from different BS in its vicinity. Because of the inherent transmit power difference of different kinds of BS(macro,femto,pico) and due to near far effect, the MT encounters strong interference from neighbouring BS. Every BS sends a known training signal (synchoronization signal) to enable the MT to perform necessary physical layer operations and decode relevant information for further communication. The synchronization signals are unique to every BS. In this paper we consider the problem of a MT synchoronizing to a BS, whose received power is relatively weak and the MT encounters a strong interference from another BS. For this we propose different alignment methodologies for the location of training signals of strong power BS and weak power BS in their respective frames. We show that when these two training signals corresponding to strong and weak BS have an offset in time equal to half the training signal duration, the detection performance of weaker BS can be significantly improved.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126556840","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 : 2013-03-28DOI: 10.1109/NCC.2013.6487914
Sayantan Hazra, R. Bhattacharjee
A new technique to derive level crossing rate (LCR) and average fade duration (AFD) in a wideband wireless communication channel is proposed. The analytical formulation of LCR and AFD is based upon the channel impulse response and the consequent tapped-delay line structure. As the statistics of the received multipath signal changes from one delay bin to another, statistical quantities like LCR and complimentary distribution function (CDF) are calculated separately at each delay bin and then they are combined by proper weights to obtain the overall LCR and AFD of the signal. Results are shown for two cases of multipath propagation channel - single cluster and multi-cluster.
{"title":"A new technique for derivation of LCR and AFD in wideband wireless channel","authors":"Sayantan Hazra, R. Bhattacharjee","doi":"10.1109/NCC.2013.6487914","DOIUrl":"https://doi.org/10.1109/NCC.2013.6487914","url":null,"abstract":"A new technique to derive level crossing rate (LCR) and average fade duration (AFD) in a wideband wireless communication channel is proposed. The analytical formulation of LCR and AFD is based upon the channel impulse response and the consequent tapped-delay line structure. As the statistics of the received multipath signal changes from one delay bin to another, statistical quantities like LCR and complimentary distribution function (CDF) are calculated separately at each delay bin and then they are combined by proper weights to obtain the overall LCR and AFD of the signal. Results are shown for two cases of multipath propagation channel - single cluster and multi-cluster.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126569213","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 : 2013-03-28DOI: 10.1109/NCC.2013.6487957
V. Sreenath, A. Thangaraj
We present implementations of two secret key sharing schemes over a Gaussian wire-tap channel and an error-free public side channel. Information-theoretic secrecy is the basis for these schemes. The first scheme uses only one-way communication between transmitter and receiver. In this case, without interaction, we share randomness from transmitter to receiver and extract a secret key from this randomness with the help of extra information sent by the transmitter on the side channel. In this scheme, we show it is possible to agree on a secret key, if the channel conditions between transmitter and receiver are better than that of the transmitter and any eavesdropper. The second scheme is with two-way communication between transmitter and receiver. In this case, we model the AWGN channel as a Binary Symmetric Channel, and show that it is possible for secret key sharing even if the transmitter-eavesdropper channel quality is better than that of the transmitter-receiver channel. We present simulation and experimental results for both these schemes with the help of Software Defined Radio tools.
{"title":"Implementation of physical layer key sharing schemes using Software Defined Radios","authors":"V. Sreenath, A. Thangaraj","doi":"10.1109/NCC.2013.6487957","DOIUrl":"https://doi.org/10.1109/NCC.2013.6487957","url":null,"abstract":"We present implementations of two secret key sharing schemes over a Gaussian wire-tap channel and an error-free public side channel. Information-theoretic secrecy is the basis for these schemes. The first scheme uses only one-way communication between transmitter and receiver. In this case, without interaction, we share randomness from transmitter to receiver and extract a secret key from this randomness with the help of extra information sent by the transmitter on the side channel. In this scheme, we show it is possible to agree on a secret key, if the channel conditions between transmitter and receiver are better than that of the transmitter and any eavesdropper. The second scheme is with two-way communication between transmitter and receiver. In this case, we model the AWGN channel as a Binary Symmetric Channel, and show that it is possible for secret key sharing even if the transmitter-eavesdropper channel quality is better than that of the transmitter-receiver channel. We present simulation and experimental results for both these schemes with the help of Software Defined Radio tools.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129153339","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 : 2013-03-28DOI: 10.1109/NCC.2013.6487913
R. Singh, P. G. Poonacha
Twisting of Radio waves is a hot topic that is being worked upon which utilizes the many OAM (Orbital Angular Momentum) states to transmit data at the same frequency. Twisting of antennas is done to transmit the various orthogonal OAM states that can be used as basis functions in N-dimensional signaling. The utilization of various orthogonal states is termed as “Topological” diversity. The technique has been experimentally implemented and demonstrated and the idea of OAM is already well understood and used in the optical domain. In this paper, we present the techniques used to achieve topological diversity and its prospects in future Wireless Communications.
{"title":"Survey of techniques for achieving topological diversity","authors":"R. Singh, P. G. Poonacha","doi":"10.1109/NCC.2013.6487913","DOIUrl":"https://doi.org/10.1109/NCC.2013.6487913","url":null,"abstract":"Twisting of Radio waves is a hot topic that is being worked upon which utilizes the many OAM (Orbital Angular Momentum) states to transmit data at the same frequency. Twisting of antennas is done to transmit the various orthogonal OAM states that can be used as basis functions in N-dimensional signaling. The utilization of various orthogonal states is termed as “Topological” diversity. The technique has been experimentally implemented and demonstrated and the idea of OAM is already well understood and used in the optical domain. In this paper, we present the techniques used to achieve topological diversity and its prospects in future Wireless Communications.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121854036","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 : 2013-03-28DOI: 10.1109/NCC.2013.6487927
S. Kalamkar, Adrish Banerjee
In cognitive radio, spectrum sensing is a fundamental task and is used to detect primary user. Energy detection is a popular spectrum sensing technique. But detection performance of energy detector (ED) deteriorates in low signal-to-noise ratio (SNR) conditions and under noise uncertainty. In this paper, we study generalized energy detector (GED), obtained by replacing squaring operation of amplitude of the received signal in conventional energy detector (CED) with an arbitrary positive power operation p under noise uncertainty. For the worst case of noise uncertainty we analytically show that SNR wall is not dependent on the value of p. We further investigate the detection performance of GED for different values of p under uniformly distributed noise uncertainty and show that CED is the best ED under noise uncertainty. We also show that at noise uncertainty greater than 0.5 dB, the performance gap between different EDs almost vanishes and the detection performances of all EDs almost become the same for all values of p.
{"title":"On the performance of generalized energy detector under noise uncertainty in cognitive radio","authors":"S. Kalamkar, Adrish Banerjee","doi":"10.1109/NCC.2013.6487927","DOIUrl":"https://doi.org/10.1109/NCC.2013.6487927","url":null,"abstract":"In cognitive radio, spectrum sensing is a fundamental task and is used to detect primary user. Energy detection is a popular spectrum sensing technique. But detection performance of energy detector (ED) deteriorates in low signal-to-noise ratio (SNR) conditions and under noise uncertainty. In this paper, we study generalized energy detector (GED), obtained by replacing squaring operation of amplitude of the received signal in conventional energy detector (CED) with an arbitrary positive power operation p under noise uncertainty. For the worst case of noise uncertainty we analytically show that SNR wall is not dependent on the value of p. We further investigate the detection performance of GED for different values of p under uniformly distributed noise uncertainty and show that CED is the best ED under noise uncertainty. We also show that at noise uncertainty greater than 0.5 dB, the performance gap between different EDs almost vanishes and the detection performances of all EDs almost become the same for all values of p.","PeriodicalId":202526,"journal":{"name":"2013 National Conference on Communications (NCC)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126691548","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
扫码关注我们
求助内容：
应助结果提醒方式：