| 1 |
Author(s):
Arubere Sunday Ibenate, Okardi Biobele.
Page No : 1-12
|
Fundamentals of Communication Technology and Networks
Abstract
This paper work generally examines the computer network, the basic classification and types of networks, network goals and the benefits a computer network offers to researchers, individuals and organizations. It also pinpoints the graphical arrangement of the computer network, as well as basic building blocks and general overview of data transmission. Data were collected from primary sources where personal interviews were conducted and were analyzed and presented for statistical decision. This research shows the importance of networks in our ever-growing environment. This paper tends to present an overview and an introduction of some of the fundamental components enabling efficient and effective data communication and transmission. For better network efficiency, we need the right Network components, the right network design, and also the right IT expertise in the design and implementation of any network system. Multiple numbers of computers forming a network tend to enhance computing power and increase the productivity of the network in general.
| 2 |
Author(s):
Isaac A. Ezenugu, Dike Happiness Ugochi.
Page No : 16-20
|
Analytical Models for the Computation of Error Probability of Multi-Level Phase Shift Keying Modulation Scheme
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.
| 3 |
Author(s):
Dike Happiness Ugochi, Isaac A. Ezenugu.
Page No : 21-27
|
Determination of Eccentric Anomaly for Kepler’s Satellite Orbit Using Perturbation-Based Seeded Secant Iteration Scheme
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.
| 4 |
Author(s):
Eric U. Oti, Michael O. Olusola, Oberhiri-Orumah Godwin, Chike H. Nwankwo.
Page No : 28-41
|
New K-means Clustering Method Using Minkowski’s Distance as its Metric
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.
| 5 |
Author(s):
Lukman Abubakar, Professor Junmei, Dr. Mohammed Golam Kaosar.
Page No : 42-50
|
Media, Information and Communication Technology and Sustainable Development in Nigeria
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.
| 6 |
Author(s):
Lukman Abubakar, Professor Junmei, Dr. Mohammed Golam Kaosar.
Page No : 51-59
|
Deconstructing the Ethernet with ChokyFop
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.
| 7 |
Author(s):
Gbaranwi Barima Precious, Kabari Ledisi Giok.
Page No : 60-67
|
A Comparative Analysis of Image Compression using PCM and DPCM
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.
| 8 |
Author(s):
Tamaraebi Ambrose Enisuoh, Okardi Biobele.
Page No : 68-78
|
Implementation of Greedy Algorithm in Optimal Cellular Masts Hoisting Over Population Coverage
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.
