Pub Date : 2012-04-03DOI: 10.1109/NCC.2012.6176828
K. L. Sheeja, P. K. Sahu, S. Behera
In this paper, a comparative study between a compact microstrip Zeroth Order Resonant antenna with another coplanar waveguide (CPW) based vialess ZOR antenna is presented. But the drawback of this microstrip based CRLH TL is that a narrow bandwidth of about 0.75% with an improved gain of about 3.6256dB is achieved. In order to circumvent this drawback we demonstrate a vialess CPW fed structure using the same substrate, RT Duroid (5880) (εR = 2.2, h = 1.57mm) and compare the performance of both these antennas. In the CPW fed case we obtain a bandwidth enhancement of about 7.84% with a dumb-bell shaped radiation pattern at phi=90deg (E-radiation pattern). The zeroth order mode obtained in this case is at 2.14GHz while with the microstrip based ZOR antenna, the zeroth order freq is at 3.995GHz with a monopolar radiation pattern at phi=90deg. The CPW fed antenna is easy to fabricate as it is based on a single layer. The drawback of this CPW fed antenna is that the gain reduces to 1.6949dB as the structure is electrically much smaller than the microstrip based ZOR antenna. Simulated results for both the cases are shown. The operational bandwidth of the CPW based ZOR antenna at 2.14 (2.06 to 2.2195) GHz covers the required bandwidths of the IEEE 802.11 for wireless local-area networks (WLAN) applications while in case of the microstrip ZOR antenna, the operational bandwidth at 3.995Ghz and at 3.095 GHz encompasses worldwide interoperability for microwave access (WiMax) standards suitable for point to point multiband applications.
{"title":"Comparative study of a CRLH TL based Zeroth Order Resonant antenna","authors":"K. L. Sheeja, P. K. Sahu, S. Behera","doi":"10.1109/NCC.2012.6176828","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176828","url":null,"abstract":"In this paper, a comparative study between a compact microstrip Zeroth Order Resonant antenna with another coplanar waveguide (CPW) based vialess ZOR antenna is presented. But the drawback of this microstrip based CRLH TL is that a narrow bandwidth of about 0.75% with an improved gain of about 3.6256dB is achieved. In order to circumvent this drawback we demonstrate a vialess CPW fed structure using the same substrate, RT Duroid (5880) (εR = 2.2, h = 1.57mm) and compare the performance of both these antennas. In the CPW fed case we obtain a bandwidth enhancement of about 7.84% with a dumb-bell shaped radiation pattern at phi=90deg (E-radiation pattern). The zeroth order mode obtained in this case is at 2.14GHz while with the microstrip based ZOR antenna, the zeroth order freq is at 3.995GHz with a monopolar radiation pattern at phi=90deg. The CPW fed antenna is easy to fabricate as it is based on a single layer. The drawback of this CPW fed antenna is that the gain reduces to 1.6949dB as the structure is electrically much smaller than the microstrip based ZOR antenna. Simulated results for both the cases are shown. The operational bandwidth of the CPW based ZOR antenna at 2.14 (2.06 to 2.2195) GHz covers the required bandwidths of the IEEE 802.11 for wireless local-area networks (WLAN) applications while in case of the microstrip ZOR antenna, the operational bandwidth at 3.995Ghz and at 3.095 GHz encompasses worldwide interoperability for microwave access (WiMax) standards suitable for point to point multiband applications.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125367420","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176771
A. Pramanik, R. A. Baradol
This paper describes the implementation of a fast information encoder and decoder for UHF radio considering the trade-off of speed of operation and storage space. (24, 12, 8) Golay code was implemented on an 8051 core based 8-bit microcontroller with a speed of around 60 MHz. The different available techniques to encode and decode Golay codes are discussed. A comparative study of the implementation aspects of different techniques are presented and a final solution which gives the best trade-off of speed of operation and storage space is provided.
{"title":"Implementing fast and simple FEC for ultra high frequency radio","authors":"A. Pramanik, R. A. Baradol","doi":"10.1109/NCC.2012.6176771","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176771","url":null,"abstract":"This paper describes the implementation of a fast information encoder and decoder for UHF radio considering the trade-off of speed of operation and storage space. (24, 12, 8) Golay code was implemented on an 8051 core based 8-bit microcontroller with a speed of around 60 MHz. The different available techniques to encode and decode Golay codes are discussed. A comparative study of the implementation aspects of different techniques are presented and a final solution which gives the best trade-off of speed of operation and storage space is provided.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122539789","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176739
S. Khakurel, M. Mehta, A. Karandikar
Third Generation Partnership Project (3GPP) Long Term Evolution-Advanced (LTE-A) has considered the deployment of Relay Nodes (RNs) for cost-effective throughput enhancement and coverage extension. The coverage extension (increase in cell radius) depends on the radial position of RNs in the cell. This is because the location of a RN affects the Signal-to-Interference-plus-Noise Ratio (SINR) of the received signal on the evolved-NodeB (eNB)-RN and RN-User Equipment (UE) links. In this paper, we investigate the problem of optimal relay placement for coverage extension in relay assisted LTE-A networks. Since DownLink (DL) and UpLink (UL) transmission scenarios in cellular networks are asymmetrical in terms of coverage (due to discrepancy in maximum transmit power), we consider both DL and UL transmission scenarios for optimal relay placement. In addition, we analyze the problem for the case when interference from neighbouring cells is taken into account.
{"title":"Optimal relay placement for coverage extension in LTE-A cellular systems","authors":"S. Khakurel, M. Mehta, A. Karandikar","doi":"10.1109/NCC.2012.6176739","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176739","url":null,"abstract":"Third Generation Partnership Project (3GPP) Long Term Evolution-Advanced (LTE-A) has considered the deployment of Relay Nodes (RNs) for cost-effective throughput enhancement and coverage extension. The coverage extension (increase in cell radius) depends on the radial position of RNs in the cell. This is because the location of a RN affects the Signal-to-Interference-plus-Noise Ratio (SINR) of the received signal on the evolved-NodeB (eNB)-RN and RN-User Equipment (UE) links. In this paper, we investigate the problem of optimal relay placement for coverage extension in relay assisted LTE-A networks. Since DownLink (DL) and UpLink (UL) transmission scenarios in cellular networks are asymmetrical in terms of coverage (due to discrepancy in maximum transmit power), we consider both DL and UL transmission scenarios for optimal relay placement. In addition, we analyze the problem for the case when interference from neighbouring cells is taken into account.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"332 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122746520","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176785
F. Ghadiri, S. M. Zabihi, H. Pourreza, T. Banaee
Vessel detection is an important task for diagnosis of vascular diseases in clinical images. Many diseases such as diabetic retinopathy and hypertension can be detected by retinal vessel map or scanning conjunctival vessels. There are a lot of techniques for vessel extraction from retinal images but most of them have failed to face with some patterns like hemorrhages and micro aneurysms. In this paper we develop an algorithm based on Non-subsampled Contourlet Transform (NSCT) and morphological operations. By combining of information from two scales of contourlet and gray scale image, vessel map is extracted. Optic disc border is eliminated by Non-subsampled Contourlet directional information. In addition, circular shapes such as micro aneurysms are removed using morphological operations. We examine our algorithm on retinal images of DRIVE database and conjuntival images of Khatam database. Experimental results show significant improvements in achieving high accuracy and decreasing False Positive Rate (FPR) of vessel detection on both databases.
{"title":"A novel method for vessel detection using Contourlet Transform","authors":"F. Ghadiri, S. M. Zabihi, H. Pourreza, T. Banaee","doi":"10.1109/NCC.2012.6176785","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176785","url":null,"abstract":"Vessel detection is an important task for diagnosis of vascular diseases in clinical images. Many diseases such as diabetic retinopathy and hypertension can be detected by retinal vessel map or scanning conjunctival vessels. There are a lot of techniques for vessel extraction from retinal images but most of them have failed to face with some patterns like hemorrhages and micro aneurysms. In this paper we develop an algorithm based on Non-subsampled Contourlet Transform (NSCT) and morphological operations. By combining of information from two scales of contourlet and gray scale image, vessel map is extracted. Optic disc border is eliminated by Non-subsampled Contourlet directional information. In addition, circular shapes such as micro aneurysms are removed using morphological operations. We examine our algorithm on retinal images of DRIVE database and conjuntival images of Khatam database. Experimental results show significant improvements in achieving high accuracy and decreasing False Positive Rate (FPR) of vessel detection on both databases.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123937151","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176791
Sudharsan Parthasarathy, Praveen Sankaran
The dynamic range of a camera is much lesser than that of human visual system. This causes images taken by the camera to look different from how the scene would have looked to a naked eye. Multi Scale Retinex with Color Restoration (MSRCR) algorithm enhances images taken under a wide range of nonlinear illumination conditions to the level that a user would have perceived it in real time. But there are parameters used in this enhancement method that are image dependent and have to be varied based on the images under consideration. In this paper we propose a completely automated approach for MSRCR by obtaining parameter values from the image being enhanced.
相机的动态范围比人类视觉系统的动态范围小得多。这使得相机拍摄的图像看起来与肉眼所看到的场景不同。Multi - Scale Retinex with Color Restoration (MSRCR)算法将在大范围非线性光照条件下拍摄的图像增强到用户能够实时感知的水平。但是，这种增强方法中使用的参数与图像相关，必须根据所考虑的图像进行更改。在本文中，我们提出了一种完全自动化的MSRCR方法，通过从被增强的图像中获取参数值。
{"title":"An automated multi Scale Retinex with Color Restoration for image enhancement","authors":"Sudharsan Parthasarathy, Praveen Sankaran","doi":"10.1109/NCC.2012.6176791","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176791","url":null,"abstract":"The dynamic range of a camera is much lesser than that of human visual system. This causes images taken by the camera to look different from how the scene would have looked to a naked eye. Multi Scale Retinex with Color Restoration (MSRCR) algorithm enhances images taken under a wide range of nonlinear illumination conditions to the level that a user would have perceived it in real time. But there are parameters used in this enhancement method that are image dependent and have to be varied based on the images under consideration. In this paper we propose a completely automated approach for MSRCR by obtaining parameter values from the image being enhanced.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123103993","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176856
I. Ali, G. Saha
Outliers in real time speaker recognition can be viewed as a disturbing element and one of the reason of the degradation of the recognition accuracy. In speaker space, outliers may consider as non-intrinsic speaker's information in clean environment or noise information in noisy environment. So detection of outliers purify the speaker space with most speaker specific feature vectors in both clean and noisy environment. There are several methodology to detect outliers but in this paper we use a distance based method to mitigate the effects of outliers and incorporate fusion techniques to improve the recognition accuracy of speaker recognition system. Distances are taken from Minkowski family up to third order and also Mahalanobis distance which is a probabilistic distance. In fusion methodology we use GMM as a single classifier with complementary feature sets, MFCC and IMFCC. In this paper, we fuse the score of MFCC and IMFCC with a equal weight method. This method not only improves the recognition accuracy but simultaneously improve the detection rate of outliers with respect to the base line feature set.
{"title":"Outlier removal and fusion techniques for robust speaker recognition applications","authors":"I. Ali, G. Saha","doi":"10.1109/NCC.2012.6176856","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176856","url":null,"abstract":"Outliers in real time speaker recognition can be viewed as a disturbing element and one of the reason of the degradation of the recognition accuracy. In speaker space, outliers may consider as non-intrinsic speaker's information in clean environment or noise information in noisy environment. So detection of outliers purify the speaker space with most speaker specific feature vectors in both clean and noisy environment. There are several methodology to detect outliers but in this paper we use a distance based method to mitigate the effects of outliers and incorporate fusion techniques to improve the recognition accuracy of speaker recognition system. Distances are taken from Minkowski family up to third order and also Mahalanobis distance which is a probabilistic distance. In fusion methodology we use GMM as a single classifier with complementary feature sets, MFCC and IMFCC. In this paper, we fuse the score of MFCC and IMFCC with a equal weight method. This method not only improves the recognition accuracy but simultaneously improve the detection rate of outliers with respect to the base line feature set.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132605346","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176906
A. Alapati, A. Krishnakumar, A. Thangaraj
We consider a network coding problem with a single source and multiple sinks. A common set of messages is demanded by all sinks. In addition, each sink demands a private set of messages, which is disjoint from the private set of all other sinks. This pattern of demands is called simultaneous multicast and unicast. This is a specific case of the general connections problem, for which determining the existence of a linear network coding solution is NP-hard. However, the multicast or disjoint broadcast problems, which are the individual components of the simultaneous multicast and unicast problem, are both linearly solvable in polynomial time. Observing that the mincut conditions are insufficient to show the existence of linear network coding solution for simultaneous multicast and unicast, we study a new set of sufficient conditions. We show that public-private separation is the sufficient condition for the existence of linear network coding solution. We start with a set of graphs called 3-level graphs and provide certain extensions.
{"title":"Public-private separation in linear network-coded simultaneous multicast and unicast","authors":"A. Alapati, A. Krishnakumar, A. Thangaraj","doi":"10.1109/NCC.2012.6176906","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176906","url":null,"abstract":"We consider a network coding problem with a single source and multiple sinks. A common set of messages is demanded by all sinks. In addition, each sink demands a private set of messages, which is disjoint from the private set of all other sinks. This pattern of demands is called simultaneous multicast and unicast. This is a specific case of the general connections problem, for which determining the existence of a linear network coding solution is NP-hard. However, the multicast or disjoint broadcast problems, which are the individual components of the simultaneous multicast and unicast problem, are both linearly solvable in polynomial time. Observing that the mincut conditions are insufficient to show the existence of linear network coding solution for simultaneous multicast and unicast, we study a new set of sufficient conditions. We show that public-private separation is the sufficient condition for the existence of linear network coding solution. We start with a set of graphs called 3-level graphs and provide certain extensions.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130477932","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176789
P. Mandal, S. De
In this paper, we consider a two-tier communication scenario in an underwater sensor network. The field nodes form single-hop clusters around the gateway nodes and communicate with them via acoustic wireless links, while the gateway nodes communicate directly via radio frequency (RF) wireless links to the sink node. Thus, the field data is collected at the sink node via two-hop communication links. The field data being sporadic, the multi-access communications in the two hops are considered slotted random access (S-Aloha) based. We first analyze the performance of the receiver synchronized S-Aloha in underwater network which is used for data communication from the sensor nodes to their respective gateway nodes. The multi-access throughput performance over the RF links at the sink node is also characterized. We then study the optimum cluster size that maximizes the overall network throughput. Our numerical results are supported by discrete event based random network simulation studies.
{"title":"On the underwater wireless network clustering","authors":"P. Mandal, S. De","doi":"10.1109/NCC.2012.6176789","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176789","url":null,"abstract":"In this paper, we consider a two-tier communication scenario in an underwater sensor network. The field nodes form single-hop clusters around the gateway nodes and communicate with them via acoustic wireless links, while the gateway nodes communicate directly via radio frequency (RF) wireless links to the sink node. Thus, the field data is collected at the sink node via two-hop communication links. The field data being sporadic, the multi-access communications in the two hops are considered slotted random access (S-Aloha) based. We first analyze the performance of the receiver synchronized S-Aloha in underwater network which is used for data communication from the sensor nodes to their respective gateway nodes. The multi-access throughput performance over the RF links at the sink node is also characterized. We then study the optimum cluster size that maximizes the overall network throughput. Our numerical results are supported by discrete event based random network simulation studies.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114665186","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176826
T. N. V. L. Alekhya, B. Mounika, E. Jyothi, B. Bhandari
In this paper a new backoff algorithm is proposed to enhance both the delay and the throughput performance of IEEE 802.11b MAC protocol. The proposed waiting time based backoff algorithm (WBA), observes the Waiting-time of each station during the backoff procedure in order to estimate the size of contention window in the network. The main objective of our investigation is to examine the performance of IEEE 802.11 MAC protocol with our proposed algorithm and compare with the standard backoff algorithm i.e. Binary Exponential Backoff (BEB) algorithm. The simulation results show that the WBA algorithm outperforms the standard backoff algorithm because it has better adaptability to the network load variations.
{"title":"A waiting-time based backoff algorithm in the IEEE 802.11 based wireless networks","authors":"T. N. V. L. Alekhya, B. Mounika, E. Jyothi, B. Bhandari","doi":"10.1109/NCC.2012.6176826","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176826","url":null,"abstract":"In this paper a new backoff algorithm is proposed to enhance both the delay and the throughput performance of IEEE 802.11b MAC protocol. The proposed waiting time based backoff algorithm (WBA), observes the Waiting-time of each station during the backoff procedure in order to estimate the size of contention window in the network. The main objective of our investigation is to examine the performance of IEEE 802.11 MAC protocol with our proposed algorithm and compare with the standard backoff algorithm i.e. Binary Exponential Backoff (BEB) algorithm. The simulation results show that the WBA algorithm outperforms the standard backoff algorithm because it has better adaptability to the network load variations.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122028552","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 : 2012-04-03DOI: 10.1109/NCC.2012.6176840
F. Raphel, S. Sameer
This paper models a generic two hop amplify and forward (AF) cooperative relay system into a multi input multi output (MIMO) mimicking (MM) AF system, to facilitate the estimation of interim relay channels at destination node (DN) without introducing complexity at relay node (RN). This is achieved through the use of predefined pilot enhancement matrix (PEM) at RN and the corresponding overall channel estimation performed at the destination node (DN) with the help of pilots broad casted from source node (SN). The proposed channel estimation algorithm is based on linear least square estimation (LSE) technique and an AF cooperative system with space time coding (STC) is considered. The proposed technique is shown to achieve a better BER performance without compromising the transmission rate. The performance advantages of this new method are substantiated through simulation studies.
{"title":"A novel interim channel estimation technique for MIMO mimicking AF cooperative relay systems","authors":"F. Raphel, S. Sameer","doi":"10.1109/NCC.2012.6176840","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176840","url":null,"abstract":"This paper models a generic two hop amplify and forward (AF) cooperative relay system into a multi input multi output (MIMO) mimicking (MM) AF system, to facilitate the estimation of interim relay channels at destination node (DN) without introducing complexity at relay node (RN). This is achieved through the use of predefined pilot enhancement matrix (PEM) at RN and the corresponding overall channel estimation performed at the destination node (DN) with the help of pilots broad casted from source node (SN). The proposed channel estimation algorithm is based on linear least square estimation (LSE) technique and an AF cooperative system with space time coding (STC) is considered. The proposed technique is shown to achieve a better BER performance without compromising the transmission rate. The performance advantages of this new method are substantiated through simulation studies.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129123062","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
扫码关注我们
求助内容：
应助结果提醒方式：