{"title":"Underwater localization and tracking based on semi-definite programming","authors":"Dexin Wang, Liuqing Yang, Xiang Cheng","doi":"10.1109/ICSPCC.2013.6664147","DOIUrl":"https://doi.org/10.1109/ICSPCC.2013.6664147","url":null,"abstract":"In underwater localization, buoyed anchors are preferable because of their low cost and the convenience to deploy, calibrate and reuse. However, this setup imposes extra difficulty to the localization of submerged targets since they are outside of the convex hull formed by the anchors. In this paper, we propose a semi-definite programming (SDP) based localization approach that is augmented by measurements obtained via onboard pressure sensors. Compared with the widely-adopted linearized least squares solution, simulations show our augmented SDP offers improved accuracy for point localization and faster convergence for tracking, under the same system configuration and environmental conditions, especially at low signal to noise ratio (SNR).","PeriodicalId":124509,"journal":{"name":"2013 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2013)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121761407","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 prison RFID network system using position computing","authors":"Han-Cheng Xiao, Jingyu Xiong","doi":"10.1109/ICSPCC.2013.6664094","DOIUrl":"https://doi.org/10.1109/ICSPCC.2013.6664094","url":null,"abstract":"RFID is achieving increasing popularity as location-aware services, and it will allow offering value-added services to the RFID system, where accuracy and efficiency is the most essential. This paper proposes a prison RFID network system that uses radio-frequency identification technology to accurately locate and track the prisoner activities, creates a novel location-based application. The proposed system provides a new real-time monitoring algorithm of people's whereabouts among key regions by taking advantage of RSS (Received Signal Strength) from readers, reference tags and a kind of active landmark tags. Positioning accuracy evaluation results show that the algorithm proposed by the paper has high-performance level in terms of accuracy and scalability.","PeriodicalId":124509,"journal":{"name":"2013 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2013)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127083349","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":"The research of performance analysis of avionics bus system based on DSPN","authors":"Zhanling Wang, Dengfu Zhang, Shiqiang Wang","doi":"10.1109/ICSPCC.2013.6663873","DOIUrl":"https://doi.org/10.1109/ICSPCC.2013.6663873","url":null,"abstract":"The working performance of MIL-STD-1553B bus is considered as the most significant and fundamental section in an integrated avionics electronics system. In order to resolve the problem of 1553B bus message transmission performance and ensure the real-time transmission of system message, this paper proposed a new method to research the reliability and stability problem of 1553B bus using Deterministic and Stochastic Petri Nets (DSPN). We constructed a model for message transmission based on DSPN, and then derived some important performance indexes. The experimental results show that these indexes can optimize the message transmission. The average delay of messages processing on bus is 0.191434us and the average waiting time is 0.738653us. The performance analysis has advantages with design and integration of avionics electronics system.","PeriodicalId":124509,"journal":{"name":"2013 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2013)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128930497","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":"Probabilistic analysis of cycles in random Tanner graphs","authors":"Xiaopeng Jiao, Jianjun Mu","doi":"10.1109/ICSPCC.2013.6663929","DOIUrl":"https://doi.org/10.1109/ICSPCC.2013.6663929","url":null,"abstract":"Cycles in bipartite graphs (also called Tanner graphs in channel coding field) are of particular interest in modern coding theory, especially in capacity-achieving low-density parity-check (LDPC) codes. In this paper, the expected number of cycles of various lengths in randomly constructed regular and irregular Tanner graphs are calculated. For a given degree distribution, the expected number of cycles in randomly constructed Tanner graphs has negligible changes with the size of Tanner graphs. Based on tree expanding, we propose a cycle counting algorithm (CCA) for Tanner graphs. Numerical results by counting the average number of short cycles over 200 random ensembles using the CCA give convincing supports to our analysis.","PeriodicalId":124509,"journal":{"name":"2013 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2013)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116005851","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":"Identification of tone noise sources on underwater moving object based on Doppler phase","authors":"Lingji Xu, Yixin Yang","doi":"10.1109/ICSPCC.2013.6663883","DOIUrl":"https://doi.org/10.1109/ICSPCC.2013.6663883","url":null,"abstract":"According to the Doppler Effect between moving acoustic source and receiver, an approach is proposed for identification of tone noise sources on underwater moving object with single hydrophone. Firstly, the product high-order ambiguity function (PHAF) is used to estimate the instantaneous phase and amplitude of the received Doppler signal. Then the abeam moments when tone noise sources have the closest approach to the measuring hydrophone are estimated by nonlinear weighted least-squares algorithm. Locations of tone noise sources are obtained by referring to a known acoustic source fixed on the moving object at last. The experiment results showed the validity of the proposed method.","PeriodicalId":124509,"journal":{"name":"2013 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2013)","volume":"37 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130779481","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 load balancing handoff algorithm based on RSSI and energy-aware in HAPs network","authors":"Feifei An, Yuwen Wang, Fanji Meng","doi":"10.1109/ICSPCC.2013.6664145","DOIUrl":"https://doi.org/10.1109/ICSPCC.2013.6664145","url":null,"abstract":"When high altitude platforms (HAPs) work as communication relay platforms, mobile terminals (MTs) generally make use of the handoff algorithm based on RSSI for handoff between HAPs. However, when several MTs send information to ground command center simultaneously, using the handoff algorithm based on RSSI will lead to HAPs with large received signal strength overload and HAPs with small received signal strength idle, putting HAPs network at risk of load imbalance and causing the phenomenon of congestion and packet loss, which thereby increases end-to-end delay and reduces packet delivery ratio. Aiming at the above problem and considering the limited energy of HAPs, a load balancing handoff algorithm based on RSSI and energy-aware in HAPs network is proposed. The simulation results obtained show that compared with the handoff algorithm based on RSSI, the proposed handoff algorithm can effectively balance network loads, reduce end-to-end delay and improve packet delivery ratio.","PeriodicalId":124509,"journal":{"name":"2013 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2013)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130788157","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":"An adaptive double thresholds scheme for spectrum sensing in cognitive radio networks","authors":"Fang Liu, Jinkuan Wang, Yinghua Han","doi":"10.1109/ICSPCC.2013.6664104","DOIUrl":"https://doi.org/10.1109/ICSPCC.2013.6664104","url":null,"abstract":"Spectrum sensing is a fundamental requirement in cognitive radio (CR) networks. In this paper, a novel spectrum sensing scheme based on energy detection is presented which enables a significant reduction in the number of samples. The sensing process involves several stages and each stage employs two thresholds that are adjusted according to the number of samples. Furthermore, an iterative algorithm is developed for obtaining the optimal number of samples at each sensing stage. As the proposed scheme requires fewer samples of signal, there will be less time for sensing and more time for data transmission which contributes to an improvement in the throughput of the CR networks. Numerical results are provided to show that the proposed sensing scheme has a clear advantage over the conventional energy detection.","PeriodicalId":124509,"journal":{"name":"2013 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2013)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126780951","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":"An efficient zero-blocks early detection algorithm for H.264/AVC","authors":"Zhang Min, Jing Zhanrong, Zhou Wei","doi":"10.1109/ICSPCC.2013.6663872","DOIUrl":"https://doi.org/10.1109/ICSPCC.2013.6663872","url":null,"abstract":"In low bit-rate video coding, all-zero block determination is a common technique to reduce the computational complexity of the encoder. We aim to improve the algorithm for the early detection of zero-blocks in H.264 video encoding. An improved algorithm for the early detection of all-zero blocks in H.264 video encoding is proposed in this paper. Based on the theoretical analyzes for the integer transform and quantization in H.264, a precise sufficient condition is proposed by modifying the calculation formula of discrete cosine transform in the motion estimation. The simulation results show that the proposed algorithm achieves approximately an 12%-39% computational saving without video-quality degradation, compared to the conventional method.","PeriodicalId":124509,"journal":{"name":"2013 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2013)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116900872","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":"Noise performance of a new FM-DCSK communication system","authors":"Li Ning, Xing Junyang","doi":"10.1109/ICSPCC.2013.6663918","DOIUrl":"https://doi.org/10.1109/ICSPCC.2013.6663918","url":null,"abstract":"With the development of Chaos Shift Keying, Frequency - Modulated Differential Shift keying(FM-DCSK) has gradually become the focus of scholars from various countries for its excellent performance. But, within a transmission cycle, FM-DCSK only half the time to send signals, the transmission efficiency is very low. In this paper, we present a new kind FM-DCSK communication system which based on the Walsh code. The studies have shown that, the efficiency of the new communication system is 4 times as the traditional FM-DCSK communication system. The bit error rate has a significant improvement compared to the traditional FM-DCSK communication system. The new system has value for application in the actual communication system.","PeriodicalId":124509,"journal":{"name":"2013 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2013)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114598004","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":"High resolution SAR imaging with efficient azimuth compression in chirp scaling principle","authors":"A. Awadallah, G. Zhao, Guangming Shi","doi":"10.1109/ICSPCC.2013.6664067","DOIUrl":"https://doi.org/10.1109/ICSPCC.2013.6664067","url":null,"abstract":"Chirp scaling algorithm (CSA) is one of the most popular algorithms in radar imaging, due to its excellent focusing ability and implementation simplicity. However, such superior performance, especially the resolution capability is greatly restricted by the number of observed measurements. Specially, if the measurements are reduced, images with high sidelobes and lower resolution are formed. The recent developed compressed sensing (CS) as well as its application in radar imaging demonstrates that, if the sparsity constraint is cooperated in the imaging technique, high resolution imaging quality can be still achieved, even using limited measurements. In this paper, a new chirp scaling azimuth compression technique based on CS theory is proposed, which exploits the sparse property of the measurements in azimuth dimension, and the sparsity constraint is combined with the CSA to perform all the azimuth processing steps. Comparisons were performed between the proposed algorithm using data under-sampled in the azimuth dimension at different ratios and the traditional CSA using full data set at different signal-to-noise ratio (SNR). Results show that the proposed CS based algorithm has better performance than the traditional algorithm even with using low percentage of the azimuth data and also indicate that the proposed algorithm is robust with the existence of low SNR.","PeriodicalId":124509,"journal":{"name":"2013 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2013)","volume":"427 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123010121","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}