Pub Date : 2007-07-11DOI: 10.1109/ICCCAS.2007.4348227
W. Suntiamorntut
The Hamming distance and normalization are important in many digital signal processing algorithms apart from multiply and multiply-accumulate operations. These operations are time consuming unless complex hardware is included, increasing power consumption and latency. This paper proposes a design based on a compressor circuit implemented by pass-transistor logic to perform both the Hamming distance and normalization functions on the same circuit for a general DSP. This enables a significant reduction in the number of transistors without sacrificing the performance or incurring the power penalty compared to the earlier designs which implemented the functions separately.
{"title":"Hamming Distance and Normalization Circuits","authors":"W. Suntiamorntut","doi":"10.1109/ICCCAS.2007.4348227","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348227","url":null,"abstract":"The Hamming distance and normalization are important in many digital signal processing algorithms apart from multiply and multiply-accumulate operations. These operations are time consuming unless complex hardware is included, increasing power consumption and latency. This paper proposes a design based on a compressor circuit implemented by pass-transistor logic to perform both the Hamming distance and normalization functions on the same circuit for a general DSP. This enables a significant reduction in the number of transistors without sacrificing the performance or incurring the power penalty compared to the earlier designs which implemented the functions separately.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114613869","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-07-11DOI: 10.1109/ICCCAS.2007.4348295
Li Chen, Xiangdong Li, Mingxia Shi
JI et al improved R. Revest's PayWord scheme based on hash chains and proposed a micro-payment scheme which had better security and fairness, but the scheme did not solve the problems of user's malicious overdraft and its executive timeliness. Furthermore its efficiency and security was restricted by the inherent shortcoming of conventional hash chains (CHC). The paper proposes a micro-payment scheme based on self-renewal hash chains scheme (SRHC). The analysis results show that the proposed scheme not only solves the problems existed in JI's scheme, but also has better features on security, efficiency and fairness. The novel scheme fits scenario of repeated micro-payment such as information commodity between a mobile user and a fixed service provider.
{"title":"A novel micro-payment scheme for M-commerce based on self-renewal hash chains","authors":"Li Chen, Xiangdong Li, Mingxia Shi","doi":"10.1109/ICCCAS.2007.4348295","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348295","url":null,"abstract":"JI et al improved R. Revest's PayWord scheme based on hash chains and proposed a micro-payment scheme which had better security and fairness, but the scheme did not solve the problems of user's malicious overdraft and its executive timeliness. Furthermore its efficiency and security was restricted by the inherent shortcoming of conventional hash chains (CHC). The paper proposes a micro-payment scheme based on self-renewal hash chains scheme (SRHC). The analysis results show that the proposed scheme not only solves the problems existed in JI's scheme, but also has better features on security, efficiency and fairness. The novel scheme fits scenario of repeated micro-payment such as information commodity between a mobile user and a fixed service provider.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115061456","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-07-11DOI: 10.1109/ICCCAS.2007.6247588
Dimin Niu, Kewu Peng, Changyong Pan, Zhixing Yang
The China national standard of digital television terrestrial broadcasting employs Low-Density Parity-Check (LDPC) codes of three different rates as the inner Forward Error Correction (FEC) Codes. In this paper, according to the structure of the quasi-cyclic LDPC (QC-LDPC) code, an implementation of multi-rate LDPC decoder is proposed using semi-parallel structure, achieving the appropriate balance between decoding throughput and the utilization of hardware resource. Meanwhile, a novel multiplex model of storage space and processing units is proposed to increase the resource efficiency of this decoder, which is much better than that of simple combination of three single-rate decoders. Simulation results demonstrate that this multi-rate decoder's performance under AWGN channel is the same as that of single rate decoders, while it has higher resource utilization efficiency. Therefore it could help reduce the chip size of the decoder greatly. In addition, the multi-rate strategy can also be applied to other QC-LDPC codes.
{"title":"Multi-rate LDPC decoder implementation for china digital television terrestrial broadcasting standard","authors":"Dimin Niu, Kewu Peng, Changyong Pan, Zhixing Yang","doi":"10.1109/ICCCAS.2007.6247588","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.6247588","url":null,"abstract":"The China national standard of digital television terrestrial broadcasting employs Low-Density Parity-Check (LDPC) codes of three different rates as the inner Forward Error Correction (FEC) Codes. In this paper, according to the structure of the quasi-cyclic LDPC (QC-LDPC) code, an implementation of multi-rate LDPC decoder is proposed using semi-parallel structure, achieving the appropriate balance between decoding throughput and the utilization of hardware resource. Meanwhile, a novel multiplex model of storage space and processing units is proposed to increase the resource efficiency of this decoder, which is much better than that of simple combination of three single-rate decoders. Simulation results demonstrate that this multi-rate decoder's performance under AWGN channel is the same as that of single rate decoders, while it has higher resource utilization efficiency. Therefore it could help reduce the chip size of the decoder greatly. In addition, the multi-rate strategy can also be applied to other QC-LDPC codes.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116964825","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-07-11DOI: 10.1109/ICCCAS.2007.4348163
Shangming Yang, Zhang Yi
In this paper, we develop a new algorithm with improved efficiency for nonnegative independent component analysis. This algorithm utilizes Kullback-Leibler divergence to generate nonnegative matrix factorization of the observation vectors. During the factorization, by pre-whitening the observations and orthonormalizing the mixing matrix, the independent components of sources are obtained. In the simulation, we successfully apply the developed algorithm to blind source separation of three images where sources are statistically independent.
{"title":"Nonnegative Matrix Factorization for Independent Component Analysis","authors":"Shangming Yang, Zhang Yi","doi":"10.1109/ICCCAS.2007.4348163","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348163","url":null,"abstract":"In this paper, we develop a new algorithm with improved efficiency for nonnegative independent component analysis. This algorithm utilizes Kullback-Leibler divergence to generate nonnegative matrix factorization of the observation vectors. During the factorization, by pre-whitening the observations and orthonormalizing the mixing matrix, the independent components of sources are obtained. In the simulation, we successfully apply the developed algorithm to blind source separation of three images where sources are statistically independent.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117137131","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-07-11DOI: 10.1109/ICCCAS.2007.4348126
Changcai Han, Weilin Wu
A system model based on multilayered space-time trellis codes (ML-STTC) is constructed for multimedia transmission over wireless communication systems with multiple antennas both at the transmitter and the receiver. In this model, Space-time Trellis Code (STTC) and Layered Space-time (LST) architecture are combined to achieve diversity and multiplexing gains provided by multiple-input and multiple-output (MIMO) technology. According to the characteristics of ML-STTC, the unequal error protection (UEP) scheme based on diversity gains is introduced for images first, and then the UEP scheme is strengthened by power allocation among antenna layers. Simulation results reveal the UEP schemes can improve the peak signal-to-noise ratio (PSNR) of reconstructed images in an environment with a moderate range of signal-to-noise ratio (SNR).
{"title":"UEP Schemes for Multimedia Transmission in Space-Time Coded Systems","authors":"Changcai Han, Weilin Wu","doi":"10.1109/ICCCAS.2007.4348126","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348126","url":null,"abstract":"A system model based on multilayered space-time trellis codes (ML-STTC) is constructed for multimedia transmission over wireless communication systems with multiple antennas both at the transmitter and the receiver. In this model, Space-time Trellis Code (STTC) and Layered Space-time (LST) architecture are combined to achieve diversity and multiplexing gains provided by multiple-input and multiple-output (MIMO) technology. According to the characteristics of ML-STTC, the unequal error protection (UEP) scheme based on diversity gains is introduced for images first, and then the UEP scheme is strengthened by power allocation among antenna layers. Simulation results reveal the UEP schemes can improve the peak signal-to-noise ratio (PSNR) of reconstructed images in an environment with a moderate range of signal-to-noise ratio (SNR).","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122130430","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-07-11DOI: 10.1109/ICCCAS.2007.4348248
Yongbin Yu, Qishui Zhong, Kang Li, Juebang Yu, X. Liao
Chua's oscillators are the electronic circuit generator of chaotic signals. In this paper the impulsive control scheme of Chua's Oscillators is represented. Using Lyapunov's direct method, we present conditions under which impulsively controlled Chua's Oscillators is absolutely stable. Finally, we provide the effectively impulsive control procedure.
{"title":"Absolute Stabilization for Impulsive Control of Chua's Oscillators","authors":"Yongbin Yu, Qishui Zhong, Kang Li, Juebang Yu, X. Liao","doi":"10.1109/ICCCAS.2007.4348248","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348248","url":null,"abstract":"Chua's oscillators are the electronic circuit generator of chaotic signals. In this paper the impulsive control scheme of Chua's Oscillators is represented. Using Lyapunov's direct method, we present conditions under which impulsively controlled Chua's Oscillators is absolutely stable. Finally, we provide the effectively impulsive control procedure.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129469180","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-07-11DOI: 10.1109/ICCCAS.2007.4348127
Xiaoqing Yu, Haiying Tan, W. Wan
To cope with the problem of speaker voice change detection, a novel speaker change detection algorithm is proposed in this paper. The new algorithm is developed based on traditional BIC algorithm in order to choose the voice segmentation point firstly, and then analyze the BIC change trend to decide which point is the real speaker voice change point. To compare with the normal BIC detection algorithm, the precision and recall rate of this new one is improved a lot. And also the new one has lower computational complexity compared with the traditional one.
{"title":"A Novel Speaker Change Detection Algorithm","authors":"Xiaoqing Yu, Haiying Tan, W. Wan","doi":"10.1109/ICCCAS.2007.4348127","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348127","url":null,"abstract":"To cope with the problem of speaker voice change detection, a novel speaker change detection algorithm is proposed in this paper. The new algorithm is developed based on traditional BIC algorithm in order to choose the voice segmentation point firstly, and then analyze the BIC change trend to decide which point is the real speaker voice change point. To compare with the normal BIC detection algorithm, the precision and recall rate of this new one is improved a lot. And also the new one has lower computational complexity compared with the traditional one.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129483913","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-07-11DOI: 10.1109/ICCCAS.2007.4348254
B. Long, Shulin Tian, Houjun Wang
Multisignal model is introduced to fault diagnosis for circuit boards including digital devices and analog devices. Dr. Deb real-time diagnosis algorithm based on multisignal model may produce conflict diagnostic results because of false alarm for that the sampled test signal may be disturbed by noise. We propose a modified algorithm by introduce failure confidence factor and apply it to fault diagnosis for an USB-GPIB interface circuit. The results show this method is easy to operate and diagnosis precise is high and is suitable for circuit boards fault diagnosis.
{"title":"Modified Diagnosis Algorithms Based on Multisignal Model and Application in Circuit Boards","authors":"B. Long, Shulin Tian, Houjun Wang","doi":"10.1109/ICCCAS.2007.4348254","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348254","url":null,"abstract":"Multisignal model is introduced to fault diagnosis for circuit boards including digital devices and analog devices. Dr. Deb real-time diagnosis algorithm based on multisignal model may produce conflict diagnostic results because of false alarm for that the sampled test signal may be disturbed by noise. We propose a modified algorithm by introduce failure confidence factor and apply it to fault diagnosis for an USB-GPIB interface circuit. The results show this method is easy to operate and diagnosis precise is high and is suitable for circuit boards fault diagnosis.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129770819","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-07-11DOI: 10.1109/ICCCAS.2007.4348206
Jianxin Wang, Geng Zhao, Yunqing Xia
Due to its excellent performance, Apriori is frequently adopted to discover frequent itemsets, from which strong association rules can be easily generated, from among massive amounts of transactional or relational data. In this paper, Apriori is reconsidered with a more abstract perspective of data space, and a more general form of the algorithm is proposed. As is shown in this paper, the newly proposed form of the algorithm can be effectively applied to more situations in which its primitive form does not work. The more general form of Apriori is successfully applied to the problem of clustering security events organized in a hierarchical manner, which illustrates its usefulness.
{"title":"A More General Form of Apriori and Its Application in Clustering Security Events","authors":"Jianxin Wang, Geng Zhao, Yunqing Xia","doi":"10.1109/ICCCAS.2007.4348206","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348206","url":null,"abstract":"Due to its excellent performance, Apriori is frequently adopted to discover frequent itemsets, from which strong association rules can be easily generated, from among massive amounts of transactional or relational data. In this paper, Apriori is reconsidered with a more abstract perspective of data space, and a more general form of the algorithm is proposed. As is shown in this paper, the newly proposed form of the algorithm can be effectively applied to more situations in which its primitive form does not work. The more general form of Apriori is successfully applied to the problem of clustering security events organized in a hierarchical manner, which illustrates its usefulness.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128663512","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-07-11DOI: 10.1109/ICCCAS.2007.6251600
Shang-Feng Chiang, Chun-Hung Wu, Sheng-De Wang
In order to improve the scalability and reduce the traffic of Gnutella-like unstructured peer-to-peer networks, index caching and controlled flooding mechanisms had been discussed in recent years. Some of them had modified the network architecture and adapted existing search methods for their mechanisms. Although the traffic of querying popular keywords could be reduced by using index caching mechanisms, the cached indices have too redundant replications in the whole network. We propose a multiplayer index diffusion scheme which actively diffuses the indices in the network and groups indices according to their request rate. The peers of the group that have indices with higher request rate will be placed in layers that receive queries earlier. Simulation studies show that the proposed approach can keep a high success query rate as well as reduce the flooding size.
{"title":"An active index diffusion scheme for multilayer unstructured peer-to-peer networks","authors":"Shang-Feng Chiang, Chun-Hung Wu, Sheng-De Wang","doi":"10.1109/ICCCAS.2007.6251600","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.6251600","url":null,"abstract":"In order to improve the scalability and reduce the traffic of Gnutella-like unstructured peer-to-peer networks, index caching and controlled flooding mechanisms had been discussed in recent years. Some of them had modified the network architecture and adapted existing search methods for their mechanisms. Although the traffic of querying popular keywords could be reduced by using index caching mechanisms, the cached indices have too redundant replications in the whole network. We propose a multiplayer index diffusion scheme which actively diffuses the indices in the network and groups indices according to their request rate. The peers of the group that have indices with higher request rate will be placed in layers that receive queries earlier. Simulation studies show that the proposed approach can keep a high success query rate as well as reduce the flooding size.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129549607","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
扫码关注我们
求助内容：
应助结果提醒方式：