Martin Johnston
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Martin Johnston has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Li Chen
School of Electronics and Information Technology, Sun Yat-sen University, Guangzhou, China
2 shared publications - Charalampos C. Tsimenidis
Department of Engineering, Nottingham Trent University, Nottingham, U.K.
1 shared publication - Federico Angelini
Thales UK Limited Reading RG2 6GF UK
1 shared publication - Gaojie Chen
Sun Yat-sen University
1 shared publication - Harith Fakhrey
University of Baghdad in Iraq
1 shared publication Jonathon A. Chambers
1 shared publication
Latest Publications
- Open Access
- 1 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Neural Network Equalisation and Symbol Detection for 802.11p V2V Communication at 5.9GHz
Neural networks are shown to be a viable implementation for joint channel equalisation and symbol detection in a vehicular network. Experimental results using a hardware-in-the-loop approach at 5.9GHz validate the efficacy of the proposed implementation following the 802.11p parameters using orthogonal frequency division multiplexing (OFDM). Further results are obtained using a more spectrally efficient waveform, namely spectrally efficient frequency division multiplexing (SEFDM), to show a trade-off between loss of orthogonality, and therefore bit-error rate (BER) performance, versus increased spectral efficiency to enable higher data rates or the ability to service more users. SEFDM is tested with compression factors ranging from 20% up to 60% bandwidth compression. The results show the neural network is able to achieve an acceptable BER performance in a highway non-line-of-sight (NLOS) channel which is a well established harsh and dynamic vehicular channel. This is further validated via measurements of the error vector magnitude.
- 1 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Open AccessNeural Network Equalisation and Symbol Detection for 802.11p V2V Communication at 5.9GHz
Neural networks are shown to be a viable implementation for joint channel equalisation and symbol detection in a vehicular network. Experimental results using a hardware-in-the-loop approach at 5.9GHz validate the efficacy of the proposed implementation following the 802.11p parameters using orthogonal frequency division multiplexing (OFDM). Further results are obtained using a more spectrally efficient waveform, namely spectrally efficient frequency division multiplexing (SEFDM), to show a trade-off between loss of orthogonality, and therefore bit-error rate (BER) performance, versus increased spectral efficiency to enable higher data rates or the ability to service more users. SEFDM is tested with compression factors ranging from 20% up to 60% bandwidth compression. The results show the neural network is able to achieve an acceptable BER performance in a highway non-line-of-sight (NLOS) channel which is a well established harsh and dynamic vehicular channel. This is further validated via measurements of the error vector magnitude.
- 14 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 69 (3) , 2993-3007
Efficient Low-Complexity Antenna Selection Algorithms in Multi-User Massive MIMO Systems With Matched Filter Precoding
- 14 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 69 (3) , 2993-3007
Efficient Low-Complexity Antenna Selection Algorithms in Multi-User Massive MIMO Systems With Matched Filter Precoding
- 24 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 18 (24) , 10163-10173
The Optimum Design of Location-Dependent Key Management Protocol for a Multiple Sink WSN Using a Random Selected Cell Reporter
The use of wireless sensor networks (WSNs) for the purposes of border surveillance is a very hot topic at the moment. Such a network comprises large numbers of sensor nodes, sparsely located over a wide terrain where the generated data are collected by multiple sinks located in secure head quarters. Due to its importance and criticality, data disseminated through such a network is vulnerable to outsider attacks. Therefore, a location dependent key management scheme could be employed in order to provide security in terms of confidentiality and authenticity. This paper presents a novel location dependent key management protocol for multiple sinks (LKMP-MS) whose design is based on a cell reporters scheme. In this protocol, the generated report regarding any event contains three security levels. In particular, the third level is implemented as an endorsement of the set of cell reporters allocated inside each cell. Accordingly, the generated event report is accepted by the sink. As a result, the adversary would have to compromise all endorsement nodes and all cell reporters selected by all sinks in order to generate a fake report inside a particular spot. This paper introduces a novel algorithm to implement the required revocation for both compromised nodes and cells in order to overcome the possible consequences of these entities being compromised. In order to evaluate and compare the LKMP-MS with recent schemes, a mathematical analysis is implemented and a simulation environment is built based on Contiki and MATLAB to validate the mathematical analyses. Finally, an extensive mathematical analysis is presented in order to calculate the optimum number of cell reporters that gives the highest level of security.
- 24 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 18 (24) , 10163-10173
The Optimum Design of Location-Dependent Key Management Protocol for a Multiple Sink WSN Using a Random Selected Cell Reporter
The use of wireless sensor networks (WSNs) for the purposes of border surveillance is a very hot topic at the moment. Such a network comprises large numbers of sensor nodes, sparsely located over a wide terrain where the generated data are collected by multiple sinks located in secure head quarters. Due to its importance and criticality, data disseminated through such a network is vulnerable to outsider attacks. Therefore, a location dependent key management scheme could be employed in order to provide security in terms of confidentiality and authenticity. This paper presents a novel location dependent key management protocol for multiple sinks (LKMP-MS) whose design is based on a cell reporters scheme. In this protocol, the generated report regarding any event contains three security levels. In particular, the third level is implemented as an endorsement of the set of cell reporters allocated inside each cell. Accordingly, the generated event report is accepted by the sink. As a result, the adversary would have to compromise all endorsement nodes and all cell reporters selected by all sinks in order to generate a fake report inside a particular spot. This paper introduces a novel algorithm to implement the required revocation for both compromised nodes and cells in order to overcome the possible consequences of these entities being compromised. In order to evaluate and compare the LKMP-MS with recent schemes, a mathematical analysis is implemented and a simulation environment is built based on Contiki and MATLAB to validate the mathematical analyses. Finally, an extensive mathematical analysis is presented in order to calculate the optimum number of cell reporters that gives the highest level of security.
- 25 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 66 (4) , 1376-1385
Interpolation-Based Low-Complexity Chase Decoding Algorithms for Hermitian Codes
Algebraic-geometric (AG) codes have good error-correction capability due to their generally large code word length. However, their decoding remains complex, preventing practical applications. Addressing the challenge, this paper proposes two interpolation-based low-complexity Chase (LCC) decoding algorithms for one of the most popular AG codes-Hermitian codes. By choosing η unreliable symbols and realizing them with the two most likely decisions, 2 η decoding test-vectors can be formulated. The first LCC algorithm performs interpolation for the common elements of the test-vectors, producing an intermediate outcome that will be shared by the uncommon element interpolation. It eliminates the redundant computation for decoding each test-vector, resulting in a low-complexity. With an interpolation multiplicity of one, the decoding is further facilitated by removing the requirement of pre-calculating the Hermitian curve's corresponding coefficients. The second LCC algorithm is an adaptive variant of the first algorithm, where the number of test-vectors is determined by the reliability of received information. When the channel condition improves, it can reduce the complexity without compromising the decoding performance. Simulation results show that the both LCC algorithms outperform a number of existing algebraic decoding algorithms for Hermitian codes. Finally, our complexity analysis will reveal the proposals' low-complexity feature.
- 25 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 66 (4) , 1376-1385
Interpolation-Based Low-Complexity Chase Decoding Algorithms for Hermitian Codes
Algebraic-geometric (AG) codes have good error-correction capability due to their generally large code word length. However, their decoding remains complex, preventing practical applications. Addressing the challenge, this paper proposes two interpolation-based low-complexity Chase (LCC) decoding algorithms for one of the most popular AG codes-Hermitian codes. By choosing η unreliable symbols and realizing them with the two most likely decisions, 2 η decoding test-vectors can be formulated. The first LCC algorithm performs interpolation for the common elements of the test-vectors, producing an intermediate outcome that will be shared by the uncommon element interpolation. It eliminates the redundant computation for decoding each test-vector, resulting in a low-complexity. With an interpolation multiplicity of one, the decoding is further facilitated by removing the requirement of pre-calculating the Hermitian curve's corresponding coefficients. The second LCC algorithm is an adaptive variant of the first algorithm, where the number of test-vectors is determined by the reliability of received information. When the channel condition improves, it can reduce the complexity without compromising the decoding performance. Simulation results show that the both LCC algorithms outperform a number of existing algebraic decoding algorithms for Hermitian codes. Finally, our complexity analysis will reveal the proposals' low-complexity feature.
- 2 December 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 7 (11) , 4353-4361
Reduced Complexity Interpolation for List Decoding Hermitian Codes
List decoding Hermitian codes using the Guruswami-Sudan (GS) algorithm can correct errors beyond half the designed minimum distance. It consists of two processes: interpolation and factorisation. By first defining a Hermitian curve, these processes can be implemented with an iterative polynomial construction algorithm and a recursive coefficient search algorithm respectively. To improve the efficiency of list decoding Hermitian codes, this paper presents two contributions to reduce the interpolation complexity. First, in order to simplify the calculation of a polynomialiquests zero condition during the iterative interpolation, we propose an algorithm to determine the corresponding coefficients between the pole basis monomials and zero basis functions of a Hermitian curve. Second, we propose a modified complexity reducing interpolation algorithm. This scheme identifies any unnecessary polynomials during iterations and eliminates them to improve the interpolation efficiency. Due to the above complexity reducing modifications, list decoding long Hermitian codes with higher interpolation multiplicity becomes feasible. This paper shows list decoding algorithm can achieve significant coding gain over the conventional unique decoding algorithm.
- 2 December 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 7 (11) , 4353-4361
Reduced Complexity Interpolation for List Decoding Hermitian Codes
List decoding Hermitian codes using the Guruswami-Sudan (GS) algorithm can correct errors beyond half the designed minimum distance. It consists of two processes: interpolation and factorisation. By first defining a Hermitian curve, these processes can be implemented with an iterative polynomial construction algorithm and a recursive coefficient search algorithm respectively. To improve the efficiency of list decoding Hermitian codes, this paper presents two contributions to reduce the interpolation complexity. First, in order to simplify the calculation of a polynomialiquests zero condition during the iterative interpolation, we propose an algorithm to determine the corresponding coefficients between the pole basis monomials and zero basis functions of a Hermitian curve. Second, we propose a modified complexity reducing interpolation algorithm. This scheme identifies any unnecessary polynomials during iterations and eliminates them to improve the interpolation efficiency. Due to the above complexity reducing modifications, list decoding long Hermitian codes with higher interpolation multiplicity becomes feasible. This paper shows list decoding algorithm can achieve significant coding gain over the conventional unique decoding algorithm.