Biblio

The correctness of user traffic forwarding paths is an important goal of trusted transmission. Many network security issues are related to it, i.e., denial-of-service attacks, route hijacking, etc. The current path-aware network architecture can effectively overcome this issue through path verification. At present, the main problems of path verification are high communication and high computation overhead. To this aim, this article proposes a lightweight real-time verification mechanism of intradomain forwarding paths in autonomous systems to achieve a path verification architecture with no communication overhead and low computing overhead. The problem situation is that a packet finally reaches the destination, but its forwarding path is inconsistent with the expected path. The expected path refers to the packet forwarding path determined by the interior gateway protocols. If the actual forwarding path is different from the expected one, it is regarded as an incorrect forwarding path. This article focuses on the most typical intradomain routing environment. A few routers are set as the verification routers to block the traffic with incorrect forwarding paths and raise alerts. Experiments prove that this article effectively solves the problem of path verification and the problem of high communication and computing overhead.

We demonstrated hardware emulations to evaluate the error-correction performance for a FEC scheme with multilevel coding. It has enabled the measurement of BER to reach the order of 10−14 for the decoded signal.

At present, our English error correction algorithm is slightly general, the error correction ability is also very limited, and its accuracy rate is also low, so it is very necessary to improve. This article will further explore the problem of syntax error correction, and the corresponding algorithm model will also be proposed. Based on deep learning technology to improve the error correction rate of English grammar, put forward the corresponding solution, put forward the Sep2seq-based English grammar error correction system model, and carry out a series of rectifications to improve its efficiency and accuracy. The basic architecture of TensorFLOW is used to implement the model, and the success of the error correction algorithm model is proved, which brings great improvement and progress to the success of error correction.

In real-time video streaming, data packets are transported over the network from a transmitter to a receiver. The quality of the received video fluctuates as the network conditions change, and it can degrade substantially when there is considerable packet loss. Forward error correction (FEC) techniques can be used to recover lost packets by incorporating redundant data. Conventional FEC schemes do not work well when scalable video coding (SVC) is adopted. In this paper, we propose a novel FEC scheme that overcomes the drawbacks of these schemes by considering the reference picture structure of SVC and weighting the reference pictures more when FEC redundancy is applied. The experimental results show that the proposed FEC scheme outperforms conventional FEC schemes.

Currently, the pulse position modulation (PPM) schemes are suffering from bandwidth application where the line rate is double that of the initial data rate. Thus, the offset pulse position modulation (OPPM) has been suggested to rectify this concern. Several attempts to improve the OPPM can be found in the open literature. This study focuses on the utilization of Reed Solomon (RS) codes to enhance the forward error correction (FEC) bit error rate, which is not yet explored. The performance of errors of the uncoded OPPM was compared to the one used by RS coded OPPM using the number of photons per pulse, the transmission's efficacy, and bandwidth growth. The results demonstrate that employing FEC coding would increase the system's error performance especially when the RS is operating at its finest settings. Specifically, when operating with a capacity that is equivalent to or even more 0.7, the OPPM with RS code outperforms the uncoded OPPM where the OPPM with MLSD needs only 1.2×103 photons per pulse with an ideal coding rate of about 3/4.

We propose the use of dual coding concatenation for mitigation of post-shaping burst errors in probabilistic amplitude shaping (PAS) architectures. The proposed dual coding concatenation for PAS is a hybrid integration of conventional reverse concatenation and forward concatenation, i.e., post-shaping forward error correction (FEC) layer and pre-shaping FEC layer, respectively. A low-complexity architecture based on parallel Bose–Chaudhuri–Hocquenghem (BCH) codes is introduced for the pre-shaping FEC layer. Proposed dual coding concatenation can relax bit error rate (BER) requirement after post-shaping soft-decision (SD) FEC codes by an order of magnitude, resulting in a gain of up to 0.25 dB depending on the complexity of post-shaping FEC. Also, combined shaping and coding performance was analyzed based on sphere shaping and the impact of shaping length on coding performance was demonstrated.

In this work, we implement a complete probabilistic amplitude shaping (PAS) architecture on a field-programmable gate array (FPGA) platform to study the interplay between probabilistic shaping (PS) and forward error correction (FEC). Due to the fully parallelized input–output interfaces based on look up table (LUT) and low computational complexity without high-precision multiplication, hierarchical distribution matching (HiDM) is chosen as the solution for real time probabilistic shaping. In terms of FEC, we select two kinds of the mainstream soft decision-forward error correction (SD-FEC) algorithms currently used in optical communication system, namely Open FEC (OFEC) and soft-decision quasi-cyclic low-density parity-check (SD-QC-LDPC) codes. Through FPGA experimental investigation, we studied the impact of probabilistic shaping on OFEC and LDPC, respectively, based on PS-16QAM under moderate shaping, and also the impact of probabilistic shaping on LDPC code based on PS-64QAM under weak/strong shaping. The FPGA experimental results show that if pre-FEC bit error rate (BER) is used as the predictor, moderate shaping induces no degradation on the OFEC performance, while strong shaping slightly degrades the error correction performance of LDPC. Nevertheless, there is no error floor when the output BER is around 10-15. However, if normalized generalized mutual information (NGMI) is selected as the predictor, the performance degradation of LDPC will become insignificant, which means pre-FEC BER may not a good predictor for LDPC in probabilistic shaping scenario. We also studied the impact of residual errors after FEC decoding on HiDM. The FPGA experimental results show that the increased BER after HiDM decoding is within 10 times compared to post-FEC BER.

With a record 400Gbps 100-piece-FPGA implementation, we investigate performance of the potential FEC schemes for OIF-800GZR. By comparing the power dissipation and correction threshold at 10−15 BER, we proposed the simplified OFEC for the 800G-ZR FEC.

JPEG-XS offers low complexity image compression for applications with constrained but reasonable bit-rate, and low latency. Our paper explores the deployment of JPEG-XS on lossy packet networks. To preserve low latency, Forward Error Correction (FEC) is envisioned as the protection mechanism of interest. Although the JPEG-XS codestream is not scalable in essence, we observe that the loss of a codestream fraction impacts the decoded image quality differently, depending on whether this codestream fraction corresponds to codestream headers, to coefficient significance information, or to low/high frequency data. Hence, we propose a rate-distortion optimal unequal error protection scheme that adapts the redundancy level of Reed-Solomon codes according to the rate of channel losses and the type of information protected by the code. Our experiments demonstrate that, at 5% loss rates, it reduces the Mean Squared Error by up to 92% and 65%, compared to a transmission without and with optimal but equal protection, respectively.

The discussion about forward error correction (FEC) used for 800G unamplified link (800LR) is ongoing. Aiming at two potential options for FEC bit error ratio (BER) threshold, we propose two FEC schemes, respectively based on channel-polarized (CP) multilevel coding (MLC) and bit interleaved coded modulation (BICM), with the same inner FEC code. The field-programmable gate array (FPGA) verification results indicate that with the same FEC overhead (OH), proposed CP-MLC outperforms BICM scheme with less resource and power consumption.

In this paper, we propose a numerical simulation investigation of the wavelength division multiplexing mechanism between a chaotic secure channel and a traditional fiber channel using the advanced modulation method DP-16QAM at the bitrate of 80Gbps, the fiber length of 80 km and 100 GHz channel spacing in C-band. Our paper investigates correlation coefficients between the transmitter and also the receiver for two forms of communication channels. Our simulation results demonstrate that, in all cases, BER is always below 2.10-4 even when we have not used the forward-error-correction method. Besides, cross-interaction between the chaotic channel and also the non-chaotic channel is negligible showing a highly independent level between two channels.

We propose and numerically demonstrate a novel secure key distribution scheme based on the chaos synchronization of two semiconductor lasers (SLs) subject to symmetrical double chaotic injections, which are outputted by two mutually-coupled semiconductor lasers. The results show that high quality chaos synchronization can be observed between two local SLs with suitable injection strength and identical injection time delays for Alice and Bob. On the basis of satisfactory chaos synchronization and a post-processing technology, identical secret keys for Alice and Bob are successfully generated with bit error ratio (BER) below the HD-FEC threshold of $^\textrm-3\$$\$.

Current cryptographic solutions used in information technologies today like Transport Layer Security utilize algorithms with underlying computationally difficult problems to solve. With the ongoing research and development of quantum computers, these same computationally difficult problems become solvable within reasonable (polynomial) time. The emergence of large-scale quantum computers would put the integrity and confidentiality of today’s data in jeopardy. It then becomes urgent to develop, implement, and test a new suite of cybersecurity measures against attacks from a quantum computer. This paper explores, understands, and evaluates this new category of cryptosystems as well as the many tradeoffs among them. All the algorithms submitted to the National Institute of Standards and Technology (NIST) for standardization can be categorized into three major categories, each relating to the new underlying hard problem: namely error code correcting, algebraic lattices (including ring learning with errors), and supersingular isogenies. These new mathematical hard problems have shown to be resistant to the same type of quantum attack. Utilizing hardware clock cycle registers, the work sets up the benchmarks of the four Round 3 NIST algorithms in two environments: cloud computing and embedded system. As expected, there are many tradeoffs and advantages in each algorithm for applications. Saber and Kyber are exceedingly fast but have larger ciphertext size for transmission over a wire. McEliece key size and key generation are the largest drawbacks but having the smallest ciphertext size and only slightly decreased performance allow a use case where key reuse is prioritized. NTRU finds a middle ground in these tradeoffs, being better than McEliece performance wise and better than Kyber and Saber in ciphertext size allows for a use case of highly varied environments, which need to value speed and ciphertext size equally. Going forward, the benchmarking system developed could be applied to digital signature, another vital aspect to a cryptosystem.

In Forward Error Correction (FEC), redundant bits are added for detecting and correcting bit error which increases the bandwidth. To solve this issue we combined FEC method with higher order M-ary modulation to provide a bandwidth efficient system. An input bit stream is mapped to a bi-orthogonal code on different levels based on the code rates (4/16, 3/16, and 2/16) used. The jamming attack on wireless networks are mitigated by Chaotic Frequency Hopping (CFH) spread spectrum technique. In this paper, to achieve better data rate and to transmit the data in a secured manner we combined FEC and CFH technique, represented as Code and Chaotic Frequency Modulation (CCFM). In addition, two rate adaptation algorithms namely Static retransmission rate ARF (SARF) and Fast rate reduction ARF (FARF) are employed in CFH technique to dynamically adapt the code rate based on channel condition to reduce a packet retransmission. Symbol Error Rate (SER) performance of the system is analyzed for different code rate with the conventional OFDM in the presence AWGN and Rayleigh channel and the reliability of CFH method is tested under different jammer.

Wireless Sensor Networks (WSNs) have limited energy resource which requires authentic data transmission at a minimum cost. The major challenge is to deploy WSN with limited energy and lifetime of nodes while taking care of secure data communication. The transmission of data from the wireless channels may cause many losses such as fading, noise, bit error rate increases as well as deplete the energy resource from the nodes. To reduce the adverse effects of losses and to save power usage, error control coding (ECC) techniques are widely used and it also brings coding gain. Since WSN have limited energy resource so the selection of ECC is very difficult as both power consumption, as well as BER, has also taken into consideration. This research paper reviews different types of models, their applications, limitations of the sensor networks, and what are different types of future works going to overcome the limitations.

Visible light communications (VLC) have been the focus of many recent investigations due to its potential for transmitting data at a higher bitrate than conventional communication systems. Alongside the advantages of being energy efficient through the use of LEDs (Light Emitting Diodes), it is imperative that these systems also take in consideration privacy and security measures available. This work highlights the technical aspects of a typical 16-QAM (Quadrature Amplitude Modulation) VLC system incorporating an enhanced privacy feature using an hyperchaotic map to scramble the symbols. The results obtained in this study showed a low dispersion symbol constellation while communicating at 100 Baud and with a 1 m link. Using the measured EVM (Error Vector Magnitude) of the constellation, the BER (Bit Error Rate) of this system was estimated to be bellow 10−12 which is lower than the threshold limit of 3.8.10−3 that corresponds to the 7% hard-decision forward error correction (HD- FEC) for optimal transmission, showing that this technique can be implemented with higher bitrates and with a higher modulation index.

Ternary content addressable memories (TCAMs) widely utilized in network systems to enforce the labeling of packets. For example, they are used for packet forwarding, security, and software-defined networks (SDNs). TCAMs are typically deployed as standalone instruments or as an embedded intellectual property component on application-specific integrated circuits. However, field-programmable gate arrays (FPGAs) do not have TCAM bases. However, FPGAs’ versatility allows them to appeal for SDN deployment, and most FPGA vendors have SDN production kits. Those need to help TCAM features and then simulate TCAMs using the FPGA logic blocks. Several methods to reproduction TCAMs on FPGAs have been introduced in recent years. Some of them use a huge multiple storage blocks within modern FPGAs to incorporate TCAMs. A trouble while remembrances are that soft errors that corrupt stored bits can affect them. Memories may be covered by a parity test to identify errors or by an error correction code, although this involves extra bits in a word frame. This brief considers memory security used to simulate TCAMs. It is shown in particular that by leveraging the assumption its part of potential memory information is true, most single-bit errors can be resolved when memoirs are emulated with a parity bit.

Security of physical layer key generation is based on the randomness and reciprocity of wireless fading channel, which has attracted more and more attention in recent years. This paper proposes a rate adaptive key agreement scheme and utilizes the received signal strength (RSS) of the channel between two wireless devices to generate the key. In conventional information reconciliation process, the bit inconsistency rate is usually eliminated by using the filter method, which increases the possibility of exposing the generated key bit string. Building on the strengths of existing secret key extraction approaches, this paper develops a scheme that uses Reed-Solomon (RS) codes, one of forward error correction channel codes, for information reconciliation. Owing to strong error correction performance of RS codes, the proposed scheme can solve the problem of inconsistent key bit string in the process of channel sensing. At the same time, the composition of RS codes can help the scheme realize rate adaptation well due to the construction principle of error correction code, which can freely control the code rate and achieve the reconciliation method of different key bit string length. Through experiments, we find that when the number of inconsistent key bits is not greater than the maximum error correction number of RS codes, it can well meet the purpose of reconciliation.

The completion and the correction of measurement data are the foundation of the ubiquitous power internet of things construction. However, data missing may occur during the data transporting process. Therefore, a model of missing load situation reconstruction based on the generative adversarial networks is proposed in this paper to overcome the disadvantage of depending on data of other relevant factors in conventional methods. Through the unsupervised training, the proposed model can automatically learn the complex features of loads that are difficult to model explicitly to fill the incomplete load data without using other relevant data. Meanwhile, a method of online correction is put forward to improve the robustness of the reconstruction model in different scenarios. The proposed method is fully data-driven and contains no explicit modeling process. The test results indicate that the proposed algorithm is well-matched for the various scenarios, including the discontinuous missing load reconstruction and the continuous missing load reconstruction even massive data missing. Specifically, the reconstruction error rate of the proposed algorithm is within 4% under the absence of 50% load data.

Ultra-Reliable Low Latency Communications (URLLC) has been always a vital component of many industrial applications. The paper proposes a new wireless URLLC solution called RETIS, which is suitable for factory automation and fast process control applications, where low latency, low jitter, and high data exchange rates are mandatory. In the paper, we describe the communication protocol as well as the hardware structure of the network nodes for implementing the required functionality. Many techniques enabling fast, reliable wireless transmissions are used - short Transmission Time Interval (TTI), TimeDivision Multiple Access (TDMA), MIMO, optional duplicated data transfer, Forward Error Correction (FEC), ACK mechanism. Preliminary tests show that reliable endto-end latency down to 350 μs and packet exchange rate up to 4 kHz can be reached (using quadruple MIMO and standard IEEE 802.15.4 PHY at 250 kbit/s).

Recently, border monitoring and security has become an important topic since current methods against illegal immigration are expensive and inefficient. In particular, inefficiency and ineffectiveness increase when monitoring operations are focused on complex borders, where there is no available/reliable connectivity. In the last decade, the deployment of different kinds of unmanned aerial vehicles was seen as the main paradigm to provide on-demand wireless network access. Significant research work has been done on so called mobile base stations. Nevertheless, drones have specific technical limitations in terms, for example, of battery life and carried weight. Given above fundamental limits, network virtualization becomes a fundamental paradigm for system realization. In the last years, baseband processing was not seen any more as a monolithic block but has been studied as a chain of virtual functions. Especially, baseband unit can be split into five sub-blocks belonging to layer 1 to layer 3, where each degree of splitting implies more and more stringent requirements to be guaranteed, mainly in terms of throughput and latency. Split E is the logic separation of hybrid automatic repeat request from lower layers, which imposes the most flexible requirements. On the other hand, Split D (forward error correction, encoding/decoding logic functions) sets more stringent bounds on throughput and latency so that it requires careful study and detailed analysis for a correct system-level design. The main objective of this article is to study theoretically and numerically (i.e. via simulations) Split D to make it feasible with the help of small satellites. The paper will study the structure and the capabilities of small satellites to be used as small data centers to host radio access virtual network functions like forward error correction. The theoretical analysis is supported by simulations in order to highlight advantages and challenges of the proposed approach.

Cloud computing has been envisioned as a next generation information technology (IT) paradigm. The risk of losing data stored with any untrustworthy service provider is the key barrier to widespread uptake of cloud computing. This paper proposes an algebraic signature based remote data possession checking (RDPC) scheme to verify the integrity of the data stored in the cloud. This scheme integrates forward error-correcting codes to enhance the data possession guarantee, which can recover the data when a small amount of file has been deleted. The scheme allows verification without the need for the auditor to compare against the original data, which reduces the communication complexity dramatically. The storage complexity of cloud user is reduced to several bytes' information. Extensive security analysis and simulation show that the proposed scheme is highly provably secure. Finally, experiment results reveal that the computation performance is effective, and bounded by disk I/O.

A QPSK-assisted MIMO equalization is investigated to compensate bandwidth limitation for 800-Gb/s/λ DP-256QAM systems with only 25G-class optics. Compared with conventional MIMO equalization, the proposed equalization scheme exhibits 1.8-dB OSNR improvement at 15% FEC limit.

Recent work has quantified the degradations that occur in convolutional neural nets (CNN) deployed in harsh environments like space-based image or radio frequency (RF) processing applications. Such degradations yield a robust correlation and causality between single-event upset (SEU) induced errors in memory weights of on-orbit CNN implementations. However, minimal considerations have been given to how the resilience of CNNs can be improved algorithmically as opposed to via enhanced hardware. This paper focuses on RF-processing CNNs and performs an in-depth analysis of applying software-based error detection and correction mechanisms, which may subsequently be combined with protections of radiation-hardened processor platforms. These techniques are more accessible for low cost smallsat platforms than ruggedized hardware. Additionally, methods for minimizing the memory and computational complexity of the resulting resilience techniques are identified. Combined with periodic scrubbing, the resulting techniques are shown to improve expected lifetimes of CNN-based RF-processing algorithms by several orders of magnitude.

Recent work has shown the impact of adversarial machine learning on deep neural networks (DNNs) developed for Radio Frequency Machine Learning (RFML) applications. While these attacks have been shown to be successful in disrupting the performance of an eavesdropper, they fail to fully support the primary goal of successful intended communication. To remedy this, a communications-aware attack framework was recently developed that allows for a more effective balance between the opposing goals of evasion and intended communication through the novel use of a DNN to intelligently create the adversarial communication signal. Given the near ubiquitous usage of for-ward error correction (FEC) coding in the majority of deployed systems to correct errors that arise, incorporating FEC in this framework is a natural extension of this prior work and will allow for improved performance in more adverse environments. This work therefore provides contributions to the framework through improved loss functions and design considerations to incorporate inherent knowledge of the usage of FEC codes within the transmitted signal. Performance analysis shows that FEC coding improves the communications aware adversarial attack even if no explicit knowledge of the coding scheme is assumed and allows for improved performance over the prior art in balancing the opposing goals of evasion and intended communications.