The low-hit-zone (LHZ) frequency hopping sequence (FHS) sets are widely applicable in quasi-synchronous frequency hopping multiple-access (QS-FHMA) systems. In order to reduce mutual interference (MI) in the zone around the signal origin between different users, we recommend the LHZ FHS set instead of the conventional FHS set. In this letter, we propose a design of LHZ FHS sets via interleaving techniques. The obtained sequences can be confirmed that they are near-optimal in relation to the Peng-Fan-Lee bound.

Much work in cooperative communication has been done from the perspective of the physical and network layers. However, the exact impact of signal error rate performance on cooperative routing discovery still remains unclear in multihop ad hoc networks. In this paper, we show the symbol error rate (SER) performance improvement obtained from cooperative commutation, and examine how to incorporate the factor of SER into the distributed routing discovery scheme called DGCR (Dynamic Geographic Cooperative Routing). For a single cooperative communication hop, we present two types of metric to specify the degree that one node is suitable for becoming the relay node. One metric is the potential of a node to relay with optimal SER performance. The other metric is the distance of a node to the straight line that passes through the last forwarding node and the destination. Based on location knowledge and contention scheme, we combine the two metrics into a composite metric to choose the relay node. The forwarding node is chosen dynamically according to the positions of the actual relay node and the destination. Simulation results show that our approach outperforms non-cooperative geographic routing significantly in terms of symbol error rate, and that DGCR's SER performance is better than traditional geographic cooperative routing with slight path length increase.

Frequency hopping sequences (FHSs) play a significant role in modern frequency hopping spread spectrum communication and radar systems. In terms of application, the aperiodic Hamming correlation (HC) holds greater significance compared to the periodic HC as it directly impacts the communication performance. In addition, it is crucial for each user’s FHS to have a substantial wide-gap (WG) in order to prevent the received signals from interfering with each other. In this letter, we obtain a new bound by extending the aperiodic bound proposed by Peng-Fan and the WG FHS bound introduced by Li-Fan-Yang-Wang. The proposed bound is strict since they can be verified using specific parameters of aperiodic WG FHSs.

The transmission on fronthaul links in the cloud radio access network has become a bottleneck with the increasing data rate. In this paper, we propose a novel two-stage compression scheme for fronthaul links. In the first stage, the commonly used techniques like cyclic prefix stripping and sampling rate adaptation are implemented. In the second stage, a structure called linear prediction coding with decision threshold (LPC-DT) is proposed to remove the redundancies of signal. Considering that the linear prediction outputs have large dynamic range, a two-piecewise quantization with optimized decision threshold is applied to enhance the quantization performance. In order to further lower the transmission rate, a multi-level successive structure of lossless polar source coding is proposed to compress the quantization output with low encoding and decoding complexity. Simulation results demonstrate that the proposed scheme with LPC-DT and LPSC offers not only significantly better compression ratios but also more flexibility in bandwidth settings compared with traditional ones.