{"title":"Phase rotated ICI self-cancellation scheme with frequency diversity for OFDM systems","authors":"A. Goel","doi":"10.1109/ICSPCOM.2013.6719752","DOIUrl":"https://doi.org/10.1109/ICSPCOM.2013.6719752","url":null,"abstract":"Carrier frequency offset (CFO) destroys the orthogonality of the subcarriers and causes intercarrier interference (ICI). ICI self-cancellation scheme proposed by Zhao et al. is the simplest scheme to mitigate the effect of ICI. It repeats the same data symbol on two adjacent subcarriers with phase inversion and therefore does not provide any frequency diversity. To achieve frequency diversity Tang et al. proposed a symmetric data conjugate transmission scheme to mitigate the effect of ICI but its BER performance degrades at higher values of CFO. In order to improve its BER performance, a phase rotated symmetric data conjugate transmission scheme to mitigate the effect of ICI has been proposed in this paper. Like symmetric data conjugate scheme, proposed scheme also repeats the same data symbol with phase rotation on two symmetrically located subcarriers to achieve frequency diversity. The analytical expression for optimal phase rotation factor to optimize the carrier-to-interference ratio (CIR) performance of the proposed scheme is also derived. It has been shown that proposed scheme provides better performance than that of the conventional symmetric data conjugate scheme especially at high CFO.","PeriodicalId":272955,"journal":{"name":"2013 INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATION (ICSC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117139593","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":"Efficient motion compensation solution for H264 ultra HD codec","authors":"Ramakrishna Adireddy, P. Shastry","doi":"10.1109/ICSPCOM.2013.6719841","DOIUrl":"https://doi.org/10.1109/ICSPCOM.2013.6719841","url":null,"abstract":"This Motion Compensation needs significant amount of computation in advanced video standards like MPEG4, AVS, VP8, VC-1 and H264. To understand the complexity involved in motion compensation, we categorize the Motion-Compensation (MC) into following steps. Initial step involves obtaining/computing the information needed for reference region transfer, using macro-block header data. Our solution additionally computes the reference region transfer parameters such that it is optimized for DDR memory Band-Width (BW). Hence the initial step becomes complex & computation intensive if any DDR BW optimizing algorithms to be used. The algorithm that we used is “optimal DDR BW algorithm” wherein it considers the overlap of reference regions and minimizes the total data fetch. The next step involves programming the DMA & transferring the reference region from external memory to internal memory, using the information that's been populated in the initial step. The last step of MC involves FIR filtering for sub-sample computation. Algorithms have been well developed for the motion compensation on DSP+DMA based systems. Even with interpolation friendly DSP based systems, the execution cycles needed motion compensation are well above 1500 cycles and very much close to 2000 cycles. Here in this paper, we propose a solution with consideration of a simple system to achieve the motion compensation task well below 1000 cycles. Considering the MC task split into above mentioned three tasks, the first two tasks of MC seem less cycle intensive, but it is difficult to achieve them in very low cycle budget.","PeriodicalId":272955,"journal":{"name":"2013 INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATION (ICSC)","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132421561","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":"Low power reconfigurable FIR filter based on window techniques for on chip network","authors":"Rainy Chaplot, A. Paliwal","doi":"10.1109/ICSPCOM.2013.6719800","DOIUrl":"https://doi.org/10.1109/ICSPCOM.2013.6719800","url":null,"abstract":"Past literature analyzed FIR filter either for one or different order using either one or different window functions. In this brief, we have analyzed the performance of Reconfigurable Digital Low Pass FIR Filter System On Chip design for various filter orders 10 to 120 for different window techniques namely Rectangular, Hanning, Hamming, Bartlett and Kaiser Window Function, with sampling frequency 48 KHz and with cut off frequency 10.8 KHz. It is shown that filter design by using Kaiser window function and Spartan 6 family of FPGA is best because resource utilization are less and consequently the power consumption is minimum for this combination. Xilinx Spartan 6 family synthesis result of the designed filter using Kaiser Window Function shows 5-10% power reduction over other window function. On contrary to past literature, we have concluded the calculated parameters i.e. Power Consumption (Static and Dynamic), Delay, Resources Utilized by taking different window function as platform on the various FPGA families of Xilinx, so as to exploit best chosen family and window function according to application, specification as well as constraints. The coefficient of FIR filter is generated using MatLab FDA (Filter Design Analysis) tool box. Based on the coefficients, FIR filter is being programmed in VHDL, and synthesized and simulated on Xilinx design suite 14.1 ISE.","PeriodicalId":272955,"journal":{"name":"2013 INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATION (ICSC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114644205","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 super-resolution by interpolating high frequency sub-bands of image using surface fitting","authors":"Mayank Agrawal, Ratnakar Dash","doi":"10.1109/ICSPCOM.2013.6719828","DOIUrl":"https://doi.org/10.1109/ICSPCOM.2013.6719828","url":null,"abstract":"This paper presents an image super-resolution technique based on surface fitting the high frequency components of an image obtained by Discrete Wavelet Transform (DWT) of the image and enhanced by Stationary Wavelet Transform (SWT) of the image at intermediate stage. The high frequency sub-bands of the image were generated using DWT and interpolated using surface fitting. These sub-bands modified by high frequency Sub-bands obtained through SWT. The output image was generated through Inverse discrete Wavelet Transform (IDWT) with interpolated input image by surface fitting and high frequency sub-bands. The qualitative and quantitative results show the superiority of this method over other standard image super-resolution techniques.","PeriodicalId":272955,"journal":{"name":"2013 INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATION (ICSC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115131388","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":"Multiresolution technique to handwritten English character recognition using learning rule and Euclidean distance metric","authors":"D. K. Patel, T. Som, M. Singh","doi":"10.1109/ICSPCOM.2013.6719784","DOIUrl":"https://doi.org/10.1109/ICSPCOM.2013.6719784","url":null,"abstract":"The present paper deals with the problem of handwritten character recognition of English character. This paper presents a novel method of handwriting character recognition which exploits a compression capability of discrete wavelet transform to enhance the accuracy of recognition at the pixel level, the learning capability of artificial neural network and computational capability of Euclidean distance metric. The problem of handwritten character recognition has been tackled with multiresolution technique using discrete wavelet transform and learning rule through the artificial neural network. Recognition accuracy is improved by Euclidean distance metric along with recognition score in case of misclassification. Features of the handwritten character images are extracted by discrete wavelet transform used with appropriate level of multiresolution. Handwritten characters are classified into 26 pattern classes based on appropriate properties i.e. shape. During preprocessing each character is captured within a rectangular box and then resized to a threshold size. Weight matrix of each class is computed using the learning rule of artificial neural network, and then the unknown input pattern vector is fused with the weight matrices of all the classes to generate the recognition scores. Maximum score corresponds to the recognized input character. Learning rule provides a good recognition accuracy of 88.46%. In case of misclassification, the Euclidean distance metric improves the recognition accuracy to 92.31% and then its product with recognition score further improves the recognition accuracy to 99.23%. The proposed method provides such good recognition accuracy for handwritten characters even with fewer data samples.","PeriodicalId":272955,"journal":{"name":"2013 INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATION (ICSC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115377960","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 hybrid model for extraction of brain tumor in MR images","authors":"Ankit Vidyarthi, Namita Mittal","doi":"10.1109/ICSPCOM.2013.6719783","DOIUrl":"https://doi.org/10.1109/ICSPCOM.2013.6719783","url":null,"abstract":"Brain tumor is one of the most life- threatening diseases in the field of medical science. A proper diagnosis of such a disease is required in its early phase of its generation. Various methods have been proposed for the extraction of the abnormality regions from the brain tumor Magnetic Resonance (MR) images. However, most of the methods proposed in the literature have drawback of losing background image. In this paper, a hybrid model is proposed which identifies the region of interest using fused results of threshold segmentation and morphological operations. Initially, an abnormal brain MR image is processed with Otsu threshold based segmentation and morphological operations like erosion. Further, both the segmented resultant images are fused with the original MR image to preserve the background and correctly identification of the tumor region.","PeriodicalId":272955,"journal":{"name":"2013 INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATION (ICSC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129437110","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":"Script independent angular skew detection and correction algorithms","authors":"U. Mathur, Rohit Sharma, Naveen Srivastava","doi":"10.1109/ICSPCOM.2013.6719835","DOIUrl":"https://doi.org/10.1109/ICSPCOM.2013.6719835","url":null,"abstract":"Document digitalization is done in a large scale for hand written and printed documents, where the documents are scanned and stored in a digital form. Maximum number of these documents are hand written, and hence, they comprise of various errors like angular skewness of words, or sentence as a whole. Before the document can be digitalised using OCR software, it is pre-processed for angular skew detection and their removal from the scanned document. Detection and correction of angular skewness of the words is the most difficult task for the process, which must be carried out as this skewness is present in almost all of the hand written words. In this paper, we propose and test algorithms independent of the script to detect and correct angular skewness.","PeriodicalId":272955,"journal":{"name":"2013 INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATION (ICSC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130201067","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":"Windowed r-point update algorithm for Discrete Fourier Transform","authors":"Adarsh Srivastava, V. Karwal","doi":"10.1109/ICSPCOM.2013.6719780","DOIUrl":"https://doi.org/10.1109/ICSPCOM.2013.6719780","url":null,"abstract":"In the real-time signal processing of the infinite data sequence, a portion of the sequence of length N is sampled by windowing and Discrete Fourier Transform (DFT) of that portion is computed. After computation of DFT, new input data points are shifted into the window and old data points are spilled out from the window. After shifting a new DFT has to be calculated for updated data sequence. The algorithm developed in this research is capable of updating the previously calculated DFT after shifting the data sequence over the window and reflects DFT of the updated data sequence, using less computation than directly evaluating the new transform. Previously developed algorithms were limited to a single point step between successive windows. In this research this result is extended to handle larger step sizes, i.e. the algorithm is capable to update a DFT sequence after shifting r additional data points into the window and spilling out of r old points from the window, where 1 ≤ r ≤ log2N. This Algorithm reduces the computational order by a factor of (1/ r) log2 N. The algorithm is developed for the data sequence windowed by Rectangular window and Bartlett window.","PeriodicalId":272955,"journal":{"name":"2013 INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATION (ICSC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129051900","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}
Deepesh K. Rathore, Ankita Upmanyu, Deepanshu Lulla
{"title":"Wireless patient health monitoring system","authors":"Deepesh K. Rathore, Ankita Upmanyu, Deepanshu Lulla","doi":"10.1109/ICSPCOM.2013.6719824","DOIUrl":"https://doi.org/10.1109/ICSPCOM.2013.6719824","url":null,"abstract":"This paper presents a wireless system which enables real-time health monitoring of multiple patient(s). In health care centers patient's data such asheart rate needs to be constantly monitored. The proposed system monitors the heart rate and other such data of patient's body. For example heart rate is measured through a Photoplethysmograph. A transmitting module is attached which continuously transmits the encoded serial data using Zigbee module. A receiver unit is placed in doctor's cabin, which receives and decodes the data and continuously displays it on a User interface visible on PC/Laptop. Thus doctor can observe and monitor many patients at the same time. System also continuously monitors the patient(s) data and in case of any potential irregularities, in the condition of a patient, the alarm system connected to the system gives an audio-visual warning signal that the patient of a particular room needs immediate attention. In case, the doctor is not in his chamber, the GSM modem connected to the system also sends a message to all the doctors of that unit giving the room number of the patient who needs immediate care.","PeriodicalId":272955,"journal":{"name":"2013 INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATION (ICSC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127605370","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":"Security in mobile wireless networks","authors":"A. Al-Ka'bi","doi":"10.1109/ICSPCOM.2013.6719746","DOIUrl":"https://doi.org/10.1109/ICSPCOM.2013.6719746","url":null,"abstract":"This paper discusses some security issues related to mobile wireless networks, including different security protocols.","PeriodicalId":272955,"journal":{"name":"2013 INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATION (ICSC)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115799604","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}