scholarly journals Noise-like discrete signals for asynchronous code division radio systems

Radiotekhnika ◽  
2021 ◽  
pp. 175-183
Author(s):  
A.A. Kuznetsov ◽  
O.A. Smirnov ◽  
T.Y. Kuznetsova

This article discusses noise-like discrete signals (pseudo-random sequences) for asynchronous code division systems for radio channels. Asynchrony implies the use of sequences that are statistically uncorrelated for an arbitrary cyclically shifted copy of the signals, i.e. their cross-correlation coefficient for arbitrarily chosen starting points is close to zero. The fundamental theoretical limit for this characteristic is the well-known Welch boundary. In this paper, we compare the correlation properties of various sets (Gold codes, Kasami sequences, etc.) with this fundamental limit. The parameters of different codes are estimated, the corresponding bound is shown and compared with the real correlation characteristics of the codes. For the approximation, the Laurent series expansion and the Puiseau series were used. The asymptotic properties were also estimated. The paper also considers new ensembles of noise-like discrete signals for asynchronous systems. These codes are statistically uncorrelated, asymptotically the square of their cross-correlation for arbitrary starting points tends to the theoretical Welch bound. Moreover, the cardinality (power of the set) of new signal ensembles is much higher than that of Gold codes and Kasami sets. Consequently, the practical use of such noise-like discrete signals will increase the capacity of asynchronous code division systems for radio channels and reduce the cost of communication services. In addition, new sets of spreading signals will be useful for the implementation of the so-called. soft capacity, i.e. when, if necessary, the base station can increase the subscriber capacity with a slight decrease in the quality of service.

2008 ◽  
Vol 2008 ◽  
pp. 1-11 ◽  
Author(s):  
Konstantinos Drakakis ◽  
Rod Gow ◽  
John Healy ◽  
Scott Rickard

We consider the cross-correlation of a Costas array with its image under a horizontal and/or a vertical flip. We propose and prove several bounds on the maximal cross-correlation and on its value at the origin, for both general Costas arrays and for algebraically constructed ones.


2013 ◽  
Vol 392 ◽  
pp. 867-871
Author(s):  
Ming Xia Lv ◽  
Yan Kun Lai ◽  
Dong Tang

The total throughput of the communication system can be maximized by allocating the common radio resource to the user or the user group having the best channel quality at a given time and the multiuser diversity gain can be obtained when multiple users share the same channel at one time. The object to select the users is to select the users with the maximum sum capacity. As for a scheduling algorithm, exhaustive algorithm can get the largest capability of the system by multi-user scheduling. However, this algorithm is quite complex hence the cost of operation to a base station has substantial increased. We compare the multiuser performance of two fast user selection algorithms with low complexity in MIMO-MRC systems with co-channel interferences. From the simulation results, these two algorithms not only decrease the computational complexity of the scheduling algorithm but also retain large capability of the MIMO system.


2013 ◽  
Vol 333-335 ◽  
pp. 623-627
Author(s):  
Jing Jun Li ◽  
Yong Hua Jiang ◽  
Bo Dan ◽  
Wei Wei Gao

Orthogonal discrete frequency coding waveforms(DFCWs) is an ideal quasi-orthogonal waveform. This paper analyses the ambiguity function of DFCWs and the results indicate that the correlation characteristics of DFCWs have only relationship with the code length and coding order. Based on the theoretical analysis, we defined the cross-correlation energy as the cost function, and used the improved discrete particle swarmoptimization(DPSO) to optimize the order of DFCWs. The new signal can effectively restrain the cross-correlation level between the two DFCWs. Simulation results verify the effectiveness of the designed DFCWs.


2019 ◽  
pp. 1020-1030
Author(s):  
Yazan Migdadi

The aim of this study is to identify the green mobile telecommunication base station design practices as adopted by leading cases, four cases were analyzed; Ericsson, ZTE, Huawei, and Bharti. The data were collected from the published data. This study reveals that; the design attributes could be classified to; primary and secondary design attributes. A lot of relationships are reported between the design attributes. This study helps the academics in understanding the relationship between design attributes and actions, so they can use the reported model of this study for teaching purposes or for further extended survey study. The base stations developer and mobile communication services providers have a good insight about the sustainable design alternatives. The green operations practices are still new and the research contribution is limited, the research contribution of green mobile telecommunication base station deign is very limited.


Author(s):  
Mischa Dohler ◽  
Djamal-Eddine Meddour ◽  
Sidi-Mohammed Senouci ◽  
Hassnaa Moustafa

An ever-growing demand for higher data-rates has facilitated the growth of wireless networks in the past decades. These networks, however, are known to exhibit capacity and coverage problems, hence jeopardizing the promised quality of service towards the end-user. To overcome these problems, prohibitive investment costs in terms of base station or access point rollouts would be required if traditional, non-scalable, cell-splitting, and micro-cell capacity dimension procedures were applied. The prime aim of current R&D initiatives is, hence, to develop innovative network solutions that decrease the cost per bit/s/Hz over the wireless link. To this end, cooperative networks have emerged as an efficient and promising solution. We discuss in this chapter some key research and deployment issues, with emphasis on cooperative architectures, networking, and security solutions. We expose some motivations to use such networks, as well as latest state-of-the-art developments, open research challenges, and business models.


2019 ◽  
Vol 10 (3) ◽  
pp. 39-67
Author(s):  
Sangeetha J ◽  
Keerthiraj Nagaraj ◽  
Ram Prakash Rustagi ◽  
Balasubramanya Murthy K N

The Relay Station (RS) deployment problem for WiMAX networks is studied. Unlike Base Station (BS), RS does not need a wire-line backhaul and has much lower hardware complexity. Hence, usage of RSs can significantly minimize the deployment cost and maximize the network coverage of the system. To solve the RS deployment problem, the authors have used a nature inspired technique known as Glowworm Swarm Optimization (GSO). Different cases have been considered for a single fixed BS, to find the feasible number of RSs and its optimal placement in WiMAX networks. Computational experiments are conducted to show the effect of RS deployments in different distribution scenarios. This article also shows the impact of placing RSs at optimal locations to serve given Mobile Stations (MSs) that are distributed arbitrarily in a given geographic region such that the cost is minimized, and the network coverage is maximized. The results obtained from the GSO algorithm are compared with k-means algorithm and it is observed that GSO performs better than k-means algorithm.


Sign in / Sign up

Export Citation Format

Share Document