Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350706
A. Tripathy, S. S. Pathak, Soumen Chakrabarti
The soft output Viterbi algorithm (SOVA) is used for data detection in indoor wireless channels representative of the JTC and wireless local area network (WLAN). The performance of SOVA-SOVA permutation as an equalizer followed by a decoder is evaluated by simulation experiment. The performance does not improve much for more than three iterations in these ISI channels. The results obtained for 1 dB to 4 dB bit energy to noise power approach the coded AWGN performance by the end of the third iteration
{"title":"SOVA-Based Turbo Equalization and Decoding for Indoor Wireless Channels","authors":"A. Tripathy, S. S. Pathak, Soumen Chakrabarti","doi":"10.1109/ICSCN.2007.350706","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350706","url":null,"abstract":"The soft output Viterbi algorithm (SOVA) is used for data detection in indoor wireless channels representative of the JTC and wireless local area network (WLAN). The performance of SOVA-SOVA permutation as an equalizer followed by a decoder is evaluated by simulation experiment. The performance does not improve much for more than three iterations in these ISI channels. The results obtained for 1 dB to 4 dB bit energy to noise power approach the coded AWGN performance by the end of the third iteration","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129554568","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 : 2007-11-05DOI: 10.1109/ICSCN.2007.350669
A. T. Kalghatgi
Ultra wide band (UWB) is one of the key emerging short-range wireless technology that can answer many of the problems faced by narrow band technologies. UWB offers all the advantages of spread spectrum including GHz of RF bandwidth and high data rate. UWB signals are virtually undetectable operating at noise like low power levels. UWB offers very fine range resolution and also immune to multipath fading. Conventionally UWB is defined as carrier free, impulse based radio, which communicates in time domain by only using sharp rising pulses of the order of fraction of nano seconds. In this paper challenges in the design and development of impulse radio based ultra wide band transceiver is explained. Antennas that work in time domain, UWB impulses that meet the required FCC mask on EIRP and digitizer that has to sample and process at the rate of Gigasamples per second are some of the key challenges
{"title":"Challenges in the Design of an Impulse Radio Based Ultra Wide Band Transceiver","authors":"A. T. Kalghatgi","doi":"10.1109/ICSCN.2007.350669","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350669","url":null,"abstract":"Ultra wide band (UWB) is one of the key emerging short-range wireless technology that can answer many of the problems faced by narrow band technologies. UWB offers all the advantages of spread spectrum including GHz of RF bandwidth and high data rate. UWB signals are virtually undetectable operating at noise like low power levels. UWB offers very fine range resolution and also immune to multipath fading. Conventionally UWB is defined as carrier free, impulse based radio, which communicates in time domain by only using sharp rising pulses of the order of fraction of nano seconds. In this paper challenges in the design and development of impulse radio based ultra wide band transceiver is explained. Antennas that work in time domain, UWB impulses that meet the required FCC mask on EIRP and digitizer that has to sample and process at the rate of Gigasamples per second are some of the key challenges","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121851978","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 : 2007-11-05DOI: 10.1109/ICSCN.2007.350745
M. Manikandan, A. Saravanan, K. Bagan
Curvelet transform is one of the recently developed multiscale transform, which possess directional features and provides optimally sparse representation of objects with edges. In this paper an algorithm for lossy image compression based on the second generation digital curvelet transform is proposed. The results are compared with the results obtained from wavelet based image compression methods. Compression ratio and PSNR are selected as the performance metrics,and it is shown that curvelet transform require fewer coefficients than wavelet transform to represent an image faithfully
{"title":"Curvelet Transform Based Embedded Lossy Image Compression","authors":"M. Manikandan, A. Saravanan, K. Bagan","doi":"10.1109/ICSCN.2007.350745","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350745","url":null,"abstract":"Curvelet transform is one of the recently developed multiscale transform, which possess directional features and provides optimally sparse representation of objects with edges. In this paper an algorithm for lossy image compression based on the second generation digital curvelet transform is proposed. The results are compared with the results obtained from wavelet based image compression methods. Compression ratio and PSNR are selected as the performance metrics,and it is shown that curvelet transform require fewer coefficients than wavelet transform to represent an image faithfully","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"116 1-4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120889912","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 : 2007-11-05DOI: 10.1109/ICSCN.2007.350743
D.U. Perumal, Shylendra Kumar, S. Prasanth, P. Kumar, M. Kannan, V. Vaidehi
This paper describes the development of a novel image compression architecture on runtime reconfigurable FPGAs. The partially reconfigurable discrete cosine transform architecture (PRDCT) is implemented by creating a difference bit stream between two possible architectures using flexible multiplier and accumulator (MAC) units. The non-reconfigurable modules make use of a multiplexed bus system to communicate with the reconfigurable modules. This scheme helps the user achieve significant reduction in area and power during run-time
{"title":"An Efficient Reconfigurable Image Compression Architecture","authors":"D.U. Perumal, Shylendra Kumar, S. Prasanth, P. Kumar, M. Kannan, V. Vaidehi","doi":"10.1109/ICSCN.2007.350743","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350743","url":null,"abstract":"This paper describes the development of a novel image compression architecture on runtime reconfigurable FPGAs. The partially reconfigurable discrete cosine transform architecture (PRDCT) is implemented by creating a difference bit stream between two possible architectures using flexible multiplier and accumulator (MAC) units. The non-reconfigurable modules make use of a multiplexed bus system to communicate with the reconfigurable modules. This scheme helps the user achieve significant reduction in area and power during run-time","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127536672","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 : 2007-11-05DOI: 10.1109/ICSCN.2007.350699
K. Raja, S. Siddaraju, K. Venugopal, L. Patnaik
The steganography is the embedding of secret message in the cover image for covert communication. In this paper we present a high capacity data embedding using colour palette decomposition (CPD) in which the payload is embedded into the cover image as an index of shifted centroids which is derived from the clustering of the cover image to derive the stego image. The error control coding is applied to stego image to increase PSNR, capacity and security. It is observed that our algorithm has higher PSNR and capacity in comparison to earlier works
{"title":"Secure Steganography using Colour Palette Decomposition","authors":"K. Raja, S. Siddaraju, K. Venugopal, L. Patnaik","doi":"10.1109/ICSCN.2007.350699","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350699","url":null,"abstract":"The steganography is the embedding of secret message in the cover image for covert communication. In this paper we present a high capacity data embedding using colour palette decomposition (CPD) in which the payload is embedded into the cover image as an index of shifted centroids which is derived from the clustering of the cover image to derive the stego image. The error control coding is applied to stego image to increase PSNR, capacity and security. It is observed that our algorithm has higher PSNR and capacity in comparison to earlier works","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132635054","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 : 2007-11-05DOI: 10.1109/ICSCN.2007.350736
J. Amutharaj, S. Radhakrishnan
Overlay networks have emerged as a powerful and highly flexible method of delivering content. An overlay network is a network running on top of another network, usually the Internet. These networks are employed in many settings to provide logical communication infrastructure over an existing communication network. The main objective of the overlay network is to reduce routing path lengths, stretched by the overlay routing process. In most solutions developed, a kind of fixed infrastructure in the form of excessive message exchange is necessary to guarantee good overlay locality properties. This paper presents a richly connected overlay networks based on Dominating Set Theory to optimize the number of nodes for large data transfer. Fast Replica algorithm is applied to reduce the content transfer time for replicating the content within the semantic network. To download a file from different peers in parallel from the semantic overlay network (SON) a dynamic parallel access scheme is introduced where end users access the members of the SON at the same time, fetching different portions of that file from different peers and reassembling them locally. The load is dynamically shared among all the peers. An enhanced digital fountain with Tornado codes is applied to eliminate the need for retransmission requests from the end users. Receivers run the decoding algorithm to reconstruct the original content. In this no feedback mechanisms are needed to ensure reliable delivery. This paper analyzes the performance of sequential unicast and multiple unicast content distribution strategies and compares their performance with our scheme and also analyzes the impact of dominating set theory for the construction of semantic overlays
{"title":"Dominating Set Theory Based Semantic Overlay Networks for Efficient Content Distribution","authors":"J. Amutharaj, S. Radhakrishnan","doi":"10.1109/ICSCN.2007.350736","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350736","url":null,"abstract":"Overlay networks have emerged as a powerful and highly flexible method of delivering content. An overlay network is a network running on top of another network, usually the Internet. These networks are employed in many settings to provide logical communication infrastructure over an existing communication network. The main objective of the overlay network is to reduce routing path lengths, stretched by the overlay routing process. In most solutions developed, a kind of fixed infrastructure in the form of excessive message exchange is necessary to guarantee good overlay locality properties. This paper presents a richly connected overlay networks based on Dominating Set Theory to optimize the number of nodes for large data transfer. Fast Replica algorithm is applied to reduce the content transfer time for replicating the content within the semantic network. To download a file from different peers in parallel from the semantic overlay network (SON) a dynamic parallel access scheme is introduced where end users access the members of the SON at the same time, fetching different portions of that file from different peers and reassembling them locally. The load is dynamically shared among all the peers. An enhanced digital fountain with Tornado codes is applied to eliminate the need for retransmission requests from the end users. Receivers run the decoding algorithm to reconstruct the original content. In this no feedback mechanisms are needed to ensure reliable delivery. This paper analyzes the performance of sequential unicast and multiple unicast content distribution strategies and compares their performance with our scheme and also analyzes the impact of dominating set theory for the construction of semantic overlays","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132544300","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 : 2007-11-05DOI: 10.1109/ICSCN.2007.350679
E. Logashanmugam, B. Sreejaa, R. Ramachandran
In this paper we propose applying an adaptive context tree weighting method with a forbidden symbol in the H.264 coder. Arithmetic codes with a forbidden symbol and a trellis search techniques are employed on an order to estimate the best transmitted codeword. Instead of using the context modeling defined in the H.264 standard, the arithmetic code with a forbidden symbol uses a CTW method. The CABAC algorithm is replaced by GRASP algorithm and the experimental results show that coding gains similar or superior to those obtained with the H.264/AVC CABAC algorithm and arithmetic coding
{"title":"Arithmetic Coding with Forbidden Symbol and Optimized Adaptive Context Tree Modeling (GRASP Algorithm) for H.264 Video Coders","authors":"E. Logashanmugam, B. Sreejaa, R. Ramachandran","doi":"10.1109/ICSCN.2007.350679","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350679","url":null,"abstract":"In this paper we propose applying an adaptive context tree weighting method with a forbidden symbol in the H.264 coder. Arithmetic codes with a forbidden symbol and a trellis search techniques are employed on an order to estimate the best transmitted codeword. Instead of using the context modeling defined in the H.264 standard, the arithmetic code with a forbidden symbol uses a CTW method. The CABAC algorithm is replaced by GRASP algorithm and the experimental results show that coding gains similar or superior to those obtained with the H.264/AVC CABAC algorithm and arithmetic coding","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133356298","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 : 2007-11-05DOI: 10.1109/ICSCN.2007.350784
R.L. Qureshi, Jean-Yves Ramel, H. Cardot, P. Mukherji
In this article, we have tried to explore a new hybrid approach which well integrates the advantages of structural and statistical approaches and avoids their weaknesses. In the proposed approach, the graphic symbols are first segmented into high-level primitive like quadrilaterals. Then, a graph is built by utilizing these quadrilaterals as nodes and their spatial relationships as edges. Additional information like relative length of the quadrilaterals and their relative angles with neighbouring quadrilaterals are associated as attributes to the nodes and edges of the graph respectively. However, the observed graphs are subject to deformations due to noise and/or vectorial distortion (in case of hand-drawn images) hence differs somewhat from their ideal models by either missing or extra nodes and edges appearance. Therefore, we propose a method that computes a measure of similarity between two given graphs instead of looking for exact isomorphism. The approach is based on comparing feature vectors extracted from the graphs. The idea is to use features that can be quickly computed from a graph on the one hand, but are, on the other hand, effective in discriminating between the various graphs in the database. The nearest neighbour rule is used as a classifier due to its simplicity and good behaviour
{"title":"Combination of Symbolic and Statistical Features for Symbols Recognition","authors":"R.L. Qureshi, Jean-Yves Ramel, H. Cardot, P. Mukherji","doi":"10.1109/ICSCN.2007.350784","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350784","url":null,"abstract":"In this article, we have tried to explore a new hybrid approach which well integrates the advantages of structural and statistical approaches and avoids their weaknesses. In the proposed approach, the graphic symbols are first segmented into high-level primitive like quadrilaterals. Then, a graph is built by utilizing these quadrilaterals as nodes and their spatial relationships as edges. Additional information like relative length of the quadrilaterals and their relative angles with neighbouring quadrilaterals are associated as attributes to the nodes and edges of the graph respectively. However, the observed graphs are subject to deformations due to noise and/or vectorial distortion (in case of hand-drawn images) hence differs somewhat from their ideal models by either missing or extra nodes and edges appearance. Therefore, we propose a method that computes a measure of similarity between two given graphs instead of looking for exact isomorphism. The approach is based on comparing feature vectors extracted from the graphs. The idea is to use features that can be quickly computed from a graph on the one hand, but are, on the other hand, effective in discriminating between the various graphs in the database. The nearest neighbour rule is used as a classifier due to its simplicity and good behaviour","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121351774","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 : 2007-11-05DOI: 10.1109/ICSCN.2007.350666
G. Lavanya, R. Parimalam, J. Uma Maheswari
Ad hoc mobile networks are very dynamic, self organizing, self healing distributed networks which supports data networking without an infrastructure. The user can use the network services efficiently and securely while moving, by using our proposed scheme. This technique is used to store backup routes from multiple routes available between source and destination. Furthermore, it also supports heterogeneous interfaces between the nodes with a secured data transmission using voice
{"title":"Secured Data Transmission in Adhoc Networks Supporting Heterogeneous Interfaces","authors":"G. Lavanya, R. Parimalam, J. Uma Maheswari","doi":"10.1109/ICSCN.2007.350666","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350666","url":null,"abstract":"Ad hoc mobile networks are very dynamic, self organizing, self healing distributed networks which supports data networking without an infrastructure. The user can use the network services efficiently and securely while moving, by using our proposed scheme. This technique is used to store backup routes from multiple routes available between source and destination. Furthermore, it also supports heterogeneous interfaces between the nodes with a secured data transmission using voice","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129369039","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 : 2007-11-05DOI: 10.1109/ICSCN.2007.350705
K. Sudha, R. Rao
Frequency-hopped (FH) CDMA is a digital multiple access system in which individual users selects one of Q frequencies within a wideband channel as carrier frequency. Main drawback of FH CDMA is, it is interference limited. In this paper we analyze the performance of frequency-hopped spread spectrum networks (FHSS) with turbo block codes. After the development of turbo code, using block component codes have received less attention. Block component codes are particularly suited for high rate applications with short block lengths and allow high degree of parallel processing which is desirable for delay sensitive applications. Rate compatible coding is appropriate for communication systems that experience a range of operating SNRs but seek to adhere to a single under laying codec structure. This paper suggests the performance improvement of FH SS signals by using rate compatible parallel-concatenated block codes using BCH (Bose, Chaudhuri, Hocquenghem) codes as component codes and usage of puncturing for making it rate compatible. These codes enjoy more freedom in puncturing pattern selection thus allowing for an almost continuous spectrum of code rates
{"title":"Performance Improvement of FH CDMA Signals using Rate Compatible Parallel Concatenated Block Codes","authors":"K. Sudha, R. Rao","doi":"10.1109/ICSCN.2007.350705","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350705","url":null,"abstract":"Frequency-hopped (FH) CDMA is a digital multiple access system in which individual users selects one of Q frequencies within a wideband channel as carrier frequency. Main drawback of FH CDMA is, it is interference limited. In this paper we analyze the performance of frequency-hopped spread spectrum networks (FHSS) with turbo block codes. After the development of turbo code, using block component codes have received less attention. Block component codes are particularly suited for high rate applications with short block lengths and allow high degree of parallel processing which is desirable for delay sensitive applications. Rate compatible coding is appropriate for communication systems that experience a range of operating SNRs but seek to adhere to a single under laying codec structure. This paper suggests the performance improvement of FH SS signals by using rate compatible parallel-concatenated block codes using BCH (Bose, Chaudhuri, Hocquenghem) codes as component codes and usage of puncturing for making it rate compatible. These codes enjoy more freedom in puncturing pattern selection thus allowing for an almost continuous spectrum of code rates","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129056505","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
扫码关注我们
求助内容：
应助结果提醒方式：