Pub Date : 2016-10-10DOI: 10.1109/ICCSN.2016.7587196
Linfeng Liu, Jinglin Du, Dongyue Guo
Due to the highly hostile and unpredictable underwater environments, some beacon nodes in Underwater Wireless Sensor Networks (UWSNs) tend to move or be damaged. Therefore, the unknown nodes will be positioned with larger error, which abases the value of data collected by sensor nodes. In order to solve the beacon error problem, this paper proposes an error beacon filtering algorithm based on K-means clustering. Firstly, the position of each beacon is calculated by an improved trilateration method, and then the beacon with the maximum positioning error is filtered out through K-means clustering algorithm. Simulation results suggest that this algorithm can detect almost all error beacons effectively.
{"title":"Error beacon filtering algorithm based on K-means clustering for underwater Wireless Sensor Networks","authors":"Linfeng Liu, Jinglin Du, Dongyue Guo","doi":"10.1109/ICCSN.2016.7587196","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7587196","url":null,"abstract":"Due to the highly hostile and unpredictable underwater environments, some beacon nodes in Underwater Wireless Sensor Networks (UWSNs) tend to move or be damaged. Therefore, the unknown nodes will be positioned with larger error, which abases the value of data collected by sensor nodes. In order to solve the beacon error problem, this paper proposes an error beacon filtering algorithm based on K-means clustering. Firstly, the position of each beacon is calculated by an improved trilateration method, and then the beacon with the maximum positioning error is filtered out through K-means clustering algorithm. Simulation results suggest that this algorithm can detect almost all error beacons effectively.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126561276","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 : 2016-10-10DOI: 10.1109/ICCSN.2016.7586626
Shuxi Chen, Heming Zhao, Xueqin Chen, Cheng Fan
Fatigue is a complex physiological phenomena which is a kind of human body's natural response and self-regulation for protection. Detection of fatigue is becoming indispensable for its positive significance in scientific physical training. Recently, many researchers from both speech signal area and machine learning area have already shown that automatically fatigue detection from speech can carry out, but there is still plenty of room for the improvement of the recognition accuracy. The key to raise the accuracy in voice-based fatigue detection is precise phonetic identification and alignment. Therefore, this paper proposes a method for detecting sports fatigue which is based on feature extraction and machine learning system - support vector machine (SVM). In order to establish a comprehensive identification system, speech samples are trained as speech sources at different times. Experimental results state the feasibility and effectiveness of this method we put forward. What's more, Receiver Operating Characteristic Curves (ROC Curves) are used to double check the results, so that the application of sports fatigue detection is ensured.
{"title":"Detecting sports fatigue from speech by support vector machine","authors":"Shuxi Chen, Heming Zhao, Xueqin Chen, Cheng Fan","doi":"10.1109/ICCSN.2016.7586626","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586626","url":null,"abstract":"Fatigue is a complex physiological phenomena which is a kind of human body's natural response and self-regulation for protection. Detection of fatigue is becoming indispensable for its positive significance in scientific physical training. Recently, many researchers from both speech signal area and machine learning area have already shown that automatically fatigue detection from speech can carry out, but there is still plenty of room for the improvement of the recognition accuracy. The key to raise the accuracy in voice-based fatigue detection is precise phonetic identification and alignment. Therefore, this paper proposes a method for detecting sports fatigue which is based on feature extraction and machine learning system - support vector machine (SVM). In order to establish a comprehensive identification system, speech samples are trained as speech sources at different times. Experimental results state the feasibility and effectiveness of this method we put forward. What's more, Receiver Operating Characteristic Curves (ROC Curves) are used to double check the results, so that the application of sports fatigue detection is ensured.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121402443","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}
The McEliece public-key cryptosystem is believed to resist quantum attacks, but has not been used because of the extremely large public key size. In order to decrease the public key size, quasi-cyclic low-density parity-check (QC-LDPC) codes were used instead of Goppa codes in McEliece cryptosystem. A modified version of QC-LDPC McEliece is quasi-cyclic moderate density parity-check (QC-MDPC) McEliece, which focuses on ensuring fixed security level other than error-correction capability. The QC-MDPC McEliece scheme furtherly reduces the public key size at the cost of higher decryption complexity. However, the decryption algorithm of QC-LDPC McEliece variant has not been optimized. In this paper, we proposed a new decryption algorithm of the QC-LDPC McEliece variant. With the decryption algorithm we proposed, the key size reduces about 20% than the original algorithm, even 8% smaller than QC-MDPC variant.
{"title":"A new decryption algorithm of the quasi-cyclic low-density parity-check codes based McEliece cryptosystem","authors":"Shuo Zhang, Wenhui Cao, Angyang Li, Wenjie Dong, Liwei Shao","doi":"10.1109/ICCSN.2016.7586588","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586588","url":null,"abstract":"The McEliece public-key cryptosystem is believed to resist quantum attacks, but has not been used because of the extremely large public key size. In order to decrease the public key size, quasi-cyclic low-density parity-check (QC-LDPC) codes were used instead of Goppa codes in McEliece cryptosystem. A modified version of QC-LDPC McEliece is quasi-cyclic moderate density parity-check (QC-MDPC) McEliece, which focuses on ensuring fixed security level other than error-correction capability. The QC-MDPC McEliece scheme furtherly reduces the public key size at the cost of higher decryption complexity. However, the decryption algorithm of QC-LDPC McEliece variant has not been optimized. In this paper, we proposed a new decryption algorithm of the QC-LDPC McEliece variant. With the decryption algorithm we proposed, the key size reduces about 20% than the original algorithm, even 8% smaller than QC-MDPC variant.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"73 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120875306","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 : 2016-06-04DOI: 10.1109/ICCSN.2016.7586618
Dan Zhang, Guoqiang Bai
This brief presents an FPGA-based ultra-high performance ECC implementation over SM2 prime field which can resist SPA. This processor is designed with bottom-up optimization focused on SM2 and make the best of advantages of modern FPGA. To counteract SPA more efficiently and reduce time cost, traditional MPL algorithm is modified to be the main algorithm which can execute point addition (PA) and point double (PD) in parallel. Then PA and PD are designed to be full-isochronous modules invoked by main algorithm to maximize the efficiency. Finite field operations adopt DSP blocks to increase frequency. Spliced multipliers are matched with same-frequency adders in the introduced pipeline structure, which improve hardware utilization to more than 95 percent. Run on Altera StratixII EP2S30F672 FPGA, this SM2 processor whose frequency reaches 62.3 MHz can be performed at a rate of about 1.3k point multiplications per second, and it only costs 8 DSPs and 4742 ALMs. Compared with other related works, our architecture offers not only ultra-high performance but also deep research about the FPGA-based implementation of SM2.
{"title":"High-performance implementation of SM2 based on FPGA","authors":"Dan Zhang, Guoqiang Bai","doi":"10.1109/ICCSN.2016.7586618","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586618","url":null,"abstract":"This brief presents an FPGA-based ultra-high performance ECC implementation over SM2 prime field which can resist SPA. This processor is designed with bottom-up optimization focused on SM2 and make the best of advantages of modern FPGA. To counteract SPA more efficiently and reduce time cost, traditional MPL algorithm is modified to be the main algorithm which can execute point addition (PA) and point double (PD) in parallel. Then PA and PD are designed to be full-isochronous modules invoked by main algorithm to maximize the efficiency. Finite field operations adopt DSP blocks to increase frequency. Spliced multipliers are matched with same-frequency adders in the introduced pipeline structure, which improve hardware utilization to more than 95 percent. Run on Altera StratixII EP2S30F672 FPGA, this SM2 processor whose frequency reaches 62.3 MHz can be performed at a rate of about 1.3k point multiplications per second, and it only costs 8 DSPs and 4742 ALMs. Compared with other related works, our architecture offers not only ultra-high performance but also deep research about the FPGA-based implementation of SM2.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121012192","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 : 2016-06-04DOI: 10.1109/ICCSN.2016.7586587
Hong Zhang, Changzhen Hu, Xiaojun Wang
Just like the catastrophe in power grid, software system may collapse during its operation. It reflects the complexity in software system itself, and the brittleness of software system is the main reason which results in the collapse. The notion of complex system and brittleness is introduced into the study of software system and some aspects which can induce the system to collapse are also discussed. Specifically, the notions of complex system, complex network and brittleness are introduced at first, then a detailed description of the complexity of software system is given; following that a fast-slow alternative dynamic model is built, which consists of a slow-dynamic model and a fast-dynamic model. In the end, a complex theory framework of brittleness on software architecture is presented, which covers the brittleness of software architecture from the way of language description, the analytical method, modeling to the evaluation. This can give a comprehensive research platform on the brittleness of software system. Some main research areas are also given for future study.
{"title":"Application of complexity and brittleness on software architecture","authors":"Hong Zhang, Changzhen Hu, Xiaojun Wang","doi":"10.1109/ICCSN.2016.7586587","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586587","url":null,"abstract":"Just like the catastrophe in power grid, software system may collapse during its operation. It reflects the complexity in software system itself, and the brittleness of software system is the main reason which results in the collapse. The notion of complex system and brittleness is introduced into the study of software system and some aspects which can induce the system to collapse are also discussed. Specifically, the notions of complex system, complex network and brittleness are introduced at first, then a detailed description of the complexity of software system is given; following that a fast-slow alternative dynamic model is built, which consists of a slow-dynamic model and a fast-dynamic model. In the end, a complex theory framework of brittleness on software architecture is presented, which covers the brittleness of software architecture from the way of language description, the analytical method, modeling to the evaluation. This can give a comprehensive research platform on the brittleness of software system. Some main research areas are also given for future study.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127256690","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 : 2016-06-04DOI: 10.1109/ICCSN.2016.7586597
Yawei Li, Yuliang Yang, Yueyun Chen, Mengyu Zhu
In this paper, we present an approach to classify Chinese digital gesture based on convolutional neural network (CNN). Principal Component Analysis (PCA) is employed to learn convolution kernels as the pre-training strategy. The learned convolution kernels are used for extracting features instead of the random convolution kernels. The convolutional layers can be directly implemented without any further training, such as Back Propagation (BP). For better understanding, we name the proposed architecture for PCA-based Convolutional Neural Network (PCNN). The dataset is divided into six gesture classes including 14500 gesture images, with 12000 images for training and 2500 images for testing. We examine the robustness of the PCNN against noises and distortions. In addition, the MNIST database of handwritten digits is employed to assess the suitability of the PCNN. Different from the CNN, the PCNN reduces the high computational cost of convolution kernels training. About one-fifth of the training time is shortened. The result shows that our approach classifies six gesture classes with 99.92% accuracy. Multiple experiments manifest the PCNN serving as an efficient approach for image processing and object recognition.
{"title":"A pre-training strategy for convolutional neural network applied to Chinese digital gesture recognition","authors":"Yawei Li, Yuliang Yang, Yueyun Chen, Mengyu Zhu","doi":"10.1109/ICCSN.2016.7586597","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586597","url":null,"abstract":"In this paper, we present an approach to classify Chinese digital gesture based on convolutional neural network (CNN). Principal Component Analysis (PCA) is employed to learn convolution kernels as the pre-training strategy. The learned convolution kernels are used for extracting features instead of the random convolution kernels. The convolutional layers can be directly implemented without any further training, such as Back Propagation (BP). For better understanding, we name the proposed architecture for PCA-based Convolutional Neural Network (PCNN). The dataset is divided into six gesture classes including 14500 gesture images, with 12000 images for training and 2500 images for testing. We examine the robustness of the PCNN against noises and distortions. In addition, the MNIST database of handwritten digits is employed to assess the suitability of the PCNN. Different from the CNN, the PCNN reduces the high computational cost of convolution kernels training. About one-fifth of the training time is shortened. The result shows that our approach classifies six gesture classes with 99.92% accuracy. Multiple experiments manifest the PCNN serving as an efficient approach for image processing and object recognition.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125112401","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 : 2016-06-04DOI: 10.1109/ICCSN.2016.7586589
Mian Wang, L. Min, Min Li
Nature abounds with complex patterns emerging from biological, chemical, physical and social systems. Cellular Neural Networks (CNNs) may produce patterns similar to those found in nature, which implies that CNNs may be use as protoypes to describe some systems in nature. The Binary Sawtooth and Cow patch CNNs introduced by Chua et al. can generate pattern that sawtooths and cow patches coexist from any random initial pattern. In order to investigate the characteristics of the Binary Sawtooth and Cow patch CNNs, this study introduces concepts of so-called inherent (final) active, inherent (final) passive, and inherent (final) neutral for pattern pixels, and proposes Global Task and Local Rules of the Binary Sawtooth and Cow patch CNNs, and establishes a set of theorems. Three simulation examples have been carried out to verily the effectiveness of theoretical results.
{"title":"Dynamic analysis of coupled Binary Sawtooth and Sawtooth and Cow patch cellular neural networks","authors":"Mian Wang, L. Min, Min Li","doi":"10.1109/ICCSN.2016.7586589","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586589","url":null,"abstract":"Nature abounds with complex patterns emerging from biological, chemical, physical and social systems. Cellular Neural Networks (CNNs) may produce patterns similar to those found in nature, which implies that CNNs may be use as protoypes to describe some systems in nature. The Binary Sawtooth and Cow patch CNNs introduced by Chua et al. can generate pattern that sawtooths and cow patches coexist from any random initial pattern. In order to investigate the characteristics of the Binary Sawtooth and Cow patch CNNs, this study introduces concepts of so-called inherent (final) active, inherent (final) passive, and inherent (final) neutral for pattern pixels, and proposes Global Task and Local Rules of the Binary Sawtooth and Cow patch CNNs, and establishes a set of theorems. Three simulation examples have been carried out to verily the effectiveness of theoretical results.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"285 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122711676","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 : 2016-06-04DOI: 10.1109/ICCSN.2016.7586580
Zhendong Yin, Shaoxue Wu, Zhenguo Shi, Zhilu Wu
Waveform Division Multiple Access (WDMA) based on the orthogonal wavelet function is recently presented due to its admirable characteristics. However, the communication performance of the existing waveform of the system breaks down drastically as the number of users increases. In order to meet the communication requirement for WDMA-UWB system with massive users, a new design of pulse waveform is proposed in this paper. The correlation property and Bit Error Rate (BER) performance is raised apparently and close to that of the single-user system.
{"title":"A new design of pulse waveform for waveform division multiple access UWB wireless communication system","authors":"Zhendong Yin, Shaoxue Wu, Zhenguo Shi, Zhilu Wu","doi":"10.1109/ICCSN.2016.7586580","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586580","url":null,"abstract":"Waveform Division Multiple Access (WDMA) based on the orthogonal wavelet function is recently presented due to its admirable characteristics. However, the communication performance of the existing waveform of the system breaks down drastically as the number of users increases. In order to meet the communication requirement for WDMA-UWB system with massive users, a new design of pulse waveform is proposed in this paper. The correlation property and Bit Error Rate (BER) performance is raised apparently and close to that of the single-user system.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124566195","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 : 2016-06-04DOI: 10.1109/ICCSN.2016.7586614
Ebrahim Ghazisaeedi, Changcheng Huang
Energy consumption is a major concern for today's data centers. MapReduce is a cloud computing paradigm that is widely deployed in many data centers. In this paper, we propose EnergyMap, a novel energy-efficient embedding method that maps heterogeneous MapReduce-based virtual networks onto a heterogeneous data center network. EnergyMap also tries to constrain the incast queuing delay that may happen in Virtualized Data Centers (VDCs). Simulation results show that EnergyMap significantly reduces a data center's energy consumption and effectively controls the queuing delay caused by incast traffic.
{"title":"EnergyMap: Energy-efficient embedding of MapReduce-based virtual networks and controlling incast queuing delay","authors":"Ebrahim Ghazisaeedi, Changcheng Huang","doi":"10.1109/ICCSN.2016.7586614","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586614","url":null,"abstract":"Energy consumption is a major concern for today's data centers. MapReduce is a cloud computing paradigm that is widely deployed in many data centers. In this paper, we propose EnergyMap, a novel energy-efficient embedding method that maps heterogeneous MapReduce-based virtual networks onto a heterogeneous data center network. EnergyMap also tries to constrain the incast queuing delay that may happen in Virtualized Data Centers (VDCs). Simulation results show that EnergyMap significantly reduces a data center's energy consumption and effectively controls the queuing delay caused by incast traffic.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130338022","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 : 2016-06-04DOI: 10.1109/ICCSN.2016.7586621
Kai Luo
A dynamically reconfigurable cryptographic processor (DRCP), which are driven by configuration context, has been proven to be efficient and cost-effective in the block cryptography domains. Two techniques focused on optimizing the context-parsing organization and the context memory are proposed: 1) The classification-based multi-concurrent configuration (CMC) can obviously reduce the parsing time cost and configuration delay. 2) The diversified context-abstraction compression (DCC) provides three different ways to compress the context memory and ease the context access based on data flow graph (DFG) abstraction. The related processor and architecture are implemented with TSMC 65nm technology. And the design achieves the context memory for block cipher algorithms reduced to less than 40%, while the CMC and DCC can also help to choose a most efficient way to compress the context.
{"title":"An efficient and cost-effective context-parsing architecture for dynamically reconfigurable cryptographic processor","authors":"Kai Luo","doi":"10.1109/ICCSN.2016.7586621","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586621","url":null,"abstract":"A dynamically reconfigurable cryptographic processor (DRCP), which are driven by configuration context, has been proven to be efficient and cost-effective in the block cryptography domains. Two techniques focused on optimizing the context-parsing organization and the context memory are proposed: 1) The classification-based multi-concurrent configuration (CMC) can obviously reduce the parsing time cost and configuration delay. 2) The diversified context-abstraction compression (DCC) provides three different ways to compress the context memory and ease the context access based on data flow graph (DFG) abstraction. The related processor and architecture are implemented with TSMC 65nm technology. And the design achieves the context memory for block cipher algorithms reduced to less than 40%, while the CMC and DCC can also help to choose a most efficient way to compress the context.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"234 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130621047","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
扫码关注我们
求助内容：
应助结果提醒方式：