Pub Date : 2021-07-26DOI: 10.52589/BJCNIT-O5PVTEGT
A E Tamaraebi, B Okardi
The need to meet the demands of subscribers of wireless services is imperative to Global System for Mobile (GSM) Communication companies. These demands, which revolve around the maintenance of good network coverage and improved Quality of Service (QoS), depend largely on the nature of cellular network masts. Greedy Algorithm Model was implemented on network masts for small size populated areas to effectively have optimal network coverage. Object Oriented Analysis and Design Methodology (OOADM) and Java programming language was used for its implementation. The analysis of the results shows that Greedy Algorithm performed optimizing cellular network masts hoisting optimally for small populated areas.
{"title":"Implementation of Greedy Algorithm in Optimal Cellular Masts Hoisting Over Population Coverage","authors":"A E Tamaraebi, B Okardi","doi":"10.52589/BJCNIT-O5PVTEGT","DOIUrl":"https://doi.org/10.52589/BJCNIT-O5PVTEGT","url":null,"abstract":"The need to meet the demands of subscribers of wireless services is imperative to Global System for Mobile (GSM) Communication companies. These demands, which revolve around the maintenance of good network coverage and improved Quality of Service (QoS), depend largely on the nature of cellular network masts. Greedy Algorithm Model was implemented on network masts for small size populated areas to effectively have optimal network coverage. Object Oriented Analysis and Design Methodology (OOADM) and Java programming language was used for its implementation. The analysis of the results shows that Greedy Algorithm performed optimizing cellular network masts hoisting optimally for small populated areas.","PeriodicalId":326452,"journal":{"name":"British Journal of Computer, Networking and Information Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130727398","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 : 2021-07-20DOI: 10.52589/bjcnit-kyur6rdw
Gbaranwi B.P., Kabari L.G.
The quality of the signal is essential in digital communication and signal processing. The transmission channel is also important. Modulation is used for effectively transmission of signal. There exist several types of modulation techniques. One of such is the pulse code modulation (PCM). The performance of PCM is however affected by quantization error and noise in the transmission channel, which affects the quality of the output. Against this backdrop, this paper presents the use of differential pulse code modulation (DPCM) so as to address the limitation of pulse code modulation. The simulation environment is MATLAB 2018a. The MATLAB Simulink is used to design the PCM and DPCM systems using appropriate digital processing blocks. The DPCM system shows a significant improvement in terms of error reduction and quality of output.
{"title":"A Comparative Analysis of Image Compression using PCM and DPCM","authors":"Gbaranwi B.P., Kabari L.G.","doi":"10.52589/bjcnit-kyur6rdw","DOIUrl":"https://doi.org/10.52589/bjcnit-kyur6rdw","url":null,"abstract":"The quality of the signal is essential in digital communication and signal processing. The transmission channel is also important. Modulation is used for effectively transmission of signal. There exist several types of modulation techniques. One of such is the pulse code modulation (PCM). The performance of PCM is however affected by quantization error and noise in the transmission channel, which affects the quality of the output. Against this backdrop, this paper presents the use of differential pulse code modulation (DPCM) so as to address the limitation of pulse code modulation. The simulation environment is MATLAB 2018a. The MATLAB Simulink is used to design the PCM and DPCM systems using appropriate digital processing blocks. The DPCM system shows a significant improvement in terms of error reduction and quality of output.","PeriodicalId":326452,"journal":{"name":"British Journal of Computer, Networking and Information Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115600506","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 : 2021-07-06DOI: 10.52589/BJCNIT-_KT7MIZHG
A. Lukman, J Junmei, G. K. Mohammed
The analysis of digital-to-analog converters is an unproven challenge. After years of confirmed research into flip-flop gates, we prove the analysis of systems, which embodies the compelling principles of programming languages. In our research we propose a novel algorithm for the refinement of multi-processors (ChokyFop), confirming that information re- trieval systems can be made relational, wireless, and constant- time.
{"title":"Deconstructing the Ethernet with ChokyFop","authors":"A. Lukman, J Junmei, G. K. Mohammed","doi":"10.52589/BJCNIT-_KT7MIZHG","DOIUrl":"https://doi.org/10.52589/BJCNIT-_KT7MIZHG","url":null,"abstract":"The analysis of digital-to-analog converters is an unproven challenge. After years of confirmed research into flip-flop gates, we prove the analysis of systems, which embodies the compelling principles of programming languages. In our research we propose a novel algorithm for the refinement of multi-processors (ChokyFop), confirming that information re- trieval systems can be made relational, wireless, and constant- time.","PeriodicalId":326452,"journal":{"name":"British Journal of Computer, Networking and Information Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122463499","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 : 2021-07-06DOI: 10.52589/BJCNIT-XEPSJBWX
Eric U.O., Michael O.O., Oberhiri-Orumah G., Chike H. N.
Cluster analysis is an unsupervised learning method that classifies data points, usually multidimensional into groups (called clusters) such that members of one cluster are more similar (in some sense) to each other than those in other clusters. In this paper, we propose a new k-means clustering method that uses Minkowski’s distance as its metric in a normed vector space which is the generalization of both the Euclidean distance and the Manhattan distance. The k-means clustering methods discussed in this paper are Forgy’s method, Lloyd’s method, MacQueen’s method, Hartigan and Wong’s method, Likas’ method and Faber’s method which uses the usual Euclidean distance. It was observed that the new k-means clustering method performed favourably in comparison with the existing methods in terms of minimization of the total intra-cluster variance using simulated data and real-life data sets.
{"title":"New K-means Clustering Method Using Minkowski’s Distance as its Metric","authors":"Eric U.O., Michael O.O., Oberhiri-Orumah G., Chike H. N.","doi":"10.52589/BJCNIT-XEPSJBWX","DOIUrl":"https://doi.org/10.52589/BJCNIT-XEPSJBWX","url":null,"abstract":"Cluster analysis is an unsupervised learning method that classifies data points, usually multidimensional into groups (called clusters) such that members of one cluster are more similar (in some sense) to each other than those in other clusters. In this paper, we propose a new k-means clustering method that uses Minkowski’s distance as its metric in a normed vector space which is the generalization of both the Euclidean distance and the Manhattan distance. The k-means clustering methods discussed in this paper are Forgy’s method, Lloyd’s method, MacQueen’s method, Hartigan and Wong’s method, Likas’ method and Faber’s method which uses the usual Euclidean distance. It was observed that the new k-means clustering method performed favourably in comparison with the existing methods in terms of minimization of the total intra-cluster variance using simulated data and real-life data sets.","PeriodicalId":326452,"journal":{"name":"British Journal of Computer, Networking and Information Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131136234","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 : 2021-07-06DOI: 10.52589/BJCNIT-GCLFAZM8
Lukman A., Junmei J., Mohammed G.K.
This study/paper/research work shows the role of Media, Information and Communication Technology (ICT) and sustainable development in Nigeria; it aimed to improve lives in many other ways, such as through education, skill development, new services creation, innovation and automation, freedom of expression through mass media and expose corrupt practices in Nigeria, although the primary responsibilities of the media is to entertain without words falsely spoken that damage the reputation of one another, inform based on accurate facts and educate on current relevant issues. But not withstanding Media, Information and Communication Technology make a significant impact in sustainable and development in Nigeria.
{"title":"Media, Information and Communication Technology and Sustainable Development in Nigeria","authors":"Lukman A., Junmei J., Mohammed G.K.","doi":"10.52589/BJCNIT-GCLFAZM8","DOIUrl":"https://doi.org/10.52589/BJCNIT-GCLFAZM8","url":null,"abstract":"This study/paper/research work shows the role of Media, Information and Communication Technology (ICT) and sustainable development in Nigeria; it aimed to improve lives in many other ways, such as through education, skill development, new services creation, innovation and automation, freedom of expression through mass media and expose corrupt practices in Nigeria, although the primary responsibilities of the media is to entertain without words falsely spoken that damage the reputation of one another, inform based on accurate facts and educate on current relevant issues. But not withstanding Media, Information and Communication Technology make a significant impact in sustainable and development in Nigeria.","PeriodicalId":326452,"journal":{"name":"British Journal of Computer, Networking and Information Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131962127","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 : 2021-06-30DOI: 10.52589/bjcnit-m7xkp8rv
H. Dike, A. Isaac
In this paper, the determination of eccentric anomaly (E) for Kepler’s satellite orbit using Perturbation-Based Seeded Secant (PBSS) iteration algorithm is presented. The solution is meant for Kepler’s orbit with the value of eccentricity (e) in the range 0 ≤ e ≤ 1. Such orbits are either circular or elliptical. The demonstration of the applicability of the PBSS iteration is presented using sample numerical examples with different values of mean anomaly (M) and eccentricity (e). The summary of the results of E for M = 30° and e in the range 0.001 ≤ e ≤1 showed that the convergence cycle (n) increases as e increases. Particularly, n increased from 2 at e = 0.01 to n = 8 at e =1. The implication is that it takes more iterations to arrive at the value of E with the desired accuracy or error performance (which in this case is set to 10^(-12)). Another implication is that a good choice of the initial value of E is essential especially as the value of e increases. As such, effort should be made to develop a means of estimating the initial value of E which will reduce the convergence cycle for higher values of e.
{"title":"Determination of Eccentric Anomaly for Kepler’s Satellite Orbit Using Perturbation-Based Seeded Secant Iteration Scheme","authors":"H. Dike, A. Isaac","doi":"10.52589/bjcnit-m7xkp8rv","DOIUrl":"https://doi.org/10.52589/bjcnit-m7xkp8rv","url":null,"abstract":"In this paper, the determination of eccentric anomaly (E) for Kepler’s satellite orbit using Perturbation-Based Seeded Secant (PBSS) iteration algorithm is presented. The solution is meant for Kepler’s orbit with the value of eccentricity (e) in the range 0 ≤ e ≤ 1. Such orbits are either circular or elliptical. The demonstration of the applicability of the PBSS iteration is presented using sample numerical examples with different values of mean anomaly (M) and eccentricity (e). The summary of the results of E for M = 30° and e in the range 0.001 ≤ e ≤1 showed that the convergence cycle (n) increases as e increases. Particularly, n increased from 2 at e = 0.01 to n = 8 at e =1. The implication is that it takes more iterations to arrive at the value of E with the desired accuracy or error performance (which in this case is set to 10^(-12)). Another implication is that a good choice of the initial value of E is essential especially as the value of e increases. As such, effort should be made to develop a means of estimating the initial value of E which will reduce the convergence cycle for higher values of e.","PeriodicalId":326452,"journal":{"name":"British Journal of Computer, Networking and Information Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116423497","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 : 2021-06-30DOI: 10.52589/bjcnit-lsfcmvli
A. Isaac, H. Dike
In this paper, analytical models for the computation of error probability (BER) of the Multi-level Phase Shift Keying (MPSK) modulation scheme is presented. Analytical models for computing MPSK bit error probability based on Q function, error function (erf) and complementary error function (erfc) are presented. Also, an analytical model for computing the symbol error rate for MPSK is presented. Furthermore, a generalized analytical expression for BER as a function of modulation order (M) and energy per bit to noise power density ratio (Eb/No) is presented. The BER was computed for various values of M (2 ≤ M ≤ 256) and Eb/No (0 dB ≤ Eb/No ≤ 14 Db). The results showed that at Eb/No =12 dB, a BER of 9.006E-09 is realized for M =2 and M =4 whereas BER of 1.056E-01 is realized for M = 256. Also, for the same M = 2 , the value of BER decreased from 1.2501E-02 at Eb/No = 4 dB to 9.0060E-09at Eb/No =12 dB. Generally, the results showed that for the MPSK modulation scheme, for a given value of Eb/No, the lower modulation order (M) has a lower BER and for a given modulation order, (M) the BER decreases as Eb/No increases.
{"title":"Analytical Models for the Computation of Error Probability of Multi-Level Phase Shift Keying Modulation Scheme","authors":"A. Isaac, H. Dike","doi":"10.52589/bjcnit-lsfcmvli","DOIUrl":"https://doi.org/10.52589/bjcnit-lsfcmvli","url":null,"abstract":"In this paper, analytical models for the computation of error probability (BER) of the Multi-level Phase Shift Keying (MPSK) modulation scheme is presented. Analytical models for computing MPSK bit error probability based on Q function, error function (erf) and complementary error function (erfc) are presented. Also, an analytical model for computing the symbol error rate for MPSK is presented. Furthermore, a generalized analytical expression for BER as a function of modulation order (M) and energy per bit to noise power density ratio (Eb/No) is presented. The BER was computed for various values of M (2 ≤ M ≤ 256) and Eb/No (0 dB ≤ Eb/No ≤ 14 Db). The results showed that at Eb/No =12 dB, a BER of 9.006E-09 is realized for M =2 and M =4 whereas BER of 1.056E-01 is realized for M = 256. Also, for the same M = 2 , the value of BER decreased from 1.2501E-02 at Eb/No = 4 dB to 9.0060E-09at Eb/No =12 dB. Generally, the results showed that for the MPSK modulation scheme, for a given value of Eb/No, the lower modulation order (M) has a lower BER and for a given modulation order, (M) the BER decreases as Eb/No increases.","PeriodicalId":326452,"journal":{"name":"British Journal of Computer, Networking and Information Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124940245","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 : 2018-11-15DOI: 10.52589/bjcnit/m4uwnh4j
Ismail Said, M. Cavus
The aim of this study is to develop case-study called Allowing Complexity to Complex Project (ACCP) for micro- learning in order to achieve high performance in computer architecture education and to test the legitimacy of classical teaching methods. The Arithmetic/Logic Unit (ALU) design was used as an example of the ACCP which consists of many examples and models aimed at developing students' skills in using complex arithmetic logical shifting and rotation instructions. Moreover, in this study, a real-world project on Field Programmable Gate Arrays (FPGA) devices was also developed using micro learning (ML). To this end, various hardware and software programs designed for computer architecture education and training were combined with improved instructional and attractive examples.
{"title":"ALU Design by VHDL Using FPGA Technology and Micro Learning in Engineering Education","authors":"Ismail Said, M. Cavus","doi":"10.52589/bjcnit/m4uwnh4j","DOIUrl":"https://doi.org/10.52589/bjcnit/m4uwnh4j","url":null,"abstract":"The aim of this study is to develop case-study called Allowing Complexity to Complex Project (ACCP) for micro- learning in order to achieve high performance in computer architecture education and to test the legitimacy of classical teaching methods. The Arithmetic/Logic Unit (ALU) design was used as an example of the ACCP which consists of many examples and models aimed at developing students' skills in using complex arithmetic logical shifting and rotation instructions. Moreover, in this study, a real-world project on Field Programmable Gate Arrays (FPGA) devices was also developed using micro learning (ML). To this end, various hardware and software programs designed for computer architecture education and training were combined with improved instructional and attractive examples.","PeriodicalId":326452,"journal":{"name":"British Journal of Computer, Networking and Information Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134265959","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
扫码关注我们
求助内容：
应助结果提醒方式：