Intelligent OFDM telecommunication system. Part 4. Anti-eavesdropping and anti-jamming properties of the system, based on many-parameter and fractional Fourier transforms

In this paper, we aim to investigate the superiority and practicability of many-parameter wavelet and Golay transforms (MPWT and MPGT) from the physical layer security (PHY-LS) perspective. We propose novel Intelligent OFDM-telecommunication system (Intelligent-OFDM-TCS), based on many-parameter transforms (MPTs). New system uses inverse MPT for modulation at the transmitter and direct MPT for demodulation at the receiver. The purpose of employing the MPTs is to improve the PHY-LS of wireless transmissions against to the wide-band anti-jamming communication. Each MPT depends on finite set of independent Jacobi parameters (angles), which could be changed independently one of another. When parameters are changed, multi-parametric transform is changed too taking form of a set known (and unknown) orthogonal (or unitary) wavelet transforms. We implement the following performances as bit error rate (BER), symbol error rate (SER), peak to average power ratio (PAPR), the Shannon-Wyner secrecy capacity (SWSC) for novel Intelligent-MPWT-OFDM-TCS. Previous research has shown that the conventional OFDM TCS based on discrete Fourier transform (DFT) has unsatisfactory characteristics in BER, PARP, SWSC and in anti-eavesdropping communications. We study Intelligent-MPT-OFDM-TCS to find out optimal values of angle parameters of MPT optimized BER, PAPR, SWSC, anti-eavesdropping effects. Simulation results show that the proposed Intelligent OFDM-TCS have better performances than the conventional OFDM system based on DFT against eavesdropping. © 2019 IOP Publishing Ltd. All rights reserved

Using Sat solvers for synchronization issues in partial deterministic automata

We approach the task of computing a carefully synchronizing word of minimum length for a given partial deterministic automaton, encoding the problem as an instance of SAT and invoking a SAT solver. Our experimental results demonstrate that this approach gives satisfactory results for automata with up to 100 states even if very modest computational resources are used.Comment: 15 pages, 3 figure

Checking Whether an Automaton Is Monotonic Is NP-complete

An automaton is monotonic if its states can be arranged in a linear order that is preserved by the action of every letter. We prove that the problem of deciding whether a given automaton is monotonic is NP-complete. The same result is obtained for oriented automata, whose states can be arranged in a cyclic order. Moreover, both problems remain hard under the restriction to binary input alphabets.Comment: 13 pages, 4 figures. CIAA 2015. The final publication is available at http://link.springer.com/chapter/10.1007/978-3-319-22360-5_2