Partial-prefix synchronizable codes

A new class of codes for frame synchronization is proposed. Commonly, the beginning of every fixed or variable-length frame is identified by a given contiguous sequence called a prefix. To avoid the occurrence of the prefix elsewhere in the frame, a prefix synchronizable code (PS-code) is used. PS-codes have the property that the prefix does not occur in any codeword or in any concatenation of codewords in any position other than the first position. The new codes, termed partial-prefix synchronizable codes (PPS-codes), use a fixed sequence of symbols that is interspersed with symbols that carry information. The contiguous sequence from the first fixed symbol to the last fixed symbol is called a “partial-prefix.” Consequently, not one but a set of possible prefixes is used, and none of these prefixes is allowed to occur at any other than the first position of a codeword. The cardinality of PPS-codes is determined, and coding algorithms are proposed which have a computational complexity proportional to the length of the codewords. It is demonstrated that in comparison with PS-codes, PPS-codes have similar coding and prefix detection complexity, but they have a larger code size and have better error control capabilities     

Analysis and performance evaluation of new coding options for space telecommand links ‐ Part I: AWGN channels

We investigate and compare, over the additive white Gaussian noise channel, different options for updating the error correcting code currently used in space mission telecommand links. Besides some more consolidated proposals, using low‐density parity‐check codes, we characterize and assess the performance of alternative schemes, based on parallel turbo codes and soft‐decision decoded Bose‐Chaudhuri‐Hocquenghem (BCH) codes. The analysis considers relevant metrics like the codeword error rate, the frame error rate, and the undetected frame error rate. The considered codes include binary and non‐binary low‐density parity‐check codes, parallel turbo codes and extended BCH codes, with different decoding algorithms. The complexity of the various schemes and possible limits for their application are considered and discussed. Several numerical examples are provided. International Journal of Satellite Communications and Networking. Copyright © 2014 John Wiley & Sons, Ltd.     

Golden codeword–based modulation schemes for single‐input multiple‐output systems

The Golden code has full rate and full diversity. The Golden codeword matrix contains two pairs of super symbols. Based on one pair of super symbols, two modulation schemes, Golden codeword–based M‐ary quadrature amplitude modulation (GC‐MQAM) and component‐interleaved GC‐MQAM (CI‐GC‐MQAM), are proposed for single‐input multiple‐output (SIMO) systems. Since the complexities of the maximum likelihood detection for the proposed GC‐MQAM and CI‐GC‐MQAM are proportional to O(M²) and O(M⁴), respectively, low complexity detection schemes for the proposed GC‐MQAM and CI‐GC‐MQAM are further proposed. In addition, the theoretical average bit error probabilities (ABEPs) for the proposed GC‐MQAM and CI‐GC‐MQAM are derived. The derived ABEPs are validated through Monte Carlo simulations. Simulation and theoretical results show that the proposed GC‐MQAM can achieve the error performance of signal space diversity. Simulation and theoretical results further show that the proposed CI‐GC‐16QAM, ‐64QAM, and ‐256QAM with three receive antennas can achieve approximately 2.2, 2.0, and 2.1 dB gain at a bit error rate of 4 × 10^?6 compared with GC‐16QAM, ‐64QAM, and ‐256QAM, respectively.     

On cracking direct‐sequence spread‐spectrum systems

Secure transmission of information over hostile wireless environments is desired by both military and civilian parties. Direct‐sequence spread‐spectrum (DS‐SS) is such a covert technique resistant to interference, interception, and multipath fading. Identifying spread‐spectrum signals or cracking DS‐SS systems by an unintended receiver (or eavesdropper) without a priori knowledge is a challenging problem. To address this problem, we first search for the start position of data symbols in the spread signal (for symbol synchronization); our method is based on maximizing the spectral norm of a sample covariance matrix, which achieves smaller estimation error than the existing method of maximizing the Frobenius norm. After synchronization, we remove a spread sequence by a cross‐correlation based method, and identify the spread sequence by a matched filter. The proposed identification method is less expensive and more accurate than the existing methods. We also propose a zigzag searching method to identify a generator polynomial that reduces memory requirement and is capable of correcting polarity errors existing in the previous methods. In addition, we analyze the bit error performance of our proposed method. The simulation results agree well with our analytical results, indicating the accuracy of our analysis in additive white Gaussian noise (AWGN) channel. By simulation, we also demonstrate the performance improvement of our proposed schemes over the existing methods. Copyright © 2009 John Wiley & Sons, Ltd.     

Frame Synchronization Algorithm for LDPC Coded Burst Systems

We present a frame synchronization algorithm for low‐density parity‐check (LDPC) coded burst transmissions, which combines a conventional pilots‐assisted frame synchronization algorithm and a code‐aided algorithm based on the mean magnitude of the soft outputs from the LDPC decoder. With moderate computational complexity, the proposed algorithm is more efficient in bandwidth than conventional pilots‐assisted algorithms. When compared with other code‐aided algorithms, the proposed algorithm offers a better trade‐off between complexity and performance. Simulation results in the case of an 8‐PSK system with (1944, 972) LDPC code show that the proposed algorithm can achieve a performance equivalent to that of the perfect frame synchronization, with a bandwidth efficiency loss of 0.06 dB due to the use of pilot symbols.     

A New Approach for Error Rate Analysis of Wide-Band DSSS-CDMA System with Imperfect Synchronization Under Jamming Attacks

Most of the researches on error rate analysis of direct sequence spread spectrum (DSSS-CDMA) systems assume that the synchronization is perfect. However, in practice, the synchronization is often imperfect due to various effects of channel parameters such as noise and fading. The degree of imperfection further increases due to jamming attacks. The present study, therefore, derives new expressions to compute the probability of error in DSSS-CDMA systems under imperfect synchronisation. It is assumed that the channel is wideband and is subjected to various jamming attacks. A new parameter, called as probability of successful synchronization, was introduced which includes the effects of both the probability of false alarm and detection under fast and slow jammers. Monte Carlo simulations were conducted in MATLAB to establish the validity of the derived mathematical expressions.

     

A fast search algorithm for vector quantization usingL2-norm pyramid of codewords

Vector quantization for image compression requires expensive encoding time to find the closest codeword to the input vector. This paper presents a fast algorithm to speed up the closest codeword search process in vector quantization encoding. By using an appropriate topological structure of the codebook, we first derive a condition to eliminate unnecessary matching operations from the search procedure. Then, based on this elimination condition, a fast search algorithm is suggested. Simulation results show that with little preprocessing and memory cost, the proposed search algorithm significantly reduces the encoding complexity while maintaining the same encoding quality as that of the full search algorithm. It is also found that the proposed algorithm outperforms the existing search algorithms.     

Fast codeword search algorithm for real-time codebook generation inadaptive VQ

Adaptive vector quantisation is used in image sequence coding where the code-book is updated continuously to keep track with the changing source statistics. Hence, for real-time video coding applications, both the processes of quantising the input vectors and updating the codebook are required to be fast. Since the nearest codeword search is involved in both these processes, a fast codeword search algorithm can make the coding process time efficient. The authors describe a proposed codeword search algorithm with reduced search space. The algorithm uses the mean value and the sum of the absolute differences as the two criteria to reject unlikely codewords, thereby saving a great deal of computational time, while introducing no more distortion than the conventional full search algorithm. Simulation results obtained confirm the effectiveness of the proposed algorithm in terms of computational complexity     

Practical frame synchronization for data with unknown distribution on AWGN channels

We study practical frame synchronization based on sequential search of sync markers: these synchronizers can be used for frames of both known or unknown lengths. First, according to the hypothesis testing theory, a new simple metric is derived for the additive white Gaussian noise (AWGN) channel, based on the generalized likelihood ratio test, thus without any assumption on the statistical distribution of the data symbols. An analytical performance evaluation is then given, with closed form expression for the characteristic function of the decision variable. It is shown that a remarkable gain is obtained with respect to correlation based tests.     

Frame and carrier frequency synchronization algorithm for wireless body area network

A wireless body area network (WBAN) is a radio‐frequency‐based wireless communication technology that consists of a number of different sensor and actuator nodes interconnected with a body gateway. Considering the constrained resources in WBAN devices, simple and noise‐robust synchronization algorithms are required. Frame synchronization and frequency offset estimation are extremely important in the design of a robust WBAN receiver. In this paper, a detection strategy such as frame synchronization and frequency estimation is described in the WBAN system, which can improve the receiver performance. In doing so, algorithms are designed or chosen for the frame detection, carrier frequency offset synchronization, and joint fine‐time and phase‐offset estimation by exploiting the spike‐like property of the physical layer convergence protocol preamble and the frame structure in the WBAN system. The performance of the WBAN synchronization receiver is verified by computer simulation. Copyright © 2015 John Wiley & Sons, Ltd.     

Towards improved satellite telecommand link availability

Compliant with the Consultative Committee for Space Data Systems (CCSDS) set of protocols, we explore enhancing the availability service for space links. In particular, we consider specific improved defences against jamming attacks affecting symbol synchronization. More robust adaptive closed‐loop symbol synchronizers are designated with a view to the planned update of the CCSDS standard for the telecommand synchronization and channel coding sublayer of the data link layer. It is shown that adaptive schemes exploiting instantaneous jammer state information are recommended to counter destructive attacks that may harm the availability.     

Initial Timing Acquisition for Binary Phase‐Shift Keying Direct Sequence Ultra‐wideband Transmission

This paper presents a parallel processing searcher structure for the initial synchronization of a direct sequence ultra‐wideband (DS‐UWB) system, which is suitable for the digital implementation of baseband functionalities with a 1.32 Gsample/s chip rate analog‐to‐digital converter. An initial timing acquisition algorithm and a data demodulation method are also studied. The proposed searcher effectively acquires initial symbol and frame timing during the preamble transmission period. A hardware efficient receiver structure using 24 parallel digital correlators for binary phase‐shift keying DS‐UWB transmission is presented. The proposed correlator structure operating at 55 MHz is shared for correlation operations in a searcher, a channel estimator, and the demodulator of a RAKE receiver. We also present a pseudo‐random noise sequence generated with a primitive polynomial, 1+x²+x⁵, for packet detection, automatic gain control, and initial timing acquisition. Simulation results show that the performance of the proposed parallel processing searcher employing the presented pseudo‐random noise sequence outperforms that employing a preamble sequence in the IEEE 802.15.3a DS‐UWB proposal.     

Reliability-based code-search algorithms for maximum-likelihooddecoding of block codes

Efficient code-search maximum-likelihood decoding algorithms, based on reliability information, are presented for binary Linear block codes. The codewords examined are obtained via encoding. The information set utilized for encoding comprises the positions of those columns of a generator matrix G of the code which, for a given received sequence, constitute the most reliable basis for the column space of G. Substantially reduced computational complexity of decoding is achieved by exploiting the ordering of the positions within this information set. The search procedures do not require memory; the codeword to be examined is constructed from the previously examined codeword according to a fixed rule. Consequently, the search algorithms are applicable to codes of relatively large size. They are also conveniently modifiable to achieve efficient nearly optimum decoding of particularly large codes     

Robust Frame Synchronization for Noisy PCM Systems

Serial digital transmission requires reliable frame synchronization at the receiver in order to demultiplex and recover the transmitted signals. This paper proposes a faster and more robust method of detecting frame synchronization. A large serial memory is used to store sufficient received history to include all bits of the synchronizing codeword. Equations have been developed which predict the search and "in frame" performance. These equations have been verified with laboratory models. Using, for example, the well-known D3 PCM system, the reframe time is improved from 48 to 3 ms. With an error rate of 1 percent, the predicted "in frame" time is improved from 1.9 s to several centuries! Techniques for hardware implementation are suggested and application to the extended framing format is discussed.     

一种快速FH-OFDM通信帧格式及其验证

针对通信中跳频与正交频分复用两种技术结合存在同步困难的技术难点,提出一种快速跳频OFDM无线宽带通信帧格式,并设计了一种占用带宽为10 MHz、跳频速率为2 kHz、基带数据传输速率为14.324 Mbit/s的快速跳频OFDM通信收发系统.该帧格式使用加长循环前缀的方式提供高精度载波同步依据,将伪随机序列隐藏到频域数据中以便利用其完成精确定时同步、采样时钟同步和整数倍频偏估计,并且插入了梳状导频以便接收端进行信道估计.实验结果表明,接收机星座图可以很好地收敛,在信噪比为10 dB情况下,误码率低于10-8.本帧格式可较好地满足视频等数据的无线通信要求.     

Cell search in W-CDMA

In a CDMA cellular system, the process of the mobile station searching for a cell and achieving code and time synchronization to its downlink scrambling code is referred to as cell search. Cell search is performed in three scenarios: initial cell search when a mobile station is switched on, idle mode search when inactive, and active mode search during a call. The latter two are also called target cell search. This paper presents algorithms and results for both initial and target cell search scenarios for the wideband CDMA (W-CDMA) standard. In W-CDMA, the cell search itself is divided into five acquisition stages: slot synchronization, frame synchronization and scrambling code group identification, scrambling code identification, frequency acquisition, and cell identification. Initial cell search needs all five stages, while target cell search in general does not need the last two stages. A pipelined process of the first three stages that minimizes the average code and time acquisition time, while keeping the complexity at a reasonable level, is considered. The frequency error in initial cell search, which may be as large as 20 kHz, is taken care of by partial symbol despreading and noncoherent combining. Optimization of key system parameters such as the loading factors for primary synchronization channel, synchronization channel, and common pilot channel for achieving the smallest average code and time acquisition time is studied. After code and time synchronization (the first three stages), a maximum likelihood (ML)-based frequency acquisition method is used to bring down the frequency error to about 200 Hz. The gain of this method is more than 10 dB compared to an alternative scheme that obtains a frequency error estimate using differential detection     

Error-trellises for convolutional codes .II. Decoding methods

For pt. I see ibid. vol.46, p.1592-1601 (1998). Soft-decision maximum-likelihood decoding of convolutional codes over GF(q) can be accomplished via searching through an error-trellis for the least weighing error sequence. The error-trellis is obtained by a syndrome-based construction. Its structure lends itself particularly well to the application of expedited search procedures. The method to carry out such error-trellis-based decoding is formulated by four algorithms. Three of these algorithms are aimed at reducing the worst case computational complexity, whereas by applying the fourth algorithm, the average computational complexity is reduced under low to moderate channel wise level. The syndrome decoder achieves substantial worst case and average computational gains in comparison with the conventional maximum-likelihood decoder, namely the Viterbi decoder, which searches for the most likely codeword directly within the code     

Improved auxiliary particle filter‐based synchronization of chaotic Colpitts circuit and its application to secure communication

In this paper, we propose a synchronization scheme based on an improved auxiliary particle filter (IAPF) for chaotic Colpitts circuit and conduct an experimental study on the synchronization performance with application to secure communications. Specifically, with the synchronization scheme, when the chaotic signals generated by an analog Colpitts circuit are transmitted through a nonideal channel, the distorted signals are processed digitally by the novelly designed IAPF at the receiver, in order to obtain the synchronized signals of the transmitter circuit. Experimental results indicate that synchronization can be achieved over both the additive white Gaussian noise channel and the multipath fading channel with low signal‐to‐noise ratio, even if there exist severe circuit parameter mismatches between the transmitter and the receiver. Furthermore, a chaos‐masking secure communication system is constructed and verified over both the additive white Gaussian noise channel and the multipath fading channel, and the bit error rate is evaluated versus different signal‐to‐noise ratios and symbol periods. It is shown that the achievable bit error rate can reach the order of magnitude of 10 ^{− 4} without error correction coding techniques. In addition, security analysis demonstrates that the proposed chaotic secure communication system is resistant to the brute‐force attack. Copyright © 2013 John Wiley & Sons, Ltd.     

Analysis and performance evaluation of new coding options for space telecommand links – part II: jamming channels

In this paper, we study the performance of telecommand space links affected by pulsed, continuous wave and pseudo‐noise jamming. Countermeasures include coding, interleaving, and direct sequence spread spectrum. Binary and non‐binary low‐density parity‐check codes, parallel turbo codes, and soft‐decision decoded BCH codes are considered. We investigate the impact of different decoding algorithms, also taking into account the role of jamming state information, spreading processing gain and interleaving. The results show that significant gains (up to more than 10 dB) can be achieved in a number of interesting scenarios. Copyright © 2014 John Wiley & Sons, Ltd.     

Fair and efficient scheduling for UMTS forward link

This paper presents two scheduling algorithms, MWF²Q+ and MDRR, for multiple classes of service over the same spectrum in the forward link of the UMTS network. These scheduling algorithms can allocate bandwidth in proportion to weights of flows sharing the channel, and assign OVSF code to backlogged flows on a frame‐by‐frame basis. The MWF²Q+ algorithm has better fairness properties while the MDRR algorithm requires less computational complexity and space complexity. The fairness properties of these scheduling algorithms are analysed in this paper. Our simulation results show that these two algorithms support multiple traffic sources with heterogeneous rate guarantees while fully utilizing the system bandwidth. The impact of self‐similar traffic is also addressed in our simulations. Copyright © 2005 John Wiley & Sons, Ltd.