Pub Date : 2020-06-01DOI: 10.1109/ICCCI49374.2020.9145996
Chao Liu, Zhengfei Fang, Chuan Li
Beamforming is a promising technique for suppressing interferences and enhancing desired signal in communication system. However, when the interference is close to the desired signal, the performance of the traditional beamformer decreases sharply. In this paper, a novel space-polarization joint domain beamforming algorithm is proposed to suppress the main lobe interference based on dual polarized conformal array. The proposed beamformer is designed by using convex optimization constraint criterion, which integrates the space and polarization information of the signal and can suppress the interference of arbitrary space and polarization parameters. The simulation results show that the proposed algorithm provides good performance even if the interference and the desired signal come from the same space angle.
{"title":"An Anti-jamming Method Based on Convex Optimization for Dual Polarized Conformal Array","authors":"Chao Liu, Zhengfei Fang, Chuan Li","doi":"10.1109/ICCCI49374.2020.9145996","DOIUrl":"https://doi.org/10.1109/ICCCI49374.2020.9145996","url":null,"abstract":"Beamforming is a promising technique for suppressing interferences and enhancing desired signal in communication system. However, when the interference is close to the desired signal, the performance of the traditional beamformer decreases sharply. In this paper, a novel space-polarization joint domain beamforming algorithm is proposed to suppress the main lobe interference based on dual polarized conformal array. The proposed beamformer is designed by using convex optimization constraint criterion, which integrates the space and polarization information of the signal and can suppress the interference of arbitrary space and polarization parameters. The simulation results show that the proposed algorithm provides good performance even if the interference and the desired signal come from the same space angle.","PeriodicalId":153290,"journal":{"name":"2020 2nd International Conference on Computer Communication and the Internet (ICCCI)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132219614","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 : 2020-06-01DOI: 10.1109/ICCCI49374.2020.9145988
Cheng-Han Lin, Ming-Fong Tsai, W. Hwang, Ming-Hua Cheng
With the rapid development of the wireless network, IEEE 802.11 wireless network access technology has become a widely used technology, in which the contention channel of the distributed coordination function (DCF) is the default mechanism. Through the contention window, waiting time required before sending data can be determined. Therefore, the adjustment of the competition window is an important key that affects network transmission performance. At present, most related researches anchored on wireless local area networks (WLAN) to design channel competition backoff algorithms. These methods all consider the transmission collision problem caused by the increase of the number of nodes to improve the performance, which it is uncertain whether these methods can be applied on Wireless Home Area Network (WHAN) that contains fewer nodes. Through experimentation with different numbers of nodes and different contention window sizes, this study found a collision rate range with superior efficiency, and thus proposed a backoff algorithm for Home Area Network (BA-HAN). The size of the competition window is adjusted based on the size of the contention window to achieve the performance improvement and reduction of the collision rate. According to the experimental result, the BA-HAN algorithm is superior to related channel competition mechanisms (EIED, LILD, ELBA, and CRBA).
{"title":"A Collision Rate-Based Backoff Algorithm for Wireless Home Area Networks","authors":"Cheng-Han Lin, Ming-Fong Tsai, W. Hwang, Ming-Hua Cheng","doi":"10.1109/ICCCI49374.2020.9145988","DOIUrl":"https://doi.org/10.1109/ICCCI49374.2020.9145988","url":null,"abstract":"With the rapid development of the wireless network, IEEE 802.11 wireless network access technology has become a widely used technology, in which the contention channel of the distributed coordination function (DCF) is the default mechanism. Through the contention window, waiting time required before sending data can be determined. Therefore, the adjustment of the competition window is an important key that affects network transmission performance. At present, most related researches anchored on wireless local area networks (WLAN) to design channel competition backoff algorithms. These methods all consider the transmission collision problem caused by the increase of the number of nodes to improve the performance, which it is uncertain whether these methods can be applied on Wireless Home Area Network (WHAN) that contains fewer nodes. Through experimentation with different numbers of nodes and different contention window sizes, this study found a collision rate range with superior efficiency, and thus proposed a backoff algorithm for Home Area Network (BA-HAN). The size of the competition window is adjusted based on the size of the contention window to achieve the performance improvement and reduction of the collision rate. According to the experimental result, the BA-HAN algorithm is superior to related channel competition mechanisms (EIED, LILD, ELBA, and CRBA).","PeriodicalId":153290,"journal":{"name":"2020 2nd International Conference on Computer Communication and the Internet (ICCCI)","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123246400","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 : 2020-06-01DOI: 10.1109/ICCCI49374.2020.9145978
Junjun Hu, Bo Yang, Runzhen Yan, Qiong Wang, K. Lin
GoldenGate and Active DataGuard are both products of Oracle. GoldenGate can realize data synchronization with production database at the second level. And the same time it can realize writing data on both ends at the same time. Active DataGuard not only can realize the data real-time synchronization. Therefore, to combine GoldenGate and Active DataGuard technology not only can realize the disaster of the production data, but also can realize separation of disaster preparedness back-end database, reading and writing, and improve the business processing ability of the system as a whole. At the same time it can make full use of the computing power of the backend resources to reduce the cost.
{"title":"Disaster Preparedness Backend Database to Read and Write Separation Technology Research","authors":"Junjun Hu, Bo Yang, Runzhen Yan, Qiong Wang, K. Lin","doi":"10.1109/ICCCI49374.2020.9145978","DOIUrl":"https://doi.org/10.1109/ICCCI49374.2020.9145978","url":null,"abstract":"GoldenGate and Active DataGuard are both products of Oracle. GoldenGate can realize data synchronization with production database at the second level. And the same time it can realize writing data on both ends at the same time. Active DataGuard not only can realize the data real-time synchronization. Therefore, to combine GoldenGate and Active DataGuard technology not only can realize the disaster of the production data, but also can realize separation of disaster preparedness back-end database, reading and writing, and improve the business processing ability of the system as a whole. At the same time it can make full use of the computing power of the backend resources to reduce the cost.","PeriodicalId":153290,"journal":{"name":"2020 2nd International Conference on Computer Communication and the Internet (ICCCI)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129271024","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 : 2020-06-01DOI: 10.1109/ICCCI49374.2020.9145970
Jingwen Zhang, Bo Jiang, Hua Zhao, Yue Xu
The Internet of Things and 5G technologies have made mobile cloud computing emerge and develop rapidly. However, the rapid development of mobile applications requires cloud computing to have lower network latency and computing energy consumption. Therefore, Mobile edge computing (MEC) which is a promising technology has received widespread attention. Nowadays, it is important to schedule resources reasonably due to the communication and computing resources shortage. In this paper, we propose a mobile edge computing task scheduling algorithm in a multi-user multi-tasking environment. The algorithm takes into account the time sensitivity of mobile applications. We optimize the traditional task scheduling algorithm with the user's minimum average execution time and minimum computing energy consumption as the goals. Extensive experiments are carried out on MATLAB. The result shows that our proposed algorithm can effectively reduce the time and energy cost of mobile edge computing.
{"title":"Time-Sensitive Multi-User Oriented Mobile Edge Computing Task Scheduling Algorithm","authors":"Jingwen Zhang, Bo Jiang, Hua Zhao, Yue Xu","doi":"10.1109/ICCCI49374.2020.9145970","DOIUrl":"https://doi.org/10.1109/ICCCI49374.2020.9145970","url":null,"abstract":"The Internet of Things and 5G technologies have made mobile cloud computing emerge and develop rapidly. However, the rapid development of mobile applications requires cloud computing to have lower network latency and computing energy consumption. Therefore, Mobile edge computing (MEC) which is a promising technology has received widespread attention. Nowadays, it is important to schedule resources reasonably due to the communication and computing resources shortage. In this paper, we propose a mobile edge computing task scheduling algorithm in a multi-user multi-tasking environment. The algorithm takes into account the time sensitivity of mobile applications. We optimize the traditional task scheduling algorithm with the user's minimum average execution time and minimum computing energy consumption as the goals. Extensive experiments are carried out on MATLAB. The result shows that our proposed algorithm can effectively reduce the time and energy cost of mobile edge computing.","PeriodicalId":153290,"journal":{"name":"2020 2nd International Conference on Computer Communication and the Internet (ICCCI)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133978824","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 : 2020-06-01DOI: 10.1109/ICCCI49374.2020.9145983
M. Hongo, T. Goto
Blind image restoration, which restores a clear image from a single blurry image, is a difficult process of estimating two unknowns: a point-spread function (PSF) and an ideal image. In this paper, we use a learning-type restoration method that learns a sharp image without blur and an image that contains blur, and supposes the restoration of blurred images that occur especially when shooting fast-moving objects such as cars. We study the improvement of the image quality of the restored image by examining the training image used for the image.
{"title":"Performance Improvement for Blurred Images Utilizing Learning-Based Image Restoration Method","authors":"M. Hongo, T. Goto","doi":"10.1109/ICCCI49374.2020.9145983","DOIUrl":"https://doi.org/10.1109/ICCCI49374.2020.9145983","url":null,"abstract":"Blind image restoration, which restores a clear image from a single blurry image, is a difficult process of estimating two unknowns: a point-spread function (PSF) and an ideal image. In this paper, we use a learning-type restoration method that learns a sharp image without blur and an image that contains blur, and supposes the restoration of blurred images that occur especially when shooting fast-moving objects such as cars. We study the improvement of the image quality of the restored image by examining the training image used for the image.","PeriodicalId":153290,"journal":{"name":"2020 2nd International Conference on Computer Communication and the Internet (ICCCI)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115710373","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 : 2020-06-01DOI: 10.1109/ICCCI49374.2020.9145977
Dennis Krummacker, Christoph Fischer, Khurshid Alam, Michael Karrenbauer, Sergiy Melnyk, H. Dieter Schotten, Peng Chen, Siyu Tang
Since the announcement of Industry 4.0 (I4.0), the concepts and ideas behind this revolution have been overturning. On the communication side however, all scenarios can be reduced to similar requirements. I4.0 communication requires real-time capability, reliability and interconnectivity of many clients. The realization of these requirements is already made possible by the IEEE standardized TSN technology. A key enabler for the realization of these requirements is a common time understanding of all involved instances, in order to coordinate the complexity arising in such a scenario. For this purpose, clock synchronization is an essential component of TSN. However, there is another essential feature that many I4.0 use cases have in common, which is the spatial dynamics of clients that only wireless communication can provide. This paper presents an approach based on WLAN, which is also able to meet these requirements. The essential points of clock synchronization as used in TSN are analyzed and transferred to WLAN and further concepts and optimizations will be introduced. These concepts are evaluated and analyzed in simulations. The result is a communication concept, which is able to exceed the performance of wired TSN as shown by various KPIs.
{"title":"Intra-Network Clock Synchronization for Wireless Networks: From State of the Art Systems to an Improved Solution","authors":"Dennis Krummacker, Christoph Fischer, Khurshid Alam, Michael Karrenbauer, Sergiy Melnyk, H. Dieter Schotten, Peng Chen, Siyu Tang","doi":"10.1109/ICCCI49374.2020.9145977","DOIUrl":"https://doi.org/10.1109/ICCCI49374.2020.9145977","url":null,"abstract":"Since the announcement of Industry 4.0 (I4.0), the concepts and ideas behind this revolution have been overturning. On the communication side however, all scenarios can be reduced to similar requirements. I4.0 communication requires real-time capability, reliability and interconnectivity of many clients. The realization of these requirements is already made possible by the IEEE standardized TSN technology. A key enabler for the realization of these requirements is a common time understanding of all involved instances, in order to coordinate the complexity arising in such a scenario. For this purpose, clock synchronization is an essential component of TSN. However, there is another essential feature that many I4.0 use cases have in common, which is the spatial dynamics of clients that only wireless communication can provide. This paper presents an approach based on WLAN, which is also able to meet these requirements. The essential points of clock synchronization as used in TSN are analyzed and transferred to WLAN and further concepts and optimizations will be introduced. These concepts are evaluated and analyzed in simulations. The result is a communication concept, which is able to exceed the performance of wired TSN as shown by various KPIs.","PeriodicalId":153290,"journal":{"name":"2020 2nd International Conference on Computer Communication and the Internet (ICCCI)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125448706","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 : 2020-06-01DOI: 10.1109/ICCCI49374.2020.9145984
S. D. You, Ming-Jen Hung
This paper studies the use of independent component analysis (ICA) for reducing the dimensionality of one type of spectro-temporal features, known as the MPEG-7 audio signature descriptors. The dimension-reduced features are used to identify distorted audio items in the experiments. The proposed ICA-based reduction approach is compared with the block average method and the principal component analysis (PCA) method. The experimental results show that features obtained by the ICA approach have higher identification accuracy than comparison counterparts for moderate to highly distorted soundtracks. In this regard, the proposed approach is a better alternative for dimensionality reduction for spectro-temporal features with distortion.
{"title":"Reducing Dimensionality of Spectro-Temporal Data by Independent Component Analysis","authors":"S. D. You, Ming-Jen Hung","doi":"10.1109/ICCCI49374.2020.9145984","DOIUrl":"https://doi.org/10.1109/ICCCI49374.2020.9145984","url":null,"abstract":"This paper studies the use of independent component analysis (ICA) for reducing the dimensionality of one type of spectro-temporal features, known as the MPEG-7 audio signature descriptors. The dimension-reduced features are used to identify distorted audio items in the experiments. The proposed ICA-based reduction approach is compared with the block average method and the principal component analysis (PCA) method. The experimental results show that features obtained by the ICA approach have higher identification accuracy than comparison counterparts for moderate to highly distorted soundtracks. In this regard, the proposed approach is a better alternative for dimensionality reduction for spectro-temporal features with distortion.","PeriodicalId":153290,"journal":{"name":"2020 2nd International Conference on Computer Communication and the Internet (ICCCI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128216082","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 : 2020-06-01DOI: 10.1109/ICCCI49374.2020.9145973
Georgios M. Minopoulos, Vasileios A. Memos, Konstantinos E. Psannis, Y. Ishibashi
Nowadays, the need for more efficient video compression algorithms is growing, due to the increasing consumption of video content in higher resolutions. Thus, it is obvious that video compression technologies play a key role in the distribution of video content in broadcasting. In this paper, the video compression comparisons take into account the encoding or decoding time which is needed for each compression standard, in order to provide evidence about their adaptation under real-time streaming conditions. The video test sequences used in our experiments were retrieved from miscellaneous sources and their common characteristic is that they have High or Ultra High Definition resolution. Video codecs' performance was tested by using commercial coding libraries and reference software of the coding standards.
{"title":"Comparison of Video Codecs Performance for Real-Time Transmission","authors":"Georgios M. Minopoulos, Vasileios A. Memos, Konstantinos E. Psannis, Y. Ishibashi","doi":"10.1109/ICCCI49374.2020.9145973","DOIUrl":"https://doi.org/10.1109/ICCCI49374.2020.9145973","url":null,"abstract":"Nowadays, the need for more efficient video compression algorithms is growing, due to the increasing consumption of video content in higher resolutions. Thus, it is obvious that video compression technologies play a key role in the distribution of video content in broadcasting. In this paper, the video compression comparisons take into account the encoding or decoding time which is needed for each compression standard, in order to provide evidence about their adaptation under real-time streaming conditions. The video test sequences used in our experiments were retrieved from miscellaneous sources and their common characteristic is that they have High or Ultra High Definition resolution. Video codecs' performance was tested by using commercial coding libraries and reference software of the coding standards.","PeriodicalId":153290,"journal":{"name":"2020 2nd International Conference on Computer Communication and the Internet (ICCCI)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134161347","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 : 2020-06-01DOI: 10.1109/ICCCI49374.2020.9145974
Dae-Hwi Lee, Imyeong Lee
Recently, researches on lightweight cryptosystems for the IoT (Internet of Things) environment have been continuously conducted. Among the public key cryptosystems, ID-based cryptography has the advantage of verify the public key by using an identifier in the form of a public key. However, a key escrow problem occurs that requires the generation of both public and private key pairs in the Key Generation Center (KGC). To solve this problem, Certificateless Public Key Cryptography (CL-PKC), which is a public key cryptosystem without certificate was proposed. The CL-PKC is actively researched in various cryptography fields such as authentication, key agreement, signature, and encryption. In this paper, we analyze the CLS (Certificateless Signature), a signature scheme using CL-PKC for IoT environment. The existing CLS schemes may have problems such as public key replacement attack due to the weakness of the nonrepudiation function, so we propose a CL-based arbitrated signature scheme, CLAS.
{"title":"An Efficient Certificateless Arbitrated Signature Scheme for IoT Environments","authors":"Dae-Hwi Lee, Imyeong Lee","doi":"10.1109/ICCCI49374.2020.9145974","DOIUrl":"https://doi.org/10.1109/ICCCI49374.2020.9145974","url":null,"abstract":"Recently, researches on lightweight cryptosystems for the IoT (Internet of Things) environment have been continuously conducted. Among the public key cryptosystems, ID-based cryptography has the advantage of verify the public key by using an identifier in the form of a public key. However, a key escrow problem occurs that requires the generation of both public and private key pairs in the Key Generation Center (KGC). To solve this problem, Certificateless Public Key Cryptography (CL-PKC), which is a public key cryptosystem without certificate was proposed. The CL-PKC is actively researched in various cryptography fields such as authentication, key agreement, signature, and encryption. In this paper, we analyze the CLS (Certificateless Signature), a signature scheme using CL-PKC for IoT environment. The existing CLS schemes may have problems such as public key replacement attack due to the weakness of the nonrepudiation function, so we propose a CL-based arbitrated signature scheme, CLAS.","PeriodicalId":153290,"journal":{"name":"2020 2nd International Conference on Computer Communication and the Internet (ICCCI)","volume":"79 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130549345","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 : 2020-06-01DOI: 10.1109/ICCCI49374.2020.9145980
Chia-Wei Chang, Hao-Fan Hsu, Chih-Peng Fan
In this paper, the study aims to reduce the hardware cost by hardware sharing techniques to multiple 4×4 and 8×8 integer discrete cosine transforms for multiple-standard video coding applications. The proposed hardware sharing architecture supports two sizes transforms, i.e. 4×4 and 8×8, for H.264/AVC, AVS, VC-1, MPEG-1/2/4, HEVC, and VP8 video coding standards. The proposed design supports the hardware sharing based multiple forward and inverse transforms. Firstly, the transform matrices are replaced with the well-known matrix expressions, and then the entire transform matrices are decomposed to several sparse matrices. Thus, the computational complexity, the chip area, and the computational time are reduced. By the proposed matrix decomposition algorithm, the sparse transform matrices are decomposed to small ones further for ease and efficient hardware shares. Compared with the individual implementation without shares, the proposed 1-D hardware sharing based multiple forward and inverse transform design reduces additions by 83.5% and shift operations by 60.8%. The gate counts of the hardware sharing based 1-D forward and inverse transform design are 22.2K. The proposed hardware sharing based 2-D transform requires 57.3K gates. The operational frequency is 110.8MHz to satisfy the Full HD (1920×1080@60Hz) specification, and the maximum operational frequency can be up to 200MH.
{"title":"Unified Forward and Inverse Integer Transforms Design with Fast Algorithm Based Hardware Sharing Architecture","authors":"Chia-Wei Chang, Hao-Fan Hsu, Chih-Peng Fan","doi":"10.1109/ICCCI49374.2020.9145980","DOIUrl":"https://doi.org/10.1109/ICCCI49374.2020.9145980","url":null,"abstract":"In this paper, the study aims to reduce the hardware cost by hardware sharing techniques to multiple 4×4 and 8×8 integer discrete cosine transforms for multiple-standard video coding applications. The proposed hardware sharing architecture supports two sizes transforms, i.e. 4×4 and 8×8, for H.264/AVC, AVS, VC-1, MPEG-1/2/4, HEVC, and VP8 video coding standards. The proposed design supports the hardware sharing based multiple forward and inverse transforms. Firstly, the transform matrices are replaced with the well-known matrix expressions, and then the entire transform matrices are decomposed to several sparse matrices. Thus, the computational complexity, the chip area, and the computational time are reduced. By the proposed matrix decomposition algorithm, the sparse transform matrices are decomposed to small ones further for ease and efficient hardware shares. Compared with the individual implementation without shares, the proposed 1-D hardware sharing based multiple forward and inverse transform design reduces additions by 83.5% and shift operations by 60.8%. The gate counts of the hardware sharing based 1-D forward and inverse transform design are 22.2K. The proposed hardware sharing based 2-D transform requires 57.3K gates. The operational frequency is 110.8MHz to satisfy the Full HD (1920×1080@60Hz) specification, and the maximum operational frequency can be up to 200MH.","PeriodicalId":153290,"journal":{"name":"2020 2nd International Conference on Computer Communication and the Internet (ICCCI)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129027485","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
扫码关注我们
求助内容：
应助结果提醒方式：