Pub Date : 2008-12-01DOI: 10.1109/ICIINFS.2008.4798479
V. Mummadi
A boost converter based maximum power point tracking for the non-linear photovoltaic sources is proposed in this paper. As the v-i characteristic of the photovoltaic (PV) source exhibiting non-linear variation with solar insolation continuous tracking of maximum power is mandatory in order to have high overall conversion efficiency. As the tracking time depends on the type of methodology employed, optimized perturbation quantity must be used, otherwise power tracking takes long time resulting in sub-optimal operation of the PV system. In this paper a variable incremental duty ratio algorithm is proposed to reduce the tracking time and to improve the tracking performance. In this algorithm the duty ratio is high at beginning of the disturbance and it follows a geometric progression in the subsequent iterations. Proposed concept is verified experimentally and also compared with the conventional perturb and observation method.
{"title":"Maximum Power Point Tracking Algorithm For Non-Linear DC Sources","authors":"V. Mummadi","doi":"10.1109/ICIINFS.2008.4798479","DOIUrl":"https://doi.org/10.1109/ICIINFS.2008.4798479","url":null,"abstract":"A boost converter based maximum power point tracking for the non-linear photovoltaic sources is proposed in this paper. As the v-i characteristic of the photovoltaic (PV) source exhibiting non-linear variation with solar insolation continuous tracking of maximum power is mandatory in order to have high overall conversion efficiency. As the tracking time depends on the type of methodology employed, optimized perturbation quantity must be used, otherwise power tracking takes long time resulting in sub-optimal operation of the PV system. In this paper a variable incremental duty ratio algorithm is proposed to reduce the tracking time and to improve the tracking performance. In this algorithm the duty ratio is high at beginning of the disturbance and it follows a geometric progression in the subsequent iterations. Proposed concept is verified experimentally and also compared with the conventional perturb and observation method.","PeriodicalId":429889,"journal":{"name":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127233554","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 : 2008-12-01DOI: 10.1109/ICIINFS.2008.4798488
T. De, Puneet Jain, A. Pal, I. Sengupta
In the wavelength division multiplexing (WDM) optical networks, user's requirement is much less (in Mbps range) than the capacity of a wavelength channel (in Gbps range) and number of wavelength channels is limited in a fiber due to several constraints. Each wavelength channel between end nodes requires a pair of transmitter and receiver for digital to optical conversion. In order to decrease the cost of network resources (bandwidth, transceivers, etc.), it has become necessary to groom or multiplex traffic request efficiently over the given network topology. Most of work found in the literatures focus on single objective either maximize throughput or minimize transceivers or delay. In this study, we have presented a multi objective evolutionary algorithm (MOEA) based approach which is capable of optimizing multiple objectives i. e. throughput, transceiver requirement and intermediate propagation delay simultaneously. The performance of our approach has been evaluated through extensive simulation on different sets of traffic demands with different bandwidth granularities under various network topologies. The efficacy of our proposed approach has been established by comparing its performance with respect to existing algorithms.
{"title":"A Multi Objective Evolutionary Algorithm Based Approach for Traffic Grooming, Routing and Wavelength Assignment in Optical WDM Networks","authors":"T. De, Puneet Jain, A. Pal, I. Sengupta","doi":"10.1109/ICIINFS.2008.4798488","DOIUrl":"https://doi.org/10.1109/ICIINFS.2008.4798488","url":null,"abstract":"In the wavelength division multiplexing (WDM) optical networks, user's requirement is much less (in Mbps range) than the capacity of a wavelength channel (in Gbps range) and number of wavelength channels is limited in a fiber due to several constraints. Each wavelength channel between end nodes requires a pair of transmitter and receiver for digital to optical conversion. In order to decrease the cost of network resources (bandwidth, transceivers, etc.), it has become necessary to groom or multiplex traffic request efficiently over the given network topology. Most of work found in the literatures focus on single objective either maximize throughput or minimize transceivers or delay. In this study, we have presented a multi objective evolutionary algorithm (MOEA) based approach which is capable of optimizing multiple objectives i. e. throughput, transceiver requirement and intermediate propagation delay simultaneously. The performance of our approach has been evaluated through extensive simulation on different sets of traffic demands with different bandwidth granularities under various network topologies. The efficacy of our proposed approach has been established by comparing its performance with respect to existing algorithms.","PeriodicalId":429889,"journal":{"name":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123778590","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 : 2008-12-01DOI: 10.1109/ICIINFS.2008.4798408
P. Pathak, R. Merzouki, A. Samantaray, B. O. Bouamama
This article concerns reconfiguration of an autonomous vehicle, called RobuCar, with four independently driven wheels and two independently adjustable steering angles. A bond graph model of the system is constructed for generating the Analytical Redundancy Relations (ARRs) which are evaluated with actual measurements to generate residuals and to perform structural fault isolation. Once the fault list is updated in the equipment availability database, an automaton selects the next best option to reconfigure the system such that the given control objectives are achieved. The developed methodology is validated by considering two different fault scenarios.
{"title":"Reconfiguration of Directional Handling of an Autonomous Vehicle","authors":"P. Pathak, R. Merzouki, A. Samantaray, B. O. Bouamama","doi":"10.1109/ICIINFS.2008.4798408","DOIUrl":"https://doi.org/10.1109/ICIINFS.2008.4798408","url":null,"abstract":"This article concerns reconfiguration of an autonomous vehicle, called RobuCar, with four independently driven wheels and two independently adjustable steering angles. A bond graph model of the system is constructed for generating the Analytical Redundancy Relations (ARRs) which are evaluated with actual measurements to generate residuals and to perform structural fault isolation. Once the fault list is updated in the equipment availability database, an automaton selects the next best option to reconfigure the system such that the given control objectives are achieved. The developed methodology is validated by considering two different fault scenarios.","PeriodicalId":429889,"journal":{"name":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126391515","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 : 2008-12-01DOI: 10.1109/ICIINFS.2008.4798382
S. Sameer, Ratnam V. Raja Kumar
We propose a null subcarrier based carrier frequency offset (CFO) estimation technique for the uplink orthogonal frequency division multiple access (OFDMA) communication system. Here each user may experience a different CFO relative to the base station. This results in a multiple parameter estimation problem. The estimation is done by minimizing a cost function that computes the energy in null subcarrier locations due to the impact of frequency offset. The computational complexity and training overhead of the proposed technique are much lower as compared to some of the existing schemes in the literature. The mean square error of the CFO estimator and bit error rate performance of the OFDMA receiver that employs the proposed estimation scheme are studied through computer simulations. Our algorithm is shown to achieve a comparable performance as that of a recently reported method but with a much lower computational complexity and bandwidth overhead.
{"title":"An Efficient Maximum Likelihood CFO Estimation Technique for OFDMA Uplink Transmissions","authors":"S. Sameer, Ratnam V. Raja Kumar","doi":"10.1109/ICIINFS.2008.4798382","DOIUrl":"https://doi.org/10.1109/ICIINFS.2008.4798382","url":null,"abstract":"We propose a null subcarrier based carrier frequency offset (CFO) estimation technique for the uplink orthogonal frequency division multiple access (OFDMA) communication system. Here each user may experience a different CFO relative to the base station. This results in a multiple parameter estimation problem. The estimation is done by minimizing a cost function that computes the energy in null subcarrier locations due to the impact of frequency offset. The computational complexity and training overhead of the proposed technique are much lower as compared to some of the existing schemes in the literature. The mean square error of the CFO estimator and bit error rate performance of the OFDMA receiver that employs the proposed estimation scheme are studied through computer simulations. Our algorithm is shown to achieve a comparable performance as that of a recently reported method but with a much lower computational complexity and bandwidth overhead.","PeriodicalId":429889,"journal":{"name":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121506569","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 : 2008-12-01DOI: 10.1109/ICIINFS.2008.4798481
S. R. K. Vadali, S. Chakrabarti, R. V. Rajakumar
Selected Mapping (SLM) is a well known distortionless phase control Peak-to-Average-Power-Ratio (PAPR) reduction technique for Orthogonal Frequency Division Multiplexing (OFDM) systems. A major limitation of SLM-OFDM systems is that the receiver requires exact information of the phase set used at the transmitter. Usually side information (SI) is either transmitted explicitly at the loss of data rate or avoided using Blind SLM (BSLM) techniques at the expense of computational complexity. In the present work we investigate four SLM based PAPR reduction techniques and propose a new technique for pilot based SLM-OFDM systems which avoids the requirement of SI with low complexity. The proposed scheme involves cyclic shifting of pilots for each of the independent mapping in SLM systems. We compute a minimum distance vector at the receiver to detect the exact phase set used in the transmitter and avoid explicit transmission of SI. Bit Error Rate (BER) performance of the proposed scheme is evaluated in AWGN channels.
{"title":"A Low Complexity PAPR Reduction Scheme without Side Information for Pilot Assisted OFDM Systems","authors":"S. R. K. Vadali, S. Chakrabarti, R. V. Rajakumar","doi":"10.1109/ICIINFS.2008.4798481","DOIUrl":"https://doi.org/10.1109/ICIINFS.2008.4798481","url":null,"abstract":"Selected Mapping (SLM) is a well known distortionless phase control Peak-to-Average-Power-Ratio (PAPR) reduction technique for Orthogonal Frequency Division Multiplexing (OFDM) systems. A major limitation of SLM-OFDM systems is that the receiver requires exact information of the phase set used at the transmitter. Usually side information (SI) is either transmitted explicitly at the loss of data rate or avoided using Blind SLM (BSLM) techniques at the expense of computational complexity. In the present work we investigate four SLM based PAPR reduction techniques and propose a new technique for pilot based SLM-OFDM systems which avoids the requirement of SI with low complexity. The proposed scheme involves cyclic shifting of pilots for each of the independent mapping in SLM systems. We compute a minimum distance vector at the receiver to detect the exact phase set used in the transmitter and avoid explicit transmission of SI. Bit Error Rate (BER) performance of the proposed scheme is evaluated in AWGN channels.","PeriodicalId":429889,"journal":{"name":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133690650","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 : 2008-12-01DOI: 10.1109/ICIINFS.2008.4798475
Srimathi Mathialagan, S. Shanmugavel
Transmission of video summary frames through wireless networks needs higher bandwidth with less delay and distortion constraints as continuous media playback is necessary at the receiver. So the joint optimization of application layer with lower layers is necessary to meet certain QoS requirements. In this paper, we propose a Cross-layer design approach that jointly optimizes the physical layer, data link layer and application layer for the transmission of video summary frames through wireless networks based on MIMO transmit/receive diversity with AMC at the physical layer and ARQ at the data link layer and source coding at the application layer. We model the finite-state Markov chain(FSMC) for the physical layer service and based on that, we then characterize the Lagrangian relaxation and Dynamic programming to find the optimal shortest path. The source coding as well as retransmission requests are based on the channel-state information (CSI) and the system controller is implemented in all the three physical, data-link and application layers. The numerical results revealed that our proposed cross-layer model with MIMO diversity schemes can efficiently achieve the distortion gain with same delay budget.
{"title":"A Cross-Layer Design Approach using MIMO System for Wireless Networks","authors":"Srimathi Mathialagan, S. Shanmugavel","doi":"10.1109/ICIINFS.2008.4798475","DOIUrl":"https://doi.org/10.1109/ICIINFS.2008.4798475","url":null,"abstract":"Transmission of video summary frames through wireless networks needs higher bandwidth with less delay and distortion constraints as continuous media playback is necessary at the receiver. So the joint optimization of application layer with lower layers is necessary to meet certain QoS requirements. In this paper, we propose a Cross-layer design approach that jointly optimizes the physical layer, data link layer and application layer for the transmission of video summary frames through wireless networks based on MIMO transmit/receive diversity with AMC at the physical layer and ARQ at the data link layer and source coding at the application layer. We model the finite-state Markov chain(FSMC) for the physical layer service and based on that, we then characterize the Lagrangian relaxation and Dynamic programming to find the optimal shortest path. The source coding as well as retransmission requests are based on the channel-state information (CSI) and the system controller is implemented in all the three physical, data-link and application layers. The numerical results revealed that our proposed cross-layer model with MIMO diversity schemes can efficiently achieve the distortion gain with same delay budget.","PeriodicalId":429889,"journal":{"name":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122232427","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 : 2008-12-01DOI: 10.1109/ICIINFS.2008.4798439
Sowmyanarayanan Krishnakumar, S. Hoole
First order optimization methods, while being powerful and rapidly convergent, suffer from the fact that as the descriptive geometric parameters change from iteration to iteration, corresponding to these new geometries, new meshes need to be implemented. Correspondingly the new topologies of the meshes introduce non-physical jumps in the object function. These jumps are seen as physical minima by the optimization algorithm and slow down and even prevent the identification of the true global minimum. Different starting points have been used with some amelioration but there has been no satisfactory solution to this problem. To overcome this problem, a special mesh generator has been introduced earlier. This generator allows us to move a node which is tied directly to a parameter without changing connectivity of nodes in the mesh topology. This procedure yields C1 continuity of the object functions. Thus, gradient optimization methods can be efficiently used for shape optimization problems. In this paper, the scheme is implemented optimizing the shape of magnetic pole contour with important implications for the problem and the accuracy of its solutions.
{"title":"Optimizing Shape Design of Magnetic Pole Contour using a Special Mesh Generator","authors":"Sowmyanarayanan Krishnakumar, S. Hoole","doi":"10.1109/ICIINFS.2008.4798439","DOIUrl":"https://doi.org/10.1109/ICIINFS.2008.4798439","url":null,"abstract":"First order optimization methods, while being powerful and rapidly convergent, suffer from the fact that as the descriptive geometric parameters change from iteration to iteration, corresponding to these new geometries, new meshes need to be implemented. Correspondingly the new topologies of the meshes introduce non-physical jumps in the object function. These jumps are seen as physical minima by the optimization algorithm and slow down and even prevent the identification of the true global minimum. Different starting points have been used with some amelioration but there has been no satisfactory solution to this problem. To overcome this problem, a special mesh generator has been introduced earlier. This generator allows us to move a node which is tied directly to a parameter without changing connectivity of nodes in the mesh topology. This procedure yields C1 continuity of the object functions. Thus, gradient optimization methods can be efficiently used for shape optimization problems. In this paper, the scheme is implemented optimizing the shape of magnetic pole contour with important implications for the problem and the accuracy of its solutions.","PeriodicalId":429889,"journal":{"name":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130485116","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 : 2008-12-01DOI: 10.1109/ICIINFS.2008.4798399
R. Kar, A. Chattaraj, A. Chandra, A. K. Mal, A. Bhattacharjee
In deep sub-micrometer (DSM) regime the on-chip interconnect delay is significantly more dominating than the gate delay. Several approaches have been proposed to capture the interconnect delay accurately and efficiently. By interpreting the impulse response of a linear circuit as a probability distribution function (PDF), Elmore first estimated the interconnect delay. Several other approaches like PRIMO, AWE, h-Gamma, WED, D2M etc. have been reported so far, which are shown to be more accurate delay estimation compared to Elmore delay metric. But they suffer from computational complexity when using in the total IC design processes. Our work presents a closed form formula for interconnect delay. The delay metric is derived by matching circuit moments to the Weibull distribution. The delay metric can be easily implemented for both step and ramp inputs by using a single look-up table. Experiments validate the effectiveness of the delay metric for nets from a real industrial design.
{"title":"Delay Estimation for On-Chip VLSI Interconnect using Weibull Distribution Function","authors":"R. Kar, A. Chattaraj, A. Chandra, A. K. Mal, A. Bhattacharjee","doi":"10.1109/ICIINFS.2008.4798399","DOIUrl":"https://doi.org/10.1109/ICIINFS.2008.4798399","url":null,"abstract":"In deep sub-micrometer (DSM) regime the on-chip interconnect delay is significantly more dominating than the gate delay. Several approaches have been proposed to capture the interconnect delay accurately and efficiently. By interpreting the impulse response of a linear circuit as a probability distribution function (PDF), Elmore first estimated the interconnect delay. Several other approaches like PRIMO, AWE, h-Gamma, WED, D2M etc. have been reported so far, which are shown to be more accurate delay estimation compared to Elmore delay metric. But they suffer from computational complexity when using in the total IC design processes. Our work presents a closed form formula for interconnect delay. The delay metric is derived by matching circuit moments to the Weibull distribution. The delay metric can be easily implemented for both step and ramp inputs by using a single look-up table. Experiments validate the effectiveness of the delay metric for nets from a real industrial design.","PeriodicalId":429889,"journal":{"name":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132377003","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 : 2008-12-01DOI: 10.1109/ICIINFS.2008.4798397
Parul Shah, P. Choudhari, Suresh Sivaraman
In this paper we present a novel method for digital audio steganography where encrypted covert data is embedded by adaptively modifying wavelet packet coefficients of host audio signal. The major contribution of the proposed scheme is the technique introduced for adaptively modifying the host audio to embed the covert data. The modification of host audio is done by imposing a constraint which forces the modified value to be in the same range as its neighborhood. Due to this constraint the noise introduced due to embedding is very low compared to existing methods. The main advantage with proposed embedding scheme is superior Signal to Noise Ratio (SNR) values, with good hiding capacity and speed. Listening test results also show that distortions in the stego audio is imperceptible from the original audio even with highest hiding capacity. Our method also has zero bit error in recovered data which is one of the most desired features of any steganography technique.
{"title":"Adaptive Wavelet Packet Based Audio Steganography using Data History","authors":"Parul Shah, P. Choudhari, Suresh Sivaraman","doi":"10.1109/ICIINFS.2008.4798397","DOIUrl":"https://doi.org/10.1109/ICIINFS.2008.4798397","url":null,"abstract":"In this paper we present a novel method for digital audio steganography where encrypted covert data is embedded by adaptively modifying wavelet packet coefficients of host audio signal. The major contribution of the proposed scheme is the technique introduced for adaptively modifying the host audio to embed the covert data. The modification of host audio is done by imposing a constraint which forces the modified value to be in the same range as its neighborhood. Due to this constraint the noise introduced due to embedding is very low compared to existing methods. The main advantage with proposed embedding scheme is superior Signal to Noise Ratio (SNR) values, with good hiding capacity and speed. Listening test results also show that distortions in the stego audio is imperceptible from the original audio even with highest hiding capacity. Our method also has zero bit error in recovered data which is one of the most desired features of any steganography technique.","PeriodicalId":429889,"journal":{"name":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134191950","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 : 2008-12-01DOI: 10.1109/ICIINFS.2008.4798374
V. Rishiwal, H. Kumar, K. Arya, M. Yadav
Secret sharing is an efficient method of transmitting the image securely. This paper discusses an efficient secret sharing scheme for multiple secret images. It has been shown through the experimental result that the proposed scheme transmits the images secretly and then efficiently recovers the same at the receiver end. This scheme is general in nature and can be applied on any image size. The scheme comprises of the important algorithms namely share generation algorithm and combination algorithm. The share generation algorithm generates the shares of secret multiple images and the combination algorithm combines the specified shares to get the secret images within a very short time and provide high level of security.
{"title":"Multiple Secret Images Sharing Scheme","authors":"V. Rishiwal, H. Kumar, K. Arya, M. Yadav","doi":"10.1109/ICIINFS.2008.4798374","DOIUrl":"https://doi.org/10.1109/ICIINFS.2008.4798374","url":null,"abstract":"Secret sharing is an efficient method of transmitting the image securely. This paper discusses an efficient secret sharing scheme for multiple secret images. It has been shown through the experimental result that the proposed scheme transmits the images secretly and then efficiently recovers the same at the receiver end. This scheme is general in nature and can be applied on any image size. The scheme comprises of the important algorithms namely share generation algorithm and combination algorithm. The share generation algorithm generates the shares of secret multiple images and the combination algorithm combines the specified shares to get the secret images within a very short time and provide high level of security.","PeriodicalId":429889,"journal":{"name":"2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134250925","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
扫码关注我们
求助内容：
应助结果提醒方式：