Pub Date : 2014-11-10DOI: 10.1109/ICCSP.2014.6949897
K. Khare, R. Kar, D. Mandal, S. Ghoshal
Leakage power is a major issue for short channel devices. As the technology is shrinking (i.e., 180nm, 90nm, 45nm. etc.) the leakage current is increasing very fast. So, several methods and techniques have been proposed for leakage reduction in CMOS digital integrated circuits. Leakage power dissipation has become a sizable proportion of the total power dissipation in integrated circuit. This paper demonstrates the ideas of 6T, 8T and 10T models with sleep transistors. This proposed SRAM cells give the advantages over basic 6T, 8T and 10T transistor models. The SRAM cell with sleep transistor shows better leakage reduction approach than stack approaches. Here in this paper Analog environment virtuoso (cadence) simulator is used for analysis of the power associated with CMOS SRAM cell for 180nm technology.
{"title":"Analysis of leakage current and leakage power reduction during write operation in CMOS SRAM cell","authors":"K. Khare, R. Kar, D. Mandal, S. Ghoshal","doi":"10.1109/ICCSP.2014.6949897","DOIUrl":"https://doi.org/10.1109/ICCSP.2014.6949897","url":null,"abstract":"Leakage power is a major issue for short channel devices. As the technology is shrinking (i.e., 180nm, 90nm, 45nm. etc.) the leakage current is increasing very fast. So, several methods and techniques have been proposed for leakage reduction in CMOS digital integrated circuits. Leakage power dissipation has become a sizable proportion of the total power dissipation in integrated circuit. This paper demonstrates the ideas of 6T, 8T and 10T models with sleep transistors. This proposed SRAM cells give the advantages over basic 6T, 8T and 10T transistor models. The SRAM cell with sleep transistor shows better leakage reduction approach than stack approaches. Here in this paper Analog environment virtuoso (cadence) simulator is used for analysis of the power associated with CMOS SRAM cell for 180nm technology.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120969904","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 : 2014-11-10DOI: 10.1109/ICCSP.2014.6950060
Rajashri Khanai, G. Kulkarni, Dattaprasad Torse
Modern wireless communications have increased requirements for reliable communication with significant security mechanisms. In this paper cryptography and error correction coding is combined in a single step known as “Crypto-Coding”. The focus is on the application of neural networks to Crypto- Coding. This approach provides data security for reliable transmission as encryption and error correction takes place in a single step. The computational costs and increase efficiency, mainly in practical system performance is evaluated over Land Mobile Satellite (LMS) channel. We are combining Data Encryption Standard (DES) and Turbo coding in a single step to significantly reduce realizations. A number of experimental studies show applicability of the technique to a selected set of areas in cryptography and error correction coding. Simulation results show that the BER performance of the neural Crypto- Coding is close to the Crypto-Coding, for data length equal to 1024 bits, and achieves a BER of about 4 × 10-5 at an SNR of 10 dB. The proposed algorithms are well suited for implementation on a VLSI-platform.
{"title":"Neural Crypto-Coding as DES: Turbo over Land Mobile Satellite (LMS) channel","authors":"Rajashri Khanai, G. Kulkarni, Dattaprasad Torse","doi":"10.1109/ICCSP.2014.6950060","DOIUrl":"https://doi.org/10.1109/ICCSP.2014.6950060","url":null,"abstract":"Modern wireless communications have increased requirements for reliable communication with significant security mechanisms. In this paper cryptography and error correction coding is combined in a single step known as “Crypto-Coding”. The focus is on the application of neural networks to Crypto- Coding. This approach provides data security for reliable transmission as encryption and error correction takes place in a single step. The computational costs and increase efficiency, mainly in practical system performance is evaluated over Land Mobile Satellite (LMS) channel. We are combining Data Encryption Standard (DES) and Turbo coding in a single step to significantly reduce realizations. A number of experimental studies show applicability of the technique to a selected set of areas in cryptography and error correction coding. Simulation results show that the BER performance of the neural Crypto- Coding is close to the Crypto-Coding, for data length equal to 1024 bits, and achieves a BER of about 4 × 10-5 at an SNR of 10 dB. The proposed algorithms are well suited for implementation on a VLSI-platform.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131901053","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 : 2014-04-03DOI: 10.1109/ICCSP.2014.6950027
D. Vaishali, R. Ramesh, J. Christaline
Spatial autoregressive (AR) models have been extensively used to represent texture images in machine learning applications. This work emphasizes the contribution of 2D autoregressive models for analysis and synthesis of textural images. Autoregressive model parameters as a feature set of texture image represent texture and used for synthesis. Yule walker Least Square (LS) method has used for parameter estimation. The test statistics for choice of proper neighbourhood (N) has also been suggested. The Brodatz texture image album has chosen for the experimentation. Parameters have estimated from the textures. The test statistics decides the best neighbourhood or proper order of the model. The synthesized texture image and the original texture image have compared for perceptual similarities. It is been inferred that the proper neighbourhood for a given texture is unique and solely depends on the properties of the texture.
{"title":"2 D autoregressive model for texture analysis and synthesis","authors":"D. Vaishali, R. Ramesh, J. Christaline","doi":"10.1109/ICCSP.2014.6950027","DOIUrl":"https://doi.org/10.1109/ICCSP.2014.6950027","url":null,"abstract":"Spatial autoregressive (AR) models have been extensively used to represent texture images in machine learning applications. This work emphasizes the contribution of 2D autoregressive models for analysis and synthesis of textural images. Autoregressive model parameters as a feature set of texture image represent texture and used for synthesis. Yule walker Least Square (LS) method has used for parameter estimation. The test statistics for choice of proper neighbourhood (N) has also been suggested. The Brodatz texture image album has chosen for the experimentation. Parameters have estimated from the textures. The test statistics decides the best neighbourhood or proper order of the model. The synthesized texture image and the original texture image have compared for perceptual similarities. It is been inferred that the proper neighbourhood for a given texture is unique and solely depends on the properties of the texture.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115652971","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 : 2014-04-03DOI: 10.1109/ICCSP.2014.6949921
Abhijit P. Tathode, Ratnaprabha W. Jassutkar
Designing and implementation of 32 bit and 64 point pipelined FFT processor is presented in this paper. This FFT processor is going to be implemented on Field Programmable Gate Array (FPGA). The aim behind this is to reduce the number of cycles required for computation. The architecture of FFT has two pipelines. Out of this one pipeline is present in execution of the complex multiplication of butterfly unit and other is present in the RAM unit. In this architecture a novel simple address mapping scheme is proposed. The twiddle factor in this architecture is not going to be stored in ROM memory, it is going to be generated and accessed directly. The Built In Self Test (BIST) provided in this is used to design such technique which test itself.
{"title":"Designing of FPGA based high performance 32 bit FFT processor with BIST","authors":"Abhijit P. Tathode, Ratnaprabha W. Jassutkar","doi":"10.1109/ICCSP.2014.6949921","DOIUrl":"https://doi.org/10.1109/ICCSP.2014.6949921","url":null,"abstract":"Designing and implementation of 32 bit and 64 point pipelined FFT processor is presented in this paper. This FFT processor is going to be implemented on Field Programmable Gate Array (FPGA). The aim behind this is to reduce the number of cycles required for computation. The architecture of FFT has two pipelines. Out of this one pipeline is present in execution of the complex multiplication of butterfly unit and other is present in the RAM unit. In this architecture a novel simple address mapping scheme is proposed. The twiddle factor in this architecture is not going to be stored in ROM memory, it is going to be generated and accessed directly. The Built In Self Test (BIST) provided in this is used to design such technique which test itself.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123049683","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 : 2014-04-03DOI: 10.1109/ICCSP.2014.6950179
S. Sairam, S. Arunmozhi
This paper presents a dual-band planar antenna with a compact radiator for 2.5/5.8-GHz wireless local area network (WLAN) applications. The antenna consists of an E-shaped and T-shaped radiating elements to generate two resonant modes for dual-band operation. The T-element fed directly by a 50 ohm micro strip line is designed to generate a frequency band at around 5.5GHz to cover the two higher bands of the WLAN system (using the IEEE 802.11a standard). The E-element is coupled-fed through the T-element and designed to generate a frequency band at 2.44GHz to cover the lower band of the WLAN system (using the 802.11b/g standards). As a result, the E- and T-elements together are very compact with a total area of only 13.75*8.4mm2. Parametric study on the key dimensions is investigated by computer simulation using ADS (ADVANCE DESIGN SYSTEM).The antenna is designed on a 40*30*0.2mm3 size with FR4 substrate. The stimulation results are measured for the return loss, radiation pattern, gain and efficiency.
{"title":"A novel dual-band E and T-shaped planar inverted antenna for WLAN applications","authors":"S. Sairam, S. Arunmozhi","doi":"10.1109/ICCSP.2014.6950179","DOIUrl":"https://doi.org/10.1109/ICCSP.2014.6950179","url":null,"abstract":"This paper presents a dual-band planar antenna with a compact radiator for 2.5/5.8-GHz wireless local area network (WLAN) applications. The antenna consists of an E-shaped and T-shaped radiating elements to generate two resonant modes for dual-band operation. The T-element fed directly by a 50 ohm micro strip line is designed to generate a frequency band at around 5.5GHz to cover the two higher bands of the WLAN system (using the IEEE 802.11a standard). The E-element is coupled-fed through the T-element and designed to generate a frequency band at 2.44GHz to cover the lower band of the WLAN system (using the 802.11b/g standards). As a result, the E- and T-elements together are very compact with a total area of only 13.75*8.4mm2. Parametric study on the key dimensions is investigated by computer simulation using ADS (ADVANCE DESIGN SYSTEM).The antenna is designed on a 40*30*0.2mm3 size with FR4 substrate. The stimulation results are measured for the return loss, radiation pattern, gain and efficiency.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127131195","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 : 2014-04-03DOI: 10.1109/ICCSP.2014.6950000
Karen Thangam Jacob, K. G. Ganesh Kumar, B. Manjurathi
Inthis paper, we propose a code based technique, Variable-to-Fixed (V-F) coding, for power efficient test data compression. The proposed scheme with the aim of achieving high compression ratio and low power consumption relies on reducing, the number of bits for representing the original test vector and the number of transitions per second. Simulation results on ISCAS'89 benchmark circuits, demonstrate that this optimization methodology helps achieve reduced test data volume than previous schemes for cases where the number of specified bits in the test set is relatively few.
{"title":"Selective compression technique using Variable-to-Fixed coding","authors":"Karen Thangam Jacob, K. G. Ganesh Kumar, B. Manjurathi","doi":"10.1109/ICCSP.2014.6950000","DOIUrl":"https://doi.org/10.1109/ICCSP.2014.6950000","url":null,"abstract":"Inthis paper, we propose a code based technique, Variable-to-Fixed (V-F) coding, for power efficient test data compression. The proposed scheme with the aim of achieving high compression ratio and low power consumption relies on reducing, the number of bits for representing the original test vector and the number of transitions per second. Simulation results on ISCAS'89 benchmark circuits, demonstrate that this optimization methodology helps achieve reduced test data volume than previous schemes for cases where the number of specified bits in the test set is relatively few.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126755893","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 : 2014-04-03DOI: 10.1109/ICCSP.2014.6950034
Susmita Koner, S. Acharyya
Edges in an image are the curves consisting of pixels wherein both side contains pixels with non-uniform intensity. Edge detection is a part of low level image processing, much needed in various fields. Though edge detection can be done by various derivative techniques but it can also be detected well using meta-heuristic approximation algorithms. Ant Colony Optimization (ACO) is such a meta-heuristic technique to solve it. In basic ACO which comprises five phases: Initialization, Construction, Updation, Decision and Visualization, we have proposed and implemented total eight variations in this paper by modifying initialization and construction phase. In the initialization phase we have given a constraint in one variant that ants will be initialized near to edge to eliminate useless construction steps and unwanted edge detection where the other variant is without this constraint which may generate unnecessary edges in the resulting image. We have taken other two variations in selecting the next pixel in the construction phase: in one Greedy method is used, in another Roulette wheel selection method is used. Apart from these, in this phase two more variations have been done depending on memory size of ants i.e. applying tabu list memory of ants and ants without memory. Hence on the basis of two types of selection method used, two types of memory size of ants and two types of initialization phase, we have implemented eight variations individually in this paper. We observe that the variant, with roulette wheel selection, incorporated with the tabu list memory of ants, and with the new initialization condition outperforms others.
{"title":"Ant colony optimization variants in image edge detection","authors":"Susmita Koner, S. Acharyya","doi":"10.1109/ICCSP.2014.6950034","DOIUrl":"https://doi.org/10.1109/ICCSP.2014.6950034","url":null,"abstract":"Edges in an image are the curves consisting of pixels wherein both side contains pixels with non-uniform intensity. Edge detection is a part of low level image processing, much needed in various fields. Though edge detection can be done by various derivative techniques but it can also be detected well using meta-heuristic approximation algorithms. Ant Colony Optimization (ACO) is such a meta-heuristic technique to solve it. In basic ACO which comprises five phases: Initialization, Construction, Updation, Decision and Visualization, we have proposed and implemented total eight variations in this paper by modifying initialization and construction phase. In the initialization phase we have given a constraint in one variant that ants will be initialized near to edge to eliminate useless construction steps and unwanted edge detection where the other variant is without this constraint which may generate unnecessary edges in the resulting image. We have taken other two variations in selecting the next pixel in the construction phase: in one Greedy method is used, in another Roulette wheel selection method is used. Apart from these, in this phase two more variations have been done depending on memory size of ants i.e. applying tabu list memory of ants and ants without memory. Hence on the basis of two types of selection method used, two types of memory size of ants and two types of initialization phase, we have implemented eight variations individually in this paper. We observe that the variant, with roulette wheel selection, incorporated with the tabu list memory of ants, and with the new initialization condition outperforms others.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122952940","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 : 2014-04-03DOI: 10.1109/ICCSP.2014.6949960
M. Geetha, R. Rakendu
With the development of low-cost 3D sensing hardware such as the Kinect, three dimensional digital images have become popular in medical diagnosis, robotics etc. One of the difficult task in image processing is image segmentation. The problem become simpler if we add the depth channel along with height and width. The proposed algorithm uses Minimum Spanning Tree (MST) for the segmentation of point cloud. As a pre processing step, first level clustering is done which gives group of cluttered objects. Each of this cluttered group is subjected to more finite level of segmentation using MST based on distance and normal. In our method, we build a weighted planar graph of each of the clustered cloud and construct the MST of the corresponding graph. By taking the advantage of normal, we can separate the surface from the object. The proposed method is applied to different 3D scenes and the results are discussed.
{"title":"An improved method for segmentation of point cloud using Minimum Spanning Tree","authors":"M. Geetha, R. Rakendu","doi":"10.1109/ICCSP.2014.6949960","DOIUrl":"https://doi.org/10.1109/ICCSP.2014.6949960","url":null,"abstract":"With the development of low-cost 3D sensing hardware such as the Kinect, three dimensional digital images have become popular in medical diagnosis, robotics etc. One of the difficult task in image processing is image segmentation. The problem become simpler if we add the depth channel along with height and width. The proposed algorithm uses Minimum Spanning Tree (MST) for the segmentation of point cloud. As a pre processing step, first level clustering is done which gives group of cluttered objects. Each of this cluttered group is subjected to more finite level of segmentation using MST based on distance and normal. In our method, we build a weighted planar graph of each of the clustered cloud and construct the MST of the corresponding graph. By taking the advantage of normal, we can separate the surface from the object. The proposed method is applied to different 3D scenes and the results are discussed.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128312948","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 : 2014-04-03DOI: 10.1109/ICCSP.2014.6949796
D. Mukherjee, D. Bhattacharjee, M. Nasipuri
Unconstrained acquisition of data from arbitrary subjects results in facial scans with significant pose variations. The challenges in 3D face recognition are into two main stages, namely preprocessing range scans for detection of fiducial detection while identifying/filling missing parts due to occlusions along with outlier noise reduction and during post-processing where actual match is done with stored models. In this work, an algorithm using HK curvature for localization of nose tip fiducial point on 3D-face image is proposed at preprocessing stage. Curvature is evaluated on 3D data following the normalization step. HK curvature classification results potential region segmentation on face and operated further with morphological enhancements. Four types of curvatures- elliptical convex, elliptical concave, hyperbolic convex and hyperbolic concave enhanced curvature profiles are being processed separately. Coarse-to-fine scale space using integral images technique is applied on the curvature images. Localization is boosted using a heuristic driven bag of templates rule. The proposed technique achieved up to 90% accurate nose-tip localization on Gavabdb and FRAV3D face database.
{"title":"Curvature based localization of nose tip point for processing 3D-face from range images","authors":"D. Mukherjee, D. Bhattacharjee, M. Nasipuri","doi":"10.1109/ICCSP.2014.6949796","DOIUrl":"https://doi.org/10.1109/ICCSP.2014.6949796","url":null,"abstract":"Unconstrained acquisition of data from arbitrary subjects results in facial scans with significant pose variations. The challenges in 3D face recognition are into two main stages, namely preprocessing range scans for detection of fiducial detection while identifying/filling missing parts due to occlusions along with outlier noise reduction and during post-processing where actual match is done with stored models. In this work, an algorithm using HK curvature for localization of nose tip fiducial point on 3D-face image is proposed at preprocessing stage. Curvature is evaluated on 3D data following the normalization step. HK curvature classification results potential region segmentation on face and operated further with morphological enhancements. Four types of curvatures- elliptical convex, elliptical concave, hyperbolic convex and hyperbolic concave enhanced curvature profiles are being processed separately. Coarse-to-fine scale space using integral images technique is applied on the curvature images. Localization is boosted using a heuristic driven bag of templates rule. The proposed technique achieved up to 90% accurate nose-tip localization on Gavabdb and FRAV3D face database.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128796808","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 : 2014-04-03DOI: 10.1109/ICCSP.2014.6950118
Arun A. Joseph, S. Prince
This paper is an attempt for a thorough appraisal of Radio over Fiber (RoF) systems. RoF system is divided into three main subsystems: Central Station (CS), Optical Fiber Network (OFN) and Base Station (BS). Each subsystem has its own functions, such as signal generation and modulation techniques at the central station, optical fiber characteristics and the detection at the base station. In this paper the merits of RoF systems have acknowledged. The radio frequency and optical modulation techniques, fiber characteristics and detection techniques are studied. The impact of technology choice is reviewed and comparison of optical modulation techniques, optical fiber and receiver are presented. There has been a significant efforts dedicated to the merging of radio frequency and optical fiber technologies targeting the distribution of radio wave signals, in the recent years. The domain of Radio over Fiber (RoF) technologies and systems took birth from these endeavors. This kind of systems promises a secure, cost-effective, and high-capacity mobile and wireless access for the prospect facilitation of broadband, interactive, and multimedia wireless services.
{"title":"Performance analysis and optimization of radio over fiber link","authors":"Arun A. Joseph, S. Prince","doi":"10.1109/ICCSP.2014.6950118","DOIUrl":"https://doi.org/10.1109/ICCSP.2014.6950118","url":null,"abstract":"This paper is an attempt for a thorough appraisal of Radio over Fiber (RoF) systems. RoF system is divided into three main subsystems: Central Station (CS), Optical Fiber Network (OFN) and Base Station (BS). Each subsystem has its own functions, such as signal generation and modulation techniques at the central station, optical fiber characteristics and the detection at the base station. In this paper the merits of RoF systems have acknowledged. The radio frequency and optical modulation techniques, fiber characteristics and detection techniques are studied. The impact of technology choice is reviewed and comparison of optical modulation techniques, optical fiber and receiver are presented. There has been a significant efforts dedicated to the merging of radio frequency and optical fiber technologies targeting the distribution of radio wave signals, in the recent years. The domain of Radio over Fiber (RoF) technologies and systems took birth from these endeavors. This kind of systems promises a secure, cost-effective, and high-capacity mobile and wireless access for the prospect facilitation of broadband, interactive, and multimedia wireless services.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128291472","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
扫码关注我们
求助内容：
应助结果提醒方式：