2007 International Conference on Signal Processing, Communications and Networking最新文献_第4页

SOVA-Based Turbo Equalization and Decoding for Indoor Wireless Channels 基于sova的室内无线信道Turbo均衡与解码

2007 International Conference on Signal Processing, Communications and Networking Pub Date : 2007-11-05 DOI: 10.1109/ICSCN.2007.350706

A. Tripathy, S. S. Pathak, Soumen Chakrabarti

引用次数: 0

Challenges in the Design of an Impulse Radio Based Ultra Wide Band Transceiver 基于脉冲无线电的超宽带收发器设计中的挑战

2007 International Conference on Signal Processing, Communications and Networking Pub Date : 2007-11-05 DOI: 10.1109/ICSCN.2007.350669

A. T. Kalghatgi

引用次数: 13

Curvelet Transform Based Embedded Lossy Image Compression 基于曲波变换的嵌入式有损图像压缩

2007 International Conference on Signal Processing, Communications and Networking Pub Date : 2007-11-05 DOI: 10.1109/ICSCN.2007.350745

M. Manikandan, A. Saravanan, K. Bagan

引用次数: 21

An Efficient Reconfigurable Image Compression Architecture 一种高效的可重构图像压缩体系结构

2007 International Conference on Signal Processing, Communications and Networking Pub Date : 2007-11-05 DOI: 10.1109/ICSCN.2007.350743

D.U. Perumal, Shylendra Kumar, S. Prasanth, P. Kumar, M. Kannan, V. Vaidehi

引用次数: 0

Secure Steganography using Colour Palette Decomposition 使用调色板分解的安全隐写

2007 International Conference on Signal Processing, Communications and Networking Pub Date : 2007-11-05 DOI: 10.1109/ICSCN.2007.350699

K. Raja, S. Siddaraju, K. Venugopal, L. Patnaik

引用次数: 5

Dominating Set Theory Based Semantic Overlay Networks for Efficient Content Distribution 基于支配集理论的高效内容分发语义覆盖网络

2007 International Conference on Signal Processing, Communications and Networking Pub Date : 2007-11-05 DOI: 10.1109/ICSCN.2007.350736

J. Amutharaj, S. Radhakrishnan

{"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}

引用次数: 5

Arithmetic Coding with Forbidden Symbol and Optimized Adaptive Context Tree Modeling (GRASP Algorithm) for H.264 Video Coders H.264视频编码器的禁止符号算术编码和优化的自适应上下文树建模(GRASP算法)

2007 International Conference on Signal Processing, Communications and Networking Pub Date : 2007-11-05 DOI: 10.1109/ICSCN.2007.350679

E. Logashanmugam, B. Sreejaa, R. Ramachandran

引用次数: 0

Combination of Symbolic and Statistical Features for Symbols Recognition 结合符号特征和统计特征进行符号识别

2007 International Conference on Signal Processing, Communications and Networking Pub Date : 2007-11-05 DOI: 10.1109/ICSCN.2007.350784

R.L. Qureshi, Jean-Yves Ramel, H. Cardot, P. Mukherji

{"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}

引用次数: 19

Secured Data Transmission in Adhoc Networks Supporting Heterogeneous Interfaces 支持异构接口的Adhoc网络中的安全数据传输

2007 International Conference on Signal Processing, Communications and Networking Pub Date : 2007-11-05 DOI: 10.1109/ICSCN.2007.350666

G. Lavanya, R. Parimalam, J. Uma Maheswari

引用次数: 0

Performance Improvement of FH CDMA Signals using Rate Compatible Parallel Concatenated Block Codes 用速率兼容并行串接分组码改进跳频CDMA信号的性能

2007 International Conference on Signal Processing, Communications and Networking Pub Date : 2007-11-05 DOI: 10.1109/ICSCN.2007.350705

K. Sudha, R. Rao

{"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}

引用次数: 1