The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A two-step method is proposed to compute the antenna array parameters for reducing excitation complexity of plane wave generator in this paper. Both the least squares method and genetic algorithm are combined to figure out the phase and position of each unit with selected amplitude. The validity of the method is confirmed by computer simulation and virtual experiments.
Researches on the application of iterative differential demodulation and decoding in SCCC-coded systems are presented. Knowing that the tradition algorithm of iterative decoding in SCCC-coded systems has a high complexity with a two-level iteration structure, a low complexity approach is proposed. In each iteration of the channel decoding, the demodulator uses the extrinsic information of the outer...
We propose a heuristic connection rerouting scheme that iteratively bridges and rolls a subset of connections for improving network utilization. The proposed scheme has no disrupted connection and has low computation and control complexity.
We address the problem of finding the least cost disjoint path pair with delay constraints, where working and protection paths require different delay constraints. A heuristic algorithm is proposed and compared with optimal ILP results.
We evaluate contiguous, discrete and hybrid slot assignment methods under both quasi-static and dynamic traffic conditions. We show the tradeoff among these methods in terms of network performance and system complexity.
We consider the problem of finding end-to-end shortest disjoint paths for a given sequence of domains in multi-domain networks. A Path Computation Element (PCE) serves as a computing entity in each domain, specializing in path computation and optimization. We propose a novel PCE-based scheme that computes the shortest path over multiple domains in the forward direction and computes the disjoint path...
Many algorithms for data mining and machine learning can only process discrete attributes. In order to use these algorithms when some attributes are numeric, the numeric attributes must be discretized. Because of the prevalent of normal distribution, an approximate equal frequency discretization method based on normal distribution is presented. The method is simple to implement. Computing complexity...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.