Pub Date : 2022-08-11DOI: 10.1109/ICCCWorkshops55477.2022.9896651
Jian Zhao, Li Chen
It is known that subfield subcodes of Reed-Solomon (RS) codes include many good codes, such as BCH codes and classical Goppa codes. Extending the subfield subcode discovery from RS codes to the more general algebraic-geometric (AG) codes, this paper investigates the subfield subcodes of one-point elliptic codes, in order to provide an alternative to BCH codes. Lower bounds on the dimension and the minimum distance of these codes are characterized, which behave tight for the medium-to-high rate subfield subcodes of differential elliptic codes. The work will show that subfield subcodes of differential elliptic codes are superior to those of the evaluation ones. Many good codes and even the best known linear codes can be found in the family of these codes. With both the elliptic codes and the RS codes defined over the same field, near maximum likelihood (ML) decoding results show that some binary subfield subcodes of the elliptic codes outperform the similar rate BCH codes.
{"title":"Parameters and Decoding Performance of Subfield Subcodes of One-Point Elliptic Codes","authors":"Jian Zhao, Li Chen","doi":"10.1109/ICCCWorkshops55477.2022.9896651","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops55477.2022.9896651","url":null,"abstract":"It is known that subfield subcodes of Reed-Solomon (RS) codes include many good codes, such as BCH codes and classical Goppa codes. Extending the subfield subcode discovery from RS codes to the more general algebraic-geometric (AG) codes, this paper investigates the subfield subcodes of one-point elliptic codes, in order to provide an alternative to BCH codes. Lower bounds on the dimension and the minimum distance of these codes are characterized, which behave tight for the medium-to-high rate subfield subcodes of differential elliptic codes. The work will show that subfield subcodes of differential elliptic codes are superior to those of the evaluation ones. Many good codes and even the best known linear codes can be found in the family of these codes. With both the elliptic codes and the RS codes defined over the same field, near maximum likelihood (ML) decoding results show that some binary subfield subcodes of the elliptic codes outperform the similar rate BCH codes.","PeriodicalId":148869,"journal":{"name":"2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122873195","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 : 2022-08-11DOI: 10.1109/ICCCWorkshops55477.2022.9896665
Jin Li, Nan Liu
Integrated sensing and communication (ISAC) unifies radar sensing and communication, and improves the efficiency of the spectrum, energy and hardware. In this paper, we investigate the ISAC beamforming design in a downlink system with a communication user and a point radar target to be perceived. The design criterion for radar sensing is the mutual information between the target response matrix and the echo signals, while the single user transmission rate is used as the performance metric of the communication. Two scenarios without and with interference from the communication user are investigated. A closed-form solution with low complexity and a solution based on the semidefinite relaxation (SDR) method are provided to solve these two problems, respectively. Numerical results demonstrate that, compared to the results obtained by SDR based on the CVX toolbox, the closed-form solution is tight in the feasible region. In addition, we show that the SDR method obtains an optimal solution.
{"title":"Integrated Sensing and Communication Beamforming Design Based on Mutual Information","authors":"Jin Li, Nan Liu","doi":"10.1109/ICCCWorkshops55477.2022.9896665","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops55477.2022.9896665","url":null,"abstract":"Integrated sensing and communication (ISAC) unifies radar sensing and communication, and improves the efficiency of the spectrum, energy and hardware. In this paper, we investigate the ISAC beamforming design in a downlink system with a communication user and a point radar target to be perceived. The design criterion for radar sensing is the mutual information between the target response matrix and the echo signals, while the single user transmission rate is used as the performance metric of the communication. Two scenarios without and with interference from the communication user are investigated. A closed-form solution with low complexity and a solution based on the semidefinite relaxation (SDR) method are provided to solve these two problems, respectively. Numerical results demonstrate that, compared to the results obtained by SDR based on the CVX toolbox, the closed-form solution is tight in the feasible region. In addition, we show that the SDR method obtains an optimal solution.","PeriodicalId":148869,"journal":{"name":"2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116993554","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 : 2022-08-11DOI: 10.1109/ICCCWorkshops55477.2022.9896714
Yuqi Leng, Ruiqi Zhang, Wenkun Wen, Peiran Wu, M. Xia
Physical-layer authentication (PLA) is capable of providing lightweight security solutions for the next-generation Internet of Things (IoT) networks. This paper adopts and modifies the spreading code authentication techniques originally designed for the Global Navigation Satellite System to apply PLA to narrowband IoT networks. In particular, two watermarking schemes including single- and multi-frame watermarking are developed to replace chip values in the spreading code segment for the PHY-layer preamble. In the single-frame scheme, a whole watermark sequence is embedded into one single frame in a preamble-bit-wise manner, with a randomly generated set of indices indicating the position of the watermarked segments, and the receiver makes a correlation test to make authentication decisions once receiving a message. In the multi-frame scheme, a watermark sequence is split and periodically embedded into several frames, and the receiver conducts joint authentication for these frames. Simulation results of single-frame watermarking along with the prototype validation of multi-frame watermarking based on the GNU Radio/USRP SDR platform corroborate the effectiveness of both schemes.
{"title":"Physical- Layer Authentication based on Spreading Code Watermarking for IoT Networks","authors":"Yuqi Leng, Ruiqi Zhang, Wenkun Wen, Peiran Wu, M. Xia","doi":"10.1109/ICCCWorkshops55477.2022.9896714","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops55477.2022.9896714","url":null,"abstract":"Physical-layer authentication (PLA) is capable of providing lightweight security solutions for the next-generation Internet of Things (IoT) networks. This paper adopts and modifies the spreading code authentication techniques originally designed for the Global Navigation Satellite System to apply PLA to narrowband IoT networks. In particular, two watermarking schemes including single- and multi-frame watermarking are developed to replace chip values in the spreading code segment for the PHY-layer preamble. In the single-frame scheme, a whole watermark sequence is embedded into one single frame in a preamble-bit-wise manner, with a randomly generated set of indices indicating the position of the watermarked segments, and the receiver makes a correlation test to make authentication decisions once receiving a message. In the multi-frame scheme, a watermark sequence is split and periodically embedded into several frames, and the receiver conducts joint authentication for these frames. Simulation results of single-frame watermarking along with the prototype validation of multi-frame watermarking based on the GNU Radio/USRP SDR platform corroborate the effectiveness of both schemes.","PeriodicalId":148869,"journal":{"name":"2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128064022","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 : 2022-08-11DOI: 10.1109/ICCCWorkshops55477.2022.9896689
Hao Li, Chen Sun, Shuo Wang
A key benefit of integrated access and backhaul (IAB) is enabling flexible and very dense deployment of NR cells without densifying the transport network proportionately. In mobile IAB (mIAB) networks, due to the large-scale deployment of mIAB nodes, lightly loaded nodes or even nodes without service objects may cause unnecessary energy consumption and interference with the surrounding IAB nodes. However, the existing UE transition methods and activation trigger methods from the connected state to the inactive state are not suitable for mIAB nodes. In addition, due to the mobility of mIAB nodes, a longer activation time of nodes lead to a more serious degradation of the user quality of service. Therefore, in this paper, we study the deactivation and activation mechanism of mIAB nodes, and the conditions that trigger the activation of mIAB nodes. At last, the efficient state transition of mIAB nodes is considered.
{"title":"Mobile Integrated Access and Backhaul: Potential Power Saving Issues and Solutions","authors":"Hao Li, Chen Sun, Shuo Wang","doi":"10.1109/ICCCWorkshops55477.2022.9896689","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops55477.2022.9896689","url":null,"abstract":"A key benefit of integrated access and backhaul (IAB) is enabling flexible and very dense deployment of NR cells without densifying the transport network proportionately. In mobile IAB (mIAB) networks, due to the large-scale deployment of mIAB nodes, lightly loaded nodes or even nodes without service objects may cause unnecessary energy consumption and interference with the surrounding IAB nodes. However, the existing UE transition methods and activation trigger methods from the connected state to the inactive state are not suitable for mIAB nodes. In addition, due to the mobility of mIAB nodes, a longer activation time of nodes lead to a more serious degradation of the user quality of service. Therefore, in this paper, we study the deactivation and activation mechanism of mIAB nodes, and the conditions that trigger the activation of mIAB nodes. At last, the efficient state transition of mIAB nodes is considered.","PeriodicalId":148869,"journal":{"name":"2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127379247","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 : 2022-08-11DOI: 10.1109/ICCCWorkshops55477.2022.9896639
Yilin Lin, Yuqin Liu, Yufeng He, Ling Tang
Network architecture research is a hot area of current 6G research. This paper firstly discusses the trend of 6G network towards a hierarchical and distributed architecture, starting from the two aspects of 6G evolution requirements and the current limitations of 5G. Then, this paper proposes a hierarchical and distributed network architecture vision. The 6G hierarchical and distributed network architecture will carry out function reconstruction, boundary reconstruction, trust reconstruction and bearer reconstruction based on the current 5G network, and will have the following features: flexible and dynamic generation on demand, hierarchical and distributed collaboration, deep integration of network and edge, etc. Finally, the simulation results demonstrate that the reliability and delay characteristics can be further improved through the distributed deployment of the end-to-end network.
{"title":"6G: A Hierarchical and Distributed Network","authors":"Yilin Lin, Yuqin Liu, Yufeng He, Ling Tang","doi":"10.1109/ICCCWorkshops55477.2022.9896639","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops55477.2022.9896639","url":null,"abstract":"Network architecture research is a hot area of current 6G research. This paper firstly discusses the trend of 6G network towards a hierarchical and distributed architecture, starting from the two aspects of 6G evolution requirements and the current limitations of 5G. Then, this paper proposes a hierarchical and distributed network architecture vision. The 6G hierarchical and distributed network architecture will carry out function reconstruction, boundary reconstruction, trust reconstruction and bearer reconstruction based on the current 5G network, and will have the following features: flexible and dynamic generation on demand, hierarchical and distributed collaboration, deep integration of network and edge, etc. Finally, the simulation results demonstrate that the reliability and delay characteristics can be further improved through the distributed deployment of the end-to-end network.","PeriodicalId":148869,"journal":{"name":"2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123072001","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 : 2022-08-11DOI: 10.1109/ICCCWorkshops55477.2022.9896679
Lijia Yang, Wenhao Chen, Li Chen
This paper proposes a reduced complexity ordered statistics decoding (OSD) algorithm for linear block codes. With the received information, several most reliable positions in the ordered reliability sequence are prioritized as the validation band (VB). The Gaussian elimination (GE) is then performed to generate the systematic generator matrix of the code. In the process of re-encoding, only the test messages that satisfy the validation rule would be used to generate the codeword candidates, resulting in a low decoding complexity. The decoding error probability upper bound of the proposed OSD is further analyzed to characterize its performance-complexity trade off. Our simulation results show that the proposed OSD can significantly reduce the decoding complexity with a negligible loss in the decoding performance.
{"title":"Reduced Complexity Ordered Statistics Decoding of Linear Block Codes","authors":"Lijia Yang, Wenhao Chen, Li Chen","doi":"10.1109/ICCCWorkshops55477.2022.9896679","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops55477.2022.9896679","url":null,"abstract":"This paper proposes a reduced complexity ordered statistics decoding (OSD) algorithm for linear block codes. With the received information, several most reliable positions in the ordered reliability sequence are prioritized as the validation band (VB). The Gaussian elimination (GE) is then performed to generate the systematic generator matrix of the code. In the process of re-encoding, only the test messages that satisfy the validation rule would be used to generate the codeword candidates, resulting in a low decoding complexity. The decoding error probability upper bound of the proposed OSD is further analyzed to characterize its performance-complexity trade off. Our simulation results show that the proposed OSD can significantly reduce the decoding complexity with a negligible loss in the decoding performance.","PeriodicalId":148869,"journal":{"name":"2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128919746","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 : 2022-08-11DOI: 10.1109/ICCCWorkshops55477.2022.9896690
Haojun Liu, Dexin Qu, Gengxin Zhang, Jiahong Li
Satellite search and rescue positioning technology can provide effective means for mountain areas, deserts, oceans and other areas lacking communication infrastructure, which has attracted more attention recently. In this paper, we propose a joint time-frequency difference optimal location method for satellite search and rescue system to improve the performance of parameter estimation and location solution in the traditional passive dual satellite time-frequency difference location technology. Specifically, the fast Fourier transform is used to simplify the joint estimation of the time-frequency difference of the cross ambiguity function. Aiming at the burst low duty cycle transmission of search and rescue signals, a time-domain windowed comprehensive cross ambiguity function calculation model is proposed. Finally, a genetic algorithm is proposed to solve the positioning equation. Simulation results show that, compared with traditional methods, the proposed algorithm can improve the system fault tolerance and positioning accuracy, and reduce the computational complexity.
{"title":"Joint optimal positioning method of time-frequency difference for satellite search and rescue system","authors":"Haojun Liu, Dexin Qu, Gengxin Zhang, Jiahong Li","doi":"10.1109/ICCCWorkshops55477.2022.9896690","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops55477.2022.9896690","url":null,"abstract":"Satellite search and rescue positioning technology can provide effective means for mountain areas, deserts, oceans and other areas lacking communication infrastructure, which has attracted more attention recently. In this paper, we propose a joint time-frequency difference optimal location method for satellite search and rescue system to improve the performance of parameter estimation and location solution in the traditional passive dual satellite time-frequency difference location technology. Specifically, the fast Fourier transform is used to simplify the joint estimation of the time-frequency difference of the cross ambiguity function. Aiming at the burst low duty cycle transmission of search and rescue signals, a time-domain windowed comprehensive cross ambiguity function calculation model is proposed. Finally, a genetic algorithm is proposed to solve the positioning equation. Simulation results show that, compared with traditional methods, the proposed algorithm can improve the system fault tolerance and positioning accuracy, and reduce the computational complexity.","PeriodicalId":148869,"journal":{"name":"2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122682610","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}
Orthogonal time frequency space (OTFS) systems can effectively balance the Doppler shift by transforming the channel with a drastic change in the time-frequency (TF) domain into a stable channel in the delay-Doppler (DD) domain. In order to take full advantage of the OTFS system, accurate channel estimation results are critical in OTFS systems. In this paper, a model-driven deep learning (DL)-based channel estimation technique is proposed for OTFS in the DD domain. The presented channel estimation scheme has two parts. The first part takes advantage of the traditional orthogonal matching pursuit (OMP) algorithm to generate preliminary channel estimation results. The second part uses a deep residual learning network (ResNet) to further process the rough estimation results to get an accurate OTFS channel estimation. Simulation results demonstrate that the performance of the proposed model-driven ResNet-based scheme is significantly better than the traditional OMP algorithm, and there is about 6dB performance gain when the size of an OTFS frame is 128×16 and the normalized mean squared error (NMSE) is 0.00173. It also proves that the proposed ResNet-based channel estimation scheme can be applied to different scenarios and achieve good robustness.
{"title":"Residual Learning based Channel Estimation for OTFS system","authors":"Qingyu Li, Yi Gong, Fanke Meng, Zhongjie Li, Linlong Miao, Zhan Xu","doi":"10.1109/ICCCWorkshops55477.2022.9896637","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops55477.2022.9896637","url":null,"abstract":"Orthogonal time frequency space (OTFS) systems can effectively balance the Doppler shift by transforming the channel with a drastic change in the time-frequency (TF) domain into a stable channel in the delay-Doppler (DD) domain. In order to take full advantage of the OTFS system, accurate channel estimation results are critical in OTFS systems. In this paper, a model-driven deep learning (DL)-based channel estimation technique is proposed for OTFS in the DD domain. The presented channel estimation scheme has two parts. The first part takes advantage of the traditional orthogonal matching pursuit (OMP) algorithm to generate preliminary channel estimation results. The second part uses a deep residual learning network (ResNet) to further process the rough estimation results to get an accurate OTFS channel estimation. Simulation results demonstrate that the performance of the proposed model-driven ResNet-based scheme is significantly better than the traditional OMP algorithm, and there is about 6dB performance gain when the size of an OTFS frame is 128×16 and the normalized mean squared error (NMSE) is 0.00173. It also proves that the proposed ResNet-based channel estimation scheme can be applied to different scenarios and achieve good robustness.","PeriodicalId":148869,"journal":{"name":"2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127631562","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 : 2022-08-11DOI: 10.1109/ICCCWorkshops55477.2022.9896472
Yuxia Niu, Song Zhao, X. She, Peng Chen
The objective of this paper is to identify and specify potential key issues and potential solutions for management of Network Data Analytics function (NWDAF). Specifically, this paper shall address the following potential key issues on 3GPP: (1) whether and how to enhance NRM to support the deployment of multiple NWDAFs and logical function decomposition of NWDAF, (2) how to provide performance management of the NWDAF on interaction aspect, data collection aspect, output aspect and efficiency aspect. This paper aims to provide a survey of management of NWDAF on 3GPP, including some potential key issues and potential solutions, with a view to further promoting the development of the technologies of NWDAF management on 3GPP.
{"title":"A Survey of 3GPP Release 18 on Network Data Analytics Function Management","authors":"Yuxia Niu, Song Zhao, X. She, Peng Chen","doi":"10.1109/ICCCWorkshops55477.2022.9896472","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops55477.2022.9896472","url":null,"abstract":"The objective of this paper is to identify and specify potential key issues and potential solutions for management of Network Data Analytics function (NWDAF). Specifically, this paper shall address the following potential key issues on 3GPP: (1) whether and how to enhance NRM to support the deployment of multiple NWDAFs and logical function decomposition of NWDAF, (2) how to provide performance management of the NWDAF on interaction aspect, data collection aspect, output aspect and efficiency aspect. This paper aims to provide a survey of management of NWDAF on 3GPP, including some potential key issues and potential solutions, with a view to further promoting the development of the technologies of NWDAF management on 3GPP.","PeriodicalId":148869,"journal":{"name":"2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130887622","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}
In the process of building data warehouse based on Data Vault (DV), the creation and use of metadata involve multiple schemas and views of data from different sources, which inevitably bring inconsistency problems such as metadata missing, duplication and disconnection. However, due to the lack of precise semantics in DV metamodel, it is difficult to use automatic logical reasoning to detect these problems. This paper presents a formal logic DLdv in the describing logic family. Formalization upon the metamodel and metadata of DV data warehouse are analyzed in detail by using the descriptive logic DLdv. It is proved that the feasibility of applying DLdv to DV metamodel for automatically consistency reasoning.
{"title":"Consistency Reasoning for Data Warehouse Metadata Based on Data Vault","authors":"Xinyao Feng, Zewu Peng, Haowen Ren, Hanyang Xie, Jinhe Wang, Taipeng Zhu, Yingwei Liang, Ding Pan","doi":"10.1109/ICCCWorkshops55477.2022.9896668","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops55477.2022.9896668","url":null,"abstract":"In the process of building data warehouse based on Data Vault (DV), the creation and use of metadata involve multiple schemas and views of data from different sources, which inevitably bring inconsistency problems such as metadata missing, duplication and disconnection. However, due to the lack of precise semantics in DV metamodel, it is difficult to use automatic logical reasoning to detect these problems. This paper presents a formal logic DLdv in the describing logic family. Formalization upon the metamodel and metadata of DV data warehouse are analyzed in detail by using the descriptive logic DLdv. It is proved that the feasibility of applying DLdv to DV metamodel for automatically consistency reasoning.","PeriodicalId":148869,"journal":{"name":"2022 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"464 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131681312","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
扫码关注我们
求助内容：
应助结果提醒方式：