Pub Date : 2022-11-04DOI: 10.1080/24751839.2022.2129133
L. Bobrowski, Paweł Zabielski
ABSTRACT Pattern recognition procedures operate on data represented as sets of multidimensional feature vectors. A small sample of data appears when the dimension of the feature vectors (number of features) is much larger than the number of feature vectors (objects). Small datasets often emerge in practice, for example in genetics. The design of classification or prognostic models on small data sets requires the development of new types of methods. Methods based on L 1 geometry can play an important role in this regard.
{"title":"Classification model with collinear grouping of features","authors":"L. Bobrowski, Paweł Zabielski","doi":"10.1080/24751839.2022.2129133","DOIUrl":"https://doi.org/10.1080/24751839.2022.2129133","url":null,"abstract":"ABSTRACT Pattern recognition procedures operate on data represented as sets of multidimensional feature vectors. A small sample of data appears when the dimension of the feature vectors (number of features) is much larger than the number of feature vectors (objects). Small datasets often emerge in practice, for example in genetics. The design of classification or prognostic models on small data sets requires the development of new types of methods. Methods based on L 1 geometry can play an important role in this regard.","PeriodicalId":32180,"journal":{"name":"Journal of Information and Telecommunication","volume":"7 1","pages":"73 - 88"},"PeriodicalIF":2.7,"publicationDate":"2022-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47028243","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-10-31DOI: 10.1080/24751839.2022.2132586
Franck Leprévost, A. O. Topal, Elmir Avdusinovic, Raluca Chitic
ABSTRACT To perform image recognition, Convolutional Neural Networks (CNNs) assess any image by first resizing it to its input size. In particular, high-resolution images are scaled down, say to for CNNs trained on ImageNet. So far, existing attacks, aiming at creating an adversarial image that a CNN would misclassify while a human would not notice any difference between the modified and unmodified images, proceed by creating adversarial noise in the resized domain and not in the high-resolution domain. The complexity of directly attacking high-resolution images leads to challenges in terms of speed, adversity and visual quality, making these attacks infeasible in practice. We design an indirect attack strategy that lifts to the high-resolution domain any existing attack that works efficiently in the CNN's input size domain. Adversarial noise created via this method is of the same size as the original image. We apply this approach to 10 state-of-the-art CNNs trained on ImageNet, with an evolutionary algorithm-based attack. Our method succeeded in 900 out of 1000 trials to create such adversarial images, that CNNs classify with probability in the adversarial category. Our indirect attack is the first effective method at creating adversarial images in the high-resolution domain.
{"title":"A strategy creating high-resolution adversarial images against convolutional neural networks and a feasibility study on 10 CNNs","authors":"Franck Leprévost, A. O. Topal, Elmir Avdusinovic, Raluca Chitic","doi":"10.1080/24751839.2022.2132586","DOIUrl":"https://doi.org/10.1080/24751839.2022.2132586","url":null,"abstract":"ABSTRACT To perform image recognition, Convolutional Neural Networks (CNNs) assess any image by first resizing it to its input size. In particular, high-resolution images are scaled down, say to for CNNs trained on ImageNet. So far, existing attacks, aiming at creating an adversarial image that a CNN would misclassify while a human would not notice any difference between the modified and unmodified images, proceed by creating adversarial noise in the resized domain and not in the high-resolution domain. The complexity of directly attacking high-resolution images leads to challenges in terms of speed, adversity and visual quality, making these attacks infeasible in practice. We design an indirect attack strategy that lifts to the high-resolution domain any existing attack that works efficiently in the CNN's input size domain. Adversarial noise created via this method is of the same size as the original image. We apply this approach to 10 state-of-the-art CNNs trained on ImageNet, with an evolutionary algorithm-based attack. Our method succeeded in 900 out of 1000 trials to create such adversarial images, that CNNs classify with probability in the adversarial category. Our indirect attack is the first effective method at creating adversarial images in the high-resolution domain.","PeriodicalId":32180,"journal":{"name":"Journal of Information and Telecommunication","volume":"7 1","pages":"89 - 119"},"PeriodicalIF":2.7,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44181029","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-10-06DOI: 10.1080/24751839.2022.2128249
Tran Anh Khoa, Pham Duc Lam, N. H. Nam
ABSTRACT With the continuous development of a society in which construction works are ubiquitous, investors often accelerate the progress of construction projects and may neglect to follow the proposed construction processes. As a result, construction works decrease in durability and become more susceptible to cracking, breakages, or collapse, resulting in significant damage to people and property. Meanwhile, labour to monitor the progress of works is often time-consuming, effortful, prone to errors, and vulnerable to risk. This study introduces a system that uses a Wireless Sensor Network (WSN) consisting of a laser-ranging Time-of-Flight (ToF) sensor module for structural crack monitoring in architecture. The proposed system collects data on the variation in amplitude of an existing crack as well as environmental factors that can adversely affect cracks such as temperature, humidity, and vibration. This aids the assessment of safety levels by providing warnings and remedies as quickly as possible, contributing to raising the safety level for workers and people living in the area, and minimizing potential damage. Test results demonstrate the following advantages: the device operates stably in extreme weather conditions; has an expected lifetime of more than ten years; and features high accuracy, long data transmission, and low-cost, low-power operation.
{"title":"An efficient energy measurement system based on the TOF sensor for structural crack monitoring in architecture","authors":"Tran Anh Khoa, Pham Duc Lam, N. H. Nam","doi":"10.1080/24751839.2022.2128249","DOIUrl":"https://doi.org/10.1080/24751839.2022.2128249","url":null,"abstract":"ABSTRACT With the continuous development of a society in which construction works are ubiquitous, investors often accelerate the progress of construction projects and may neglect to follow the proposed construction processes. As a result, construction works decrease in durability and become more susceptible to cracking, breakages, or collapse, resulting in significant damage to people and property. Meanwhile, labour to monitor the progress of works is often time-consuming, effortful, prone to errors, and vulnerable to risk. This study introduces a system that uses a Wireless Sensor Network (WSN) consisting of a laser-ranging Time-of-Flight (ToF) sensor module for structural crack monitoring in architecture. The proposed system collects data on the variation in amplitude of an existing crack as well as environmental factors that can adversely affect cracks such as temperature, humidity, and vibration. This aids the assessment of safety levels by providing warnings and remedies as quickly as possible, contributing to raising the safety level for workers and people living in the area, and minimizing potential damage. Test results demonstrate the following advantages: the device operates stably in extreme weather conditions; has an expected lifetime of more than ten years; and features high accuracy, long data transmission, and low-cost, low-power operation.","PeriodicalId":32180,"journal":{"name":"Journal of Information and Telecommunication","volume":"7 1","pages":"56 - 72"},"PeriodicalIF":2.7,"publicationDate":"2022-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42640149","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-09-30DOI: 10.1080/24751839.2022.2118098
Sylwia Biełaszek, Kamil Piętak, Marek Kisiel-Dorohinicki
ABSTRACT Agent-based evolutionary, computational systems have been proven to be an efficient concept for solving complex computational problems. This paper is an extension of [Biełaszek, S., Piętak, K., & Kisiel-Dorohinicki, M. (2021). New extensions of reproduction operators in solving LABS problem using EMAS meta-heuristic. Springer, cop. 2021. – Lecture Notes in Artificial Intelligence, Computational collective intelligence 12876 304-316. 13th International Conference, ICCCI 2021: Rhodes, Greece, September 29ŰOctober 1, 2021.] where we proposed new variants of reproduction operators together with new heuristics for the generation of initial population, dedicated to LABS – a hard discrete optimization problem. In this research, we verify if the proposed recombination operators improve EMAS efficiency also with different local optimization techniques such as Tabu Search and Self-avoiding walk, and therefore can be seen as better recombination operators dedicated to LABS problem in general. This paper recalls the definition of new recombination variants dedicated to LABS and verify if they can be successfully used in many different evolutionary configurations.
{"title":"Reproduction operators in solving LABS problem using EMAS meta-heuristic with various local optimization techniques","authors":"Sylwia Biełaszek, Kamil Piętak, Marek Kisiel-Dorohinicki","doi":"10.1080/24751839.2022.2118098","DOIUrl":"https://doi.org/10.1080/24751839.2022.2118098","url":null,"abstract":"ABSTRACT Agent-based evolutionary, computational systems have been proven to be an efficient concept for solving complex computational problems. This paper is an extension of [Biełaszek, S., Piętak, K., & Kisiel-Dorohinicki, M. (2021). New extensions of reproduction operators in solving LABS problem using EMAS meta-heuristic. Springer, cop. 2021. – Lecture Notes in Artificial Intelligence, Computational collective intelligence 12876 304-316. 13th International Conference, ICCCI 2021: Rhodes, Greece, September 29ŰOctober 1, 2021.] where we proposed new variants of reproduction operators together with new heuristics for the generation of initial population, dedicated to LABS – a hard discrete optimization problem. In this research, we verify if the proposed recombination operators improve EMAS efficiency also with different local optimization techniques such as Tabu Search and Self-avoiding walk, and therefore can be seen as better recombination operators dedicated to LABS problem in general. This paper recalls the definition of new recombination variants dedicated to LABS and verify if they can be successfully used in many different evolutionary configurations.","PeriodicalId":32180,"journal":{"name":"Journal of Information and Telecommunication","volume":"7 1","pages":"29 - 43"},"PeriodicalIF":2.7,"publicationDate":"2022-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47772169","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-09-26DOI: 10.1080/24751839.2022.2122301
M. Kedziora, Dawid Pieprzka, I. Józwiak, Yongxin Liu, H. Song
ABSTRACT The purpose of this paper is to present mechanisms and algorithms implemented for improving Bitcoin cryptocurrency efficiency and security and to examine the block propagation times from a selected period before and after SegWit was introduced. In this paper, Segregated Witness Implementation issues were verified based both on the simulation and real data from the Bitcoin network. Based on the block propagation times calculated in the simulator, as well as bitcoin network real data, the efficiency and safety of Bitcoin have been analysed and validated.
{"title":"Analysis of segregated witness implementation for increasing efficiency and security of the Bitcoin cryptocurrency","authors":"M. Kedziora, Dawid Pieprzka, I. Józwiak, Yongxin Liu, H. Song","doi":"10.1080/24751839.2022.2122301","DOIUrl":"https://doi.org/10.1080/24751839.2022.2122301","url":null,"abstract":"ABSTRACT The purpose of this paper is to present mechanisms and algorithms implemented for improving Bitcoin cryptocurrency efficiency and security and to examine the block propagation times from a selected period before and after SegWit was introduced. In this paper, Segregated Witness Implementation issues were verified based both on the simulation and real data from the Bitcoin network. Based on the block propagation times calculated in the simulator, as well as bitcoin network real data, the efficiency and safety of Bitcoin have been analysed and validated.","PeriodicalId":32180,"journal":{"name":"Journal of Information and Telecommunication","volume":"7 1","pages":"44 - 55"},"PeriodicalIF":2.7,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49464004","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-09-15DOI: 10.1080/24751839.2022.2117068
A. Rahim, P. Malik, Rajesh Singh
ABSTRACT In this paper, fractal geometry-based two-printed antenna structures are proposed for vehicular communication in 5G wireless communication networks. Initially, a 48 × 39 mm2 single element fractal patch antenna is designed and tested which shows dual-band resonance at around 28.1 and 32.5 GHz. In order to improve different antenna characteristic number of fractal radiating elements have been increased to four and constructed an array of patches such that it can be used for multiple applications in the field of vehicular communications. The proposed array model is fabricated on a Rogers RT duroid 5880tm material of size 115 × 82 mm2 and tested using Agilent Technologies N5247A VNA. The measured results confirm the validity of the designed model for intended applications. The proposed array antenna operates at distinct quintuple bands in the frequency range of 25–36 GHz for vehicular communication within the proposed lower fifth generation (5G) channel. The proposed array configuration shows a good peak gain of 6.72 dB within the operating bands.
{"title":"Fractal geometry-based chakra-shaped microstrip patch antenna array for vehicular communications under 5G environments","authors":"A. Rahim, P. Malik, Rajesh Singh","doi":"10.1080/24751839.2022.2117068","DOIUrl":"https://doi.org/10.1080/24751839.2022.2117068","url":null,"abstract":"ABSTRACT In this paper, fractal geometry-based two-printed antenna structures are proposed for vehicular communication in 5G wireless communication networks. Initially, a 48 × 39 mm2 single element fractal patch antenna is designed and tested which shows dual-band resonance at around 28.1 and 32.5 GHz. In order to improve different antenna characteristic number of fractal radiating elements have been increased to four and constructed an array of patches such that it can be used for multiple applications in the field of vehicular communications. The proposed array model is fabricated on a Rogers RT duroid 5880tm material of size 115 × 82 mm2 and tested using Agilent Technologies N5247A VNA. The measured results confirm the validity of the designed model for intended applications. The proposed array antenna operates at distinct quintuple bands in the frequency range of 25–36 GHz for vehicular communication within the proposed lower fifth generation (5G) channel. The proposed array configuration shows a good peak gain of 6.72 dB within the operating bands.","PeriodicalId":32180,"journal":{"name":"Journal of Information and Telecommunication","volume":"6 1","pages":"482 - 500"},"PeriodicalIF":2.7,"publicationDate":"2022-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44052936","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}
ABSTRACT This paper deals with resource allocation challenge focusing on Infrastructure Providers (InPs) and Service Providers (SPs) in virtual network environments. In such environments, resources (storage space, bandwidth, CPU, …) can be reallocated easily between users, involving Cloud services widespread. However, while these resources come from physical network, the allocations are constrained. To maintain on demand resources provisioning, service providers must frequently deal with many parameters (use duration, price, availability, fidelity, …) which involve unfair and non-optimal allocation scheme. We propose two game theory-based solutions that allow physical infrastructure providers to assign resources to service providers. Whereas literature works consider only one type of resource, we consider several types, such as storage space, bandwidth, RAM and processor. We design a set of non-cooperative games between physical infrastructure providers and service providers. Simulation results show that our solutions optimize resource usage and service quality compared to the literature.
{"title":"Game theory-based dynamic resource allocations scheme in virtual networks","authors":"Vianney Kengne Tchendji, Yannick Florian Yankam, Ines Carole Kombou Sihomnou","doi":"10.1080/24751839.2022.2117125","DOIUrl":"https://doi.org/10.1080/24751839.2022.2117125","url":null,"abstract":"ABSTRACT This paper deals with resource allocation challenge focusing on Infrastructure Providers (InPs) and Service Providers (SPs) in virtual network environments. In such environments, resources (storage space, bandwidth, CPU, …) can be reallocated easily between users, involving Cloud services widespread. However, while these resources come from physical network, the allocations are constrained. To maintain on demand resources provisioning, service providers must frequently deal with many parameters (use duration, price, availability, fidelity, …) which involve unfair and non-optimal allocation scheme. We propose two game theory-based solutions that allow physical infrastructure providers to assign resources to service providers. Whereas literature works consider only one type of resource, we consider several types, such as storage space, bandwidth, RAM and processor. We design a set of non-cooperative games between physical infrastructure providers and service providers. Simulation results show that our solutions optimize resource usage and service quality compared to the literature.","PeriodicalId":32180,"journal":{"name":"Journal of Information and Telecommunication","volume":"7 1","pages":"1 - 28"},"PeriodicalIF":2.7,"publicationDate":"2022-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45364978","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-09-09DOI: 10.1080/24751839.2022.2117121
A. Talukder, Md. Anisul Islam Mahmud, Arbiya Sultana, Tahmid Hasan Pranto, A. B. Haque, R. Rahman
ABSTRACT Food delivery systems are gaining popularity recently due to the expansion of internet connectivity and for the increasing availability of devices. The growing popularity of such systems has raised concerns regarding (i) Information security, (ii) Business to business (B2B) deep discounting race, and (iii) Strict policy enforcement. Sensitive personal data and financial information of the users must be safeguarded. Additionally, in pursuit of gaining profit, the restaurants tend to offer deep discounts resulting in a higher volume of orders than usual. Therefore, the restaurants and the delivery persons fail to maintain the delivery time and often impair the food quality. In this paper, we have proposed a blockchain and smart contract-based food delivery system to address these issues. The main goal is to remove commission schemes and decrease service delays caused by a high volume of orders. The protocols have been deployed and tested on the Ethereum test network. The simulation manifests a successful implementation of our desired system; with the payment being controlled by our system. The actors (restaurant, delivery-person or consumer) are bound to be compliant with the policies or penalized otherwise.
{"title":"A customer satisfaction centric food delivery system based on blockchain and smart contract","authors":"A. Talukder, Md. Anisul Islam Mahmud, Arbiya Sultana, Tahmid Hasan Pranto, A. B. Haque, R. Rahman","doi":"10.1080/24751839.2022.2117121","DOIUrl":"https://doi.org/10.1080/24751839.2022.2117121","url":null,"abstract":"ABSTRACT Food delivery systems are gaining popularity recently due to the expansion of internet connectivity and for the increasing availability of devices. The growing popularity of such systems has raised concerns regarding (i) Information security, (ii) Business to business (B2B) deep discounting race, and (iii) Strict policy enforcement. Sensitive personal data and financial information of the users must be safeguarded. Additionally, in pursuit of gaining profit, the restaurants tend to offer deep discounts resulting in a higher volume of orders than usual. Therefore, the restaurants and the delivery persons fail to maintain the delivery time and often impair the food quality. In this paper, we have proposed a blockchain and smart contract-based food delivery system to address these issues. The main goal is to remove commission schemes and decrease service delays caused by a high volume of orders. The protocols have been deployed and tested on the Ethereum test network. The simulation manifests a successful implementation of our desired system; with the payment being controlled by our system. The actors (restaurant, delivery-person or consumer) are bound to be compliant with the policies or penalized otherwise.","PeriodicalId":32180,"journal":{"name":"Journal of Information and Telecommunication","volume":"6 1","pages":"501 - 524"},"PeriodicalIF":2.7,"publicationDate":"2022-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43163927","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-05-20DOI: 10.1080/24751839.2022.2043594
Gülay Canbaloglu, J. Treur
ABSTRACT In this paper, equilibrium analysis for network models is addressed and applied in particular to a network model of multilevel organisational learning. The equilibrium analysis addresses properties of aggregation characteristics and connectivity characteristics of a network. For aggregation characteristics, it is shown how certain classes of nonlinear functions enable equilibrium analysis of the emerging dynamics within the network like linear functions do. For connectivity characteristics, by using a form of stratification for the network's strongly connected components, it is shown how equilibrium analysis results can be obtained relating equilibrium values in any component to equilibrium values in (independent) components without incoming connections. In addition, concerning aggregation characteristics, two specific types of nonlinear functions for aggregation in networks (weighted euclidean functions and weighted geometric functions) are analysed. It is illustrated in detail how by using certain function transformations also methods for equilibrium analysis based on a symbolic linear equation solver, can be applied to make predictions about equilibrium values for them. All these results are applied to a network model for organisational learning. Finally, it is analysed in some depth how the function transformations applied can be described by the more general notion of function conjugate relation, also often used for coordinate transformations.
{"title":"Equilibrium analysis for linear and nonlinear aggregation in network models: applied to mental model aggregation in multilevel organisational learning","authors":"Gülay Canbaloglu, J. Treur","doi":"10.1080/24751839.2022.2043594","DOIUrl":"https://doi.org/10.1080/24751839.2022.2043594","url":null,"abstract":"ABSTRACT\u0000 In this paper, equilibrium analysis for network models is addressed and applied in particular to a network model of multilevel organisational learning. The equilibrium analysis addresses properties of aggregation characteristics and connectivity characteristics of a network. For aggregation characteristics, it is shown how certain classes of nonlinear functions enable equilibrium analysis of the emerging dynamics within the network like linear functions do. For connectivity characteristics, by using a form of stratification for the network's strongly connected components, it is shown how equilibrium analysis results can be obtained relating equilibrium values in any component to equilibrium values in (independent) components without incoming connections. In addition, concerning aggregation characteristics, two specific types of nonlinear functions for aggregation in networks (weighted euclidean functions and weighted geometric functions) are analysed. It is illustrated in detail how by using certain function transformations also methods for equilibrium analysis based on a symbolic linear equation solver, can be applied to make predictions about equilibrium values for them. All these results are applied to a network model for organisational learning. Finally, it is analysed in some depth how the function transformations applied can be described by the more general notion of function conjugate relation, also often used for coordinate transformations.","PeriodicalId":32180,"journal":{"name":"Journal of Information and Telecommunication","volume":"6 1","pages":"289 - 340"},"PeriodicalIF":2.7,"publicationDate":"2022-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"60140872","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-05-11DOI: 10.1080/24751839.2022.2066847
Md. Najmul Hossain
ABSTRACT It is important to design a spectrum-efficient and power-efficient wireless communication system, which is the main design target in cellular and wireless communication engineering. Basically, to make it, the desired system must have a low peak-to-average power ratio (PAPR), low-level of out-of-band (OOB) power emission and can provide a high throughput. In this paper, we propose a high-throughput cellular communication system, namely Discrete Fourier Transform-Spread Windowing and Restructuring Orthogonal Frequency Division Multiplexing (DFT-Spread WR-OFDM), which has considerably low PAPR and low OOB power emission for upcoming next-generation beyond 5G (B5G) and 6G cellular communication systems. High PAPR is still one of the challenging issues for the MIMO-OFDM system. The proposed system is an effective arrangement of DFT-Spreading and windowing techniques to reduce PAPR and OOB power emission, respectively. Multiuser diversity is obtained using localized subcarrier mapping. We take advantages of spatial multiplexing to enhance the data throughput significantly. Additionally, frequency-domain equalization (FDE)-minimum mean squared error (MMSE) is used to combat the inter-symbol interference (ISI) effect. Simulation results verify that the suggested system considerably lowers PAPR and OOB power emission compared to the conventional systems. Furthermore, the proposed scheme shows better bit error rate (BER) performance over the MIMO Rayleigh fading channel environment. Simulation results also confirmed that the channel capacity of our suggested system is better than the conventional multi-carrier systems.
{"title":"Performance evaluation of MIMO DFT-Spread WR-OFDM system for spectrum efficiency and power efficiency","authors":"Md. Najmul Hossain","doi":"10.1080/24751839.2022.2066847","DOIUrl":"https://doi.org/10.1080/24751839.2022.2066847","url":null,"abstract":"ABSTRACT It is important to design a spectrum-efficient and power-efficient wireless communication system, which is the main design target in cellular and wireless communication engineering. Basically, to make it, the desired system must have a low peak-to-average power ratio (PAPR), low-level of out-of-band (OOB) power emission and can provide a high throughput. In this paper, we propose a high-throughput cellular communication system, namely Discrete Fourier Transform-Spread Windowing and Restructuring Orthogonal Frequency Division Multiplexing (DFT-Spread WR-OFDM), which has considerably low PAPR and low OOB power emission for upcoming next-generation beyond 5G (B5G) and 6G cellular communication systems. High PAPR is still one of the challenging issues for the MIMO-OFDM system. The proposed system is an effective arrangement of DFT-Spreading and windowing techniques to reduce PAPR and OOB power emission, respectively. Multiuser diversity is obtained using localized subcarrier mapping. We take advantages of spatial multiplexing to enhance the data throughput significantly. Additionally, frequency-domain equalization (FDE)-minimum mean squared error (MMSE) is used to combat the inter-symbol interference (ISI) effect. Simulation results verify that the suggested system considerably lowers PAPR and OOB power emission compared to the conventional systems. Furthermore, the proposed scheme shows better bit error rate (BER) performance over the MIMO Rayleigh fading channel environment. Simulation results also confirmed that the channel capacity of our suggested system is better than the conventional multi-carrier systems.","PeriodicalId":32180,"journal":{"name":"Journal of Information and Telecommunication","volume":"6 1","pages":"465 - 481"},"PeriodicalIF":2.7,"publicationDate":"2022-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48241833","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
扫码关注我们
求助内容：
应助结果提醒方式：