Spread Spectrum PN Code Acquisition Using Hybrid Correlator Architectures

A hybrid correlator architecture is described which combines the serial structure of an active correlator with the parallel structure of a matched filter correlator. The mean PN code acquisition time performance of this hybrid serial-parallel correlator structure is analysed. Results are shown which compare the acquisition performance of the serial, parallel, and serial-parallel structures. The results are for a PN code length of 64 code chips and assumes a Gaussian channel with the receiver detection threshold set to obtain a constant false alarm rate. An enhancement to the serial-parallel acquisition algorithm is also described which can increase the acquisition time performance by about 15% for typical operating conditions. Overall the results demonstrate that the hybrid correlator can provide rapid code acquisition with a limited receiver complexity.     

k-边覆盖对策及其核心

本文针对从图的k-边覆盖问题引出的合作对策模型，利用线性规划对偶理论得到了其核心非空的一个充分条件和构造核心分配的多项式时间算法，并将这一结果推广到了一般的k-集合覆盖对策模型中．     

Kinetics of cooperative conformational transitions of lineal biopolymers

Cooperative conformational transitions of proteins and nucleic acids are of decisive importance to many processes of molecular biology, and particularly to their regulation. They proceed via numerous interdependent elementary processes, and their kinetics are therefore often complicated. They are frequently also very fast. However, kinetic analyses can be carried out by chemical relaxation methods. The theoretical interpretation is comparatively simple in the case of linear biopolymers. When the linear Ising model extended for kinetics was applied to model peptides and polynucleotides, it provided an insight into the fundamental principles of cooperative transformations.     

Studies on the kinetics of polymerization of vinyl acetate by benzoyl peroxide at 60° using pyridine as solvent

Kinetics of Bz₂O₂-initiated polymerization of VAC in pyridine at 60° were investigated. The polymerization was significantly retarded by pyridine. The monomer exponent decreased from 2.5 at a relatively low [Bz₂O₂] (1.0 × 10^?2 M) to 2.0 at [Bz₂O₂] ? 4.0 × 10^?2 M. The observed kinetic features were explained on the basis of degradative chain transfer and copolymerization with pyridine.     

On the population monotonicity of independent set games

An independent set game is a cooperative game dealing with profit sharing in the maximum independent set problem. A population monotonic allocation scheme is a rule specifying how to share the profit of each coalition among its participants such that every participant is better off when the coalition expands. In this paper, we provide a necessary and sufficient characterization for independent set games admitting population monotonic allocation schemes. Moreover, our characterization can be verified efficiently.     

A new approach to agglomeration problems

In this paper, we study a location problem with positive externalities. We define a new transferable utility game, considering there is no restriction on the transfer of benefits between firms. We prove that the core of this game is non-empty, provide an expression for it, and an axiomatic characterization. We also study several core allocations, selected by means of a certain bankruptcy problem.     

On the design considerations of solid-state power amplifiers for satellite communications: A systems perspective

Conventional solid-state power amplifier (SSPA) design approach isolates radio frequency (RF) design from communication theory. In this paper, a unified SSPA design approach is proposed, which optimizes SSPA parameters (bias voltage and input RF signal power) to minimize total DC power consumption while satisfying received SNR constraint specified by the link budget. The effect of SSPA nonlinearity is quantified by the error vector magnitude measured at its output and the corresponding received SNR degradation is analyzed. Using the quantitative metrics for received SNR, it is possible to evaluate highly nonlinear SSPA classes such as Class-B or deep-Class AB, which are normally not considered in conventional SSPA design approach to be used in satellite communication applications.     

Help from space: grant-free massive access for satellite-based IoT in the 6G era

The Sixth-Generation (6G) standard for wireless communications is expected to realize ubiquitous coverage for massive Internet of Things (IoT) networks by 2030. Satellite-based communications are recognized as a highly promising technical enabler to satisfy IoT service requirements in the 6G era. This study analyzes multiple access technologies, which are essential for the effective deployment of satellite-based IoT. First, we thoroughly investigate the existing research related to massive access, including information-theory considerations as well as Non-Orthogonal Multiple Access (NOMA) and Random Access (RA) technologies.Then, we explore the influence of the satellite transmission environment on multiple access technologies. Based on this study, a Non-orthogonal Massive Grant-Free Access (NoMaGFA) scheme, which reaps the joint benefits of RA and NOMA, is proposed for asynchronous transmissions in satellite-based IoT to achieve improved system throughput and enhance the system robustness under varying traffics. Finally, we identify some important and interesting future developments for satellite-based IoT, including waveform design, transceiver design, resource allocation, and artificial intelligence-enhanced design.     

无线多中继系统中判决门限辅助的快速Z转发协作

针对Z向转发(ZF)协作所有中继节点均参与协作转发导致的能耗利用不合理问题, 该文提出了一种适用于多中继场景下的门限辅助判决快速Z转发(DT-FZF)协作.当中继节点处接收信号对数似然比(LLR)的绝对值小于门限时,中继节点不参与协作转发;否则中继节点协作转发经截断后的对数似然比(LLR).放大转发(AF)、译码转发(DF)、分段转发(PF)和ZF协作可看作DT-FZF协作的特殊情况.在三中继系统,误比特率(BER)为10–3时,相比ZF协作,所提协作可获得约0.8 dB的性能增益.     

Cooperative Competition Clustering for Gene Selection

Clustering analysis of data from DNA microarray hybridization studies is an essential task for identifying biologically relevant groups of genes. Attribute cluster algorithm (ACA) has provided an attractive way to group and select meaningful genes. However, ACA needs much prior knowledge about the genes to set the number of clusters. In practical applications, if the number of clusters is misspecified, the performance of the ACA will deteriorate rapidly. We propose the Cooperative Competition Cluster Algorithm (CCCA) in this paper. In the algorithm, we assume that both cooperation and competition exist simultaneously between clusters in the process of clustering. By using this principle of Cooperative Competition, the number of clusters can be found in the process of clustering. Experimental results on a synthetic and gene expression data are demonstrated. The results show that CCCA can choose the number of clusters automatically and get excellent performance with respect to other competing methods.