3 resultados para Modified Berlekamp-Massey algorithm

em Aston University Research Archive


Relevância:

30.00% 30.00%

Publicador:

Resumo:

We propose two algorithms involving the relaxation of either the given Dirichlet data or the prescribed Neumann data on the over-specified boundary, in the case of the alternating iterative algorithm of ` 12 ` 12 `$12 `&12 `#12 `^12 `_12 `%12 `~12 *Kozlov91 applied to Cauchy problems for the modified Helmholtz equation. A convergence proof of these relaxation methods is given, along with a stopping criterion. The numerical results obtained using these procedures, in conjunction with the boundary element method (BEM), show the numerical stability, convergence, consistency and computational efficiency of the proposed methods.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

We propose - as a modification of the optical (RF) pilot scheme -a balanced phase modulation between two polarizations of the optical signal in order to generate correlated equalization enhanced phase noise (EEPN) contributions in the two polarizations. The method is applicable for n-level PSK system. The EEPN can be compensated, the carrier phase extracted and the nPSK signal regenerated by complex conjugation and multiplication in the receiver. The method is tested by system simulations in a single channel QPSK system at 56 Gb/s system rate. It is found that the conjugation and multiplication scheme in the Rx can mitigate the EEPN to within 1/2 orders of magnitude. Results are compared to using the Viterbi-Viterbi algorithm to mitigate the EEPN. The latter method improves the sensitivity more than two orders of magnitude. Important novel insight into the statistical properties of EEPN is identified and discussed in the paper. © 2013 Optical Society of America.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Ant Colony Optimisation algorithms mimic the way ants use pheromones for marking paths to important locations. Pheromone traces are followed and reinforced by other ants, but also evaporate over time. As a consequence, optimal paths attract more pheromone, whilst the less useful paths fade away. In the Multiple Pheromone Ant Clustering Algorithm (MPACA), ants detect features of objects represented as nodes within graph space. Each node has one or more ants assigned to each feature. Ants attempt to locate nodes with matching feature values, depositing pheromone traces on the way. This use of multiple pheromone values is a key innovation. Ants record other ant encounters, keeping a record of the features and colony membership of ants. The recorded values determine when ants should combine their features to look for conjunctions and whether they should merge into colonies. This ability to detect and deposit pheromone representative of feature combinations, and the resulting colony formation, renders the algorithm a powerful clustering tool. The MPACA operates as follows: (i) initially each node has ants assigned to each feature; (ii) ants roam the graph space searching for nodes with matching features; (iii) when departing matching nodes, ants deposit pheromones to inform other ants that the path goes to a node with the associated feature values; (iv) ant feature encounters are counted each time an ant arrives at a node; (v) if the feature encounters exceed a threshold value, feature combination occurs; (vi) a similar mechanism is used for colony merging. The model varies from traditional ACO in that: (i) a modified pheromone-driven movement mechanism is used; (ii) ants learn feature combinations and deposit multiple pheromone scents accordingly; (iii) ants merge into colonies, the basis of cluster formation. The MPACA is evaluated over synthetic and real-world datasets and its performance compares favourably with alternative approaches.