流星突发通信中的增量冗余传输方案

在流星突发通信中,混合ARQ技术能有效保障数据传输的有效性和可靠性。文中通过对传统的增量冗余传输方案进行分析,提出了一种改进的短码字重传冗余HARQ方案,并对单条余迹下两个站点间的数据通信进行了仿真。理论分析和仿真结果表明,改进后的方案能有效抑制噪声干扰,增加吞吐量。     

A queuing model for meteor burst packet communication systems

A discrete-time queuing model for the performance of a meteor-burst packet communication system is analyzed using matrix analytic methods. Not only is the system subject to interruptions due to the intermittence of the ionization layer, but its analysis is further complicated by the necessity to retransmit packets that have error or that occur at the tail end of a period of availability of the system. The authors' model takes such complexities into account. It is also of independent methodological interest in that it provides an exact analysis of a general queuing model with service interruptions. For the application at hand, the authors demonstrate the feasibility of the algorithms by a selected set of numerical examples. The algorithm can be used to ascertain the effects of the packet size, the bit error rate, the sync acquisition time, and other variables on system performance     

Coding for meteor burst communications

The use of error correction coding for meteor burst communications is discussed. The cutoff rate is derived for a meteor burst channel model which assumes that the received signal amplitude decays exponentially. The message error rate of a coded system, obtained by means of computer simulation, is compared to that of an uncoded system. A tight upper bound on the performance of the coded system is presented. It is shown that coding can reduce the signal-to-noise ratio (SNR) required for reliable communications via meteor bursts by many decibels. The coding gain is larger at shorter communication ranges where meteor trails, decay faster. It is also shown that the additional improvement achieved by providing the decoder with side information on the instantaneous level of the received signal is small     

Optimal signaling for meteor burst channels

We examine the design of modulation systems for meteor burst communications. In particular, we present a technique which allows the designer to determine the signal set size and the signaling rate which maximize the throughput per meteor burst. The technique, which involves the capacity and cutoff rate from information theory, is applied to a variable coding rate scheme and a variable signaling rate scheme, for both coherent MPSK (M=2, 4, 8) and noncoherent MFSK (M=2, 4, 8, 16, 32). As a fringe benefit, the method proposed also provides estimates on achievable throughputs     

流星余迹信道建模与仿真分析

为检验流星余迹通信设备及软件在实战化环境中的应用效能,针对流星余迹通信信道规律复杂、实测代价高等问题,建立流星余迹信道仿真模型。通过对典型数学模型的深入研究,以欠密类流星余迹和过密类流星余迹信道模型为基础,融入了欠密类流星簇和多径信道两种特殊类型,按照概率论原理,建立了流星余迹信道混合模型,并结合流星余迹到达间隔模型,利用C++实现了流星余迹信道混合模型的仿真。该模型可生成包含单颗欠密类、单颗过密类、欠密类流星簇和多径信道等多种类型的复杂信道。仿真结果表明,所产生的流星余迹信道特征与实际信道基本相符,验证了该模型的可用性和合理性。     

极低码率视频压缩编码算法的改进方法

本文从系统结构出发，充分利用低码率系统的特点，提出一种基于自适应判断的改进方法，较之已报道的方法，本文算法在基本保证图像质量的同时，有效地避免了一些冗余计算。将系统的基本运算量需求（不计运动估值算法的影响）降低到原来的５０％，从而使系统速度提高。由于该方法改进的角度较为新颖、独立，如果和其他快速算法相补充、结合使用，可以获得更优的性能。因此，本文算法在视频压缩系统中有较广泛的发展前景。     

An adaptive receiver of joint data and channel estimation for meteor burst communications

In view of the characteristics of the meteor burst channel, the variable rate data transmission should be adopted to improve the system average throughput, which results in channel tracing and equalization problems at the receiver. Although the joint data and channel estimation of maximum likelihood sequence detection performing the principle of per‐survivor processing (PSP) is considered as an optimal detection scheme, its great computational complexity is a major problem and can hardly agree with the decreasing of the meteor channel. Based on the estimation of the system parameters, an adaptive state reduction of the PSP (ASRP) algorithm with only a few states in the trellis diagram is employed, while these states are chosen by the time‐varying threshold according to the exponential decay of meteor channels. It is shown that, ASRP can make a good tradeoff between the performance and the computational complexity, and provides reliable data transmission for adaptive modulation and coding of the meteor burst communication system. Computer simulation results and performance analysis are also included to support our developments. Copyright © 2010 John Wiley & Sons, Ltd.     

Spatio-temporal coding for wireless communication

Multipath signal propagation has long been viewed as an impairment to reliable communication in wireless channels. This paper shows that the presence of multipath greatly improves achievable data rate if the appropriate communication structure is employed. A compact model is developed for the multiple-input multiple-output (MIMO) dispersive spatially selective wireless communication channel. The multivariate information capacity is analyzed. For high signal-to-noise ratio (SNR) conditions, the MIMO channel can exhibit a capacity slope in bits per decibel of power increase that is proportional to the minimum of the number multipath components, the number of input antennas, or the number of output antennas. This desirable result is contrasted with the lower capacity slope of the well-studied case with multiple antennas at only one side of the radio link. A spatio-temporal vector-coding (STVC) communication structure is suggested as a means for achieving MIMO channel capacity. The complexity of STVC motivates a more practical reduced-complexity discrete matrix multitone (DMMT) space-frequency coding approach. Both of these structures are shown to be asymptotically optimum. An adaptive-lattice trellis-coding technique is suggested as a method for coding across the space and frequency dimensions that exist in the DMMT channel. Experimental examples that support the theoretical results are presented     

Performance of short- and long-range meteor burst communicationsystems with different antennas

The performance of meteor burst communication at different ranges for a number of antenna configurations is analyzed. Characteristics of ideal antenna patterns for short- and long-range meteor scatter communication are described. An ideal antenna configuration matches its illumination pattern to the spatial arrival pattern of meteor trails. The analysis is used to compare the performance of several commonly used antenna configurations. It will be demonstrated that the characteristics of antennas which perform well at short ranges are different than those that perform well at long ranges     

Network coding for wireless communication networks

This special issue includes a collection of 19 outstanding research papers which cover a diversity of topics on the application of network coding in wireless communication networks.     

Channel coding strategies for cellular radio

To improve re-use of time/frequency slots in a cellular radio system, it is desirable for the average interference levels seen by all users to be made approximately equal. The authors provide constructions based on orthogonal latin squares that guarantee different sets of users will interfere in successive slots. When signal to interference ratios are independent from successive symbols, channel codes can provide a large diversity gain which is far in excess of the gain against additive noise. Consequently, coding with interleaving fits together very naturally with this construction. The authors illustrate how to achieve large performance improvement using convolutional codes with low decoding delay in a slow hopped system     

流星通信链路的流星辐射分布模型

分析研究了流星前向散射通信链路和黄道坐标系统的关系,推导出偶发流星日心分布到地心分布密度的转换过程,得到了偶发流星的理论辐射分布(SporadicMeteor Radiant Distribution)模型.并运用该理论预测模型建立了一通信链路上空流星辐射分布,同时对可用流星率进行预测并和观测数据进行对比,结果比较一致,为流星通信系统的建立提供了技术支持.     

Multivariate modulation and coding for wireless communication

This paper explores the improvement in information capacity and practical data rate that is possible with adaptive antenna technology applied to wireless-multipath communication channels. Whereas the conventional view is that multipath-signal propagation is an impediment to reliable communication, this paper shows that multipath can actually multiply the achievable data rate for wireless channels provided that the appropriate communication structure is employed. Multivariate discrete multitone (MDMT) combined with multivariate trellis-coded modulation (MTCM) is proposed and analyzed as a practical means of realizing a multiplicative-rate advantage in the case where channel-state information is not available at the transmitter. In Rayleigh fading, these new techniques are shown to simultaneously achieve a multiplicative data-rate advantage and lower error rate as compared to conventional coded orthogonal-frequency division multiplexing. Optimal minimum mean square error (MMSE), adaptive MDMT channel-estimation techniques are derived. The effects of channel-estimation error on MTCM are analyzed     

Wideband coding for uncoordinated multiple access communication

The authors review many of the coding techniques which have been proposed for use in spread-spectrum communication links. In these systems, narrow-band data accesses a common wideband channel, with each subscriber assigned to a unique access code. This code division multiple access (CDMA) system permits uncoordinated access to the channel with the interference level set by the total number of active subscribers. The authors investigate pseudo-noise (PN) and related sequence sets, specifically the auto- and crosscorrelation responses are examined both with and without data transmissions. These are quantified in terms of peak sidelobe errors, characteristic probability density function and bit error ratio performance in the CDMA multi-user traffic environment. This allows the CDMA capacity to be predicted given the bit rate requirements, total available bandwidth and required bit error ratio     

Scanning order strategies for bitplane image coding

Scanning orders of bitplane image coding engines are commonly envisaged from theoretical or experimental insights and assessed in practice in terms of coding performance. This paper evaluates classic scanning strategies of modern bitplane image codecs using several theoretical-practical mechanisms conceived from rate-distortion theory. The use of these mechanisms allows distinguishing those features of the bitplane coder that are essential from those that are not. This discernment can aid the design of new bitplane coding engines with some special purposes and/or requirements. To emphasize this point, a low-complexity scanning strategy is proposed. Experimental evidence illustrates, assesses, and validates the proposed mechanisms and scanning orders.     

Optimal coding strategies for certain permuting channels

We give optimal coding strategies for nonprobabilistic permuting (especially, "trapdoor") channels and also for a permuting relay channel. Our results open the door to a coding theory for nonprobabilistic (or deterministic) channels with memory.     

突发OFDM信号定时同步估计算法的改进和实现

突发OFDM信号的接收需要快速准确的定时同步。Schmidl和Cox提出的同步方法（SCA）得到的估计值方差比较大，准确度不高。这里以SCA得到的结果为基础，在FFT运算后进行路径延迟时间估计，根据得到的结果对前面的粗估计值进行修正，使得估计准确度提高。仿真结果和相应的DSP硬件电路实际测试证明该方法大大改善了定时同步的性能。     

非协同突发信号的检测与解调

根据典型的海事三代卫星通信帧格式,首先采用能量检测算法结合匹配滤波法进行有效的突发信号的检测,然后根据信号检测的结果进行了突发信号的频率估计和初相估计,再采用初相注入结合锁相环的方式实现突发信号的解调。理论推导和计算仿真表明,该方法能够适应较低信噪比、较大频偏和起伏动态的影响,当信噪比大于10 dB时,信号检测概率基本达到100%,解调误码率低于2×10-3。     

Improved coding techniques for preceded partial-response channels

A coset of a convolutional code may be used to generate a zero-run length limited trellis code for a 1-D partial-response channel. The free squared Euclidean distance, d_free², at the channel output is lower bounded by the free Hamming distance of the convolutional code. The lower bound suggests the use of a convolutional code with maximal free Hamming distance, d_max(R,N), for given rate R and number of decoder states N. In this paper we present cosets of convolutional codes that generate trellis codes with d_free ²>d_max(R,N) for rates 1/5⩽R⩽7/9 and (d _free²=d_max(R,N) for R=13/16,29/32,61/64, The tabulated convolutional codes with R⩽7/9 were not optimized for Hamming distance. Instead, a computer search was used to determine cosets of convolutional codes that exploit the memory of the 1-D channel to increase d_free² at the channel output. The search was limited by only considering cosets with certain structural properties. The R⩾13/16 codes were obtained using a new construction technique for convolutional codes with free Hamming distance 4. Newly developed bounds on the maximum zero-run lengths of cosets were used to ensure a short maximum run length at the 1-D channel output