{"title":"Multiplexed 24 channel bus architecture for multichannel high speed networked acoustic sensor system","authors":"T. V. Vineeth, R. Shibu, Arun Gopalakrishnan","doi":"10.1109/COMPSC.2014.7032676","DOIUrl":"https://doi.org/10.1109/COMPSC.2014.7032676","url":null,"abstract":"This paper presents a FPGA and DSP based high-speed multiplexed 24 channel bus architecture. The new bus architecture is a modified version of the existing multi-core processor architecture and distributed architecture to meet multichannel and multi processor requirement. Design includes implementation of constrained multiplexing, controlling and routing algorithm for packet data transfer at the rate of 256 Mbps using external FIFO. The system uses a simplified time division multiplexing and data interleaving for high speed data congestion avoidance and error correction and incorporate an adaptive architecture for switching between FPGA and DSP for data transfer using a single shared high speed parallel bus (signed fixed point) and distributed control lines. Communication control for FPGA data processing is via DSP utilizing serial interface. The architecture reduces global clocking resources for FPGA implementation making the system simple and reduces dynamic power consumption. The design blocks are modeled using VHDL and implemented in Spartan 3A DSP FPGA using finite state machine, improving data path timing to manage high speed data traffic and to achieve error free data communication with external systems.","PeriodicalId":388270,"journal":{"name":"2014 First International Conference on Computational Systems and Communications (ICCSC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129980285","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}
{"title":"Image watermarking scheme based on MD5 and simplified DES","authors":"J. Aparna, Sonal Ayyappan","doi":"10.1109/COMPSC.2014.7032644","DOIUrl":"https://doi.org/10.1109/COMPSC.2014.7032644","url":null,"abstract":"Digital watermarking is one of the prominent method to prevent illegal copying and duplication of digital media. It is the process of hiding digital data in any form of multimedia data such as image, audio, video, etc. This paper proposes a new block based watermarking technique in transform domain which uses cryptographic methods for embedding the watermark This method uses the MD5 hash of the cover image and the key generated from Simplified-DES to find out the bits to which the watermark is to be embedded. The hash of the cover image is encrypted using SDES and watermark embedding bits are selected. Experimental results shows that the method is robust against different geometrical attacks.","PeriodicalId":388270,"journal":{"name":"2014 First International Conference on Computational Systems and Communications (ICCSC)","volume":"37 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132433591","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}
V. Krishnapriya, P. Sreesha, T. R. Harithalakshmi, T. Archana, Jayasree N. Vettath
{"title":"Design of a POS tagger using conditional random fields for Malayalam","authors":"V. Krishnapriya, P. Sreesha, T. R. Harithalakshmi, T. Archana, Jayasree N. Vettath","doi":"10.1109/COMPSC.2014.7032680","DOIUrl":"https://doi.org/10.1109/COMPSC.2014.7032680","url":null,"abstract":"Parts of Speech tagging, is a process of marking the words in a text as corresponding to a particular part of speech, based on its definition and context POS tagger plays an important role in Natural language applications like speech recognition, natural language parsing, information retrieval and extraction. This paper discusses architecture for designing a Part-Of-Speech (POS tagger for Malayalam language using Conditional Random Field (CRF). The experiments presented in this paper use an annotated corpus of 1028 sentences (11,315 words) and tagset consists of 100 tags. A trigram based tagging scheme is involved in the experiments. The proposed system is based on an empirical approach that models the human POS tagging processing more realistically than the existing systems, without compromising the efficiency and accuracy.","PeriodicalId":388270,"journal":{"name":"2014 First International Conference on Computational Systems and Communications (ICCSC)","volume":"99 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114116587","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}
{"title":"Design of graphics processing unit for image processing","authors":"J. G. C. Panappally, M. S. Dhanesh","doi":"10.1109/COMPSC.2014.7032666","DOIUrl":"https://doi.org/10.1109/COMPSC.2014.7032666","url":null,"abstract":"This work describes the designing of a Graphics Processing unit that deals with image processing. Graphics Processing Unit (GPU) is an important factor when it comes to large computing. Images and videos that are having large data can be processed efficiently in GPU by exploiting its feature of parallel execution. Digital image processing implemented on hardware provides higher processing speed and performance. The use of Verilog HDL for the design of GPU provides an immediate implementation possibility. The paper focuses on image processing operations like Brightness manipulation, Contrast manipulation, image cropping, image zooming, image rotation and morphological operators such as Dilation and Erosion.","PeriodicalId":388270,"journal":{"name":"2014 First International Conference on Computational Systems and Communications (ICCSC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133430177","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}
{"title":"Modified RSA public key algorithm","authors":"B. G. Aswathy, R. Resmi","doi":"10.1109/COMPSC.2014.7032657","DOIUrl":"https://doi.org/10.1109/COMPSC.2014.7032657","url":null,"abstract":"Modern cryptography is heavily based on mathematical theory and computer science practice, cryptographic algorithms are designed around computational hardness assumptions. Among the various techniques adopted in cryptographic technology the RSA (Rivest, Shamir and Adleman) is the most widely used public key cryptosystem. The basic operation for this algorithm is modular exponentiation. Modular multiplication is the core computation of all modular exponentiation algorithms, Montgomery's method is considered as the most efficient algorithm for performing the modular multiplication operation. This paper presents two architectures for FPGA implementation of modular exponentiation algorithm based on Montgomery technique - one with parallel technique and another with maximum sequential operation. Finally these architectures are analyzed with respect to area, speed, and power using Xilinx ISE.","PeriodicalId":388270,"journal":{"name":"2014 First International Conference on Computational Systems and Communications (ICCSC)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123218515","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}
{"title":"Performance analysis of color image segmentation for text detection","authors":"Naicy Joseph, Philomina Simon","doi":"10.1109/COMPSC.2014.7032675","DOIUrl":"https://doi.org/10.1109/COMPSC.2014.7032675","url":null,"abstract":"Automatic text detection and extraction systems for natural scene images and videos have gained wide attention due to its immense applications in various fields of information retrieval. Many algorithms have been proposed in literature which addresses the problem of text detection. The color uniformity of text characters is one of the strong features which is used in color based text localisation methods. The prior step in the color based text localization methods is to partition the image into different segments based on the color. This paper discusses the performance analysis of different color image segmentation methods for text detection.","PeriodicalId":388270,"journal":{"name":"2014 First International Conference on Computational Systems and Communications (ICCSC)","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123393897","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}
{"title":"A literature search tool for identifying disease-associated genes using Hidden Markov model","authors":"S. Sreekala, K. Nazeer","doi":"10.1109/COMPSC.2014.7032627","DOIUrl":"https://doi.org/10.1109/COMPSC.2014.7032627","url":null,"abstract":"Understanding the role of genetics is very important for the in-depth study of a disease. Even though lots of information about gene-disease association is available, it is difficult even for an expert user to manually extract it from the huge volume of literature. Therefore, this work introduces a novel extraction tool that can identify disease associated genes from the literature using text-mining algorithm. Here, Hidden Markov Model is combined with a rule-based Named Entity Recognition approach to identify gene symbols from the literature. This will predict the good candidate genes for the disease which will help in the further analysis of the disease.","PeriodicalId":388270,"journal":{"name":"2014 First International Conference on Computational Systems and Communications (ICCSC)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123943878","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}
{"title":"Analysis and performance comparison of inverse dispersion compensation technique for standard optical fibers","authors":"Neetha I. Eappen, A. Sangeetha","doi":"10.1109/COMPSC.2014.7032679","DOIUrl":"https://doi.org/10.1109/COMPSC.2014.7032679","url":null,"abstract":"In modern high speed optical communication networks, the long distance transmission is restricted due to dispersion which causes inter symbol interference. In the present study, the dispersion characteristics of various standard optical fibers like Alcatel 6900, Corning Submarine Leaf, Lucent All Wave 1310 and OFS TrueWave RS 1590 are analyzed. By using inverse dispersion fibers with negative dispersion which is inverse to that of the single mode fibers, it is attempted to construct an optical communication system with the desired zero dispersion. The dispersion characteristics of these fibers are analyzed. Inverse dispersion compensation technique is employed to combat dispersion and the performance is analyzed in terms of eye diagrams and bit error rates.","PeriodicalId":388270,"journal":{"name":"2014 First International Conference on Computational Systems and Communications (ICCSC)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124149546","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}
{"title":"A novel decentralized group key management using attribute based encryption","authors":"Roney Thomas, A. Salim","doi":"10.1109/COMPSC.2014.7032678","DOIUrl":"https://doi.org/10.1109/COMPSC.2014.7032678","url":null,"abstract":"Key management schemes establish a shared secret key between all the members in the group. Key management in multicast dynamic groups, where users can leave or join at their ease is one of the most crucial and essential part of secure communication. We proposed a new decentralized group key management scheme using attribute based encryption which provide no single point of failure, scalability and local rekeying for n members with a communication cost in the order of logn. Moreover, compared to other decentralized scheme like Lolus framework, we avoid the problem of key translation. Also in our approach, the subgroup controller only needs to store 2logn+1 keys for n members.","PeriodicalId":388270,"journal":{"name":"2014 First International Conference on Computational Systems and Communications (ICCSC)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124187539","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}
{"title":"Spatiotemporal chaos in globally coupled NCA map lattices using 3-D Arnold cat map for digital image encryption","authors":"R. T. George, K. Gopakumar","doi":"10.1109/COMPSC.2014.7032648","DOIUrl":"https://doi.org/10.1109/COMPSC.2014.7032648","url":null,"abstract":"In recent years, owing to the rapid growth of multimedia data transmission over the Internet, security is an important concern in the transmission and storage of digital images. Encryption is one of the most efficient and common practice to uplift image security. Many approaches for image encryption have been introduced including image encryption using chaotic sequences. Recently, the Coupled Map Lattices (CML) based Spatiotemporal Chaotic (STC) system has attracted much attention in the image encryption field. This paper introduces a new scheme for image encryption based on a novel spatiotemporal chaotic system by defining nonlinear dynamics in the Globally Coupled Map Lattice (GCML) using non-neighbourhood coupling. The proposed spatiotemporal chaotic system employs 3D Arnold Cat Map to couple four Nonlinear Chaotic Algorithm (NCA) maps for generating a pseudo random sequence which satisfies uniform distribution, ideal nonlinearity and zero cross-correlation to achieve higher level of security. The image encryption algorithm uses the chaotic sequence generated by one of the NCA map to permute the pixels of the image. Finally, the shuffled image is diffused using the constructed spatiotemporal chaotic sequence. The experimental outcomes reveal that the proposed spatiotemporal system is of high key sensitivity and with large key space. The results obtained from statistical analysis and key sensitivity tests illustrate that the proposed image encryption scheme is secure enough to resist the brute-force attack, entropy attack, statistical attack, differential attacks, chosen-plaintext attack and known-plaintext attack and thus provides an efficient and secure way for real-time image encryption and transmission.","PeriodicalId":388270,"journal":{"name":"2014 First International Conference on Computational Systems and Communications (ICCSC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128725285","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}