1-11hit |
Hiroshi UEDA Yoichiro ANZAI Masaya OHTA Shojiro YONEDA Akio OGIHARA
In this paper, two models for associative memory based on a measure of manhattan length are proposed. First, we propose the two-layered model which has an advantage to its implementation by using PDN. We also refer to the way to improve the recalling ability of this model against noisy input patterns. Secondly, we propose the other model which always recalls the nearest memory pattern in a measure of manhattan length by lateral inhibition. Even if a noise of input pattern is so large that the first model can not recall, this model can recall correctly against such a noisy pattern. We also confirm the performance of the two models by computer simulations.
Masaya OHTA Yoichiro ANZAI Shojiro YONEDA Akio OGIHARA
This article analyzes the property of the fully interconnected neural networks as a method of solving combinatorial optimization problems in general. In particular, in order to escape local minimums in this model, we analyze theoretically the relation between the diagonal elements of the connection matrix and the stability of the networks. It is shown that the position of the global minimum point of the energy function on the hyper sphere in n dimensional space is given by the eigen vector corresponding the maximum eigen value of the connection matrix. Then it is shown that the diagonal elements of the connection matrix can be improved without loss of generality. The equilibrium points of the improved networks are classified according to their properties, and their stability is investigated. In order to show that the change of the diagonal elements improves the potential for the global minimum search, computer simulations are carried out by using the theoretical values. In according to the simulation result on 10 neurons, the success rate to get the optimum solution is 97.5%. The result shows that the improvement of the diagonal elements has potential for minimum search.
Hiroshi UEDA Masaya OHTA Akio OGIHARA Kunio FUKUNAGA
A pseudoinverse rule, one of major rule to determine a weight matrix for associative memory, has large capacity comparing with other determining rules. However, it is wellknown that the rule has small domains of attraction of memory vectors on account of many spurious states. In this paper, we try to improve the problem by means of subtracting a constant from all diagonal elements of a weight matrix. By this method, many spurious states disappear and eigenvectors with negative eigenvalues are introduced for the orthocomplement of the subspace spanned by memory vectors. This method can be applied to two types of networks: binary network and analog network. Some computer simulations are performed for both two models. The results of the simulations show our improvement is effective to extend error correcting ability for both networks.
Hiroshi UEDA Masaya OHTA Akio OGIHARA Kunio FUKUNAGA
In this article, the autocorrelation associative neural network that is one of well-known applications of neural networks is improved to extend its capacity and error correcting ability. Our approach of the improvement is based on the consideration that negative self-feedbacks remove spurious states. Therefore, we propose a method to determine the self-feedbacks as small as possible within the range that all stored patterns are stable. A state transition rule that enables to escape oscillation is also presented because the method has a possibility of falling into oscillation. The efficiency of the method is confirmed by means of some computer simulations.
Masaya OHTA Keiichi MIZUTANI Katsumi YAMASHITA
In this letter, a neural network (NN) for peak power reduction of an orthogonal frequency-division multiplexing (OFDM) signal is improved in order to suppress its computational complexity. Numerical experiments show that the amount of IFFTs in the proposed NN can be reduced to half, and its computational time can be reduced by 21.5% compared with a conventional NN. In comparison with the SLM, the proposed NN is effective to achieve high PAPR reduction and it has an advantage over the SLM under the equal computational condition.
Masaya OHTA Kazumichi MATSUMIYA Akio OGIHARA Shinobu TAKAMATSU Kunio FUKUNAGA
This article analyzes dynamics of the chaotic neural network and minimum searching principle of this network. First it is indicated that the dynamics of the chaotic newral network is described like a gradient decent, and the chaotic neural network can roughly find out a local minimum point of a quadratic function using its attractor. Secondly It is guaranteed that the vertex corresponding a local minimum point derived from the chaotic neural network has a lower value of the objective function. Then it is confirmed that the chaotic neural network can escape an invalid local minimum and find out a reasonable one.
Masaya OHTA Hideyuki YAMADA Katsumi YAMASHITA
This paper proposes a novel Orthogonal frequency-division multiplexing (OFDM) system based on polynomial cancellation coded OFDM (PCC-OFDM). This proposed system can reduce peak-to-average power ratio (PAPR) by our neural phase rotator and it does not need any side information to transmit phase rotation factors. Moreover, this system can compensate the common phase error (CPE) by a proposed technique which allows estimating frequency offset at receiver. From numerical experiments, it is shown that our system can reduce PAPR and ICI at the same time and improve BER performance effectively.
Hikaru KAWASAKI Masaya OHTA Katsumi YAMASHITA
The spectrum sculpting precoder (SSP) is a precoding scheme for sidelobe suppression of frequency division multiplexing (OFDM) signals. It can form deep spectral notches at chosen frequencies and is suitable for cognitive radio systems. However, the SSP degrades the error rate as the number of notched frequencies increases. Orthogonal precoding that improves the SSP can achieve both spectrum notching and the ideal error rate, but its computational complexity is very high since the precoder matrix is large in size. This paper proposes an effective and equivalent decomposition of the precoder matrix by QR-decomposition in order to reduce the computational complexity of orthogonal precoding. Numerical experiments show that the proposed method can drastically reduce the computational complexity with no performance degradation.
Akira YAMAMOTO Masaya OHTA Hiroshi UEDA Akio OGIHARA Kunio FUKUNAGA
We propose an asymmetric neural network which can solve inequality-constrained combinatorial optimization problems that are difficult to solve using symmetric neural networks. In this article, a knapsack problem that is one of such the problem is solved using the proposed network. Additionally, we study condition for obtaining a valid solution. In computer simulations, we show that the condition is correct and that the proposed network produces better solutions than the simple greedy algorithm.
Akira YAMAMOTO Masaya OHTA Hiroshi UEDA Akio OGIHARA Kunio FUKUNAGA
The Traveling Salesman Problem (TSP) can be solved by a neural network using the coding scheme based on the adjacency of city in the tour. Using this coding scheme, the neural network generates a better solution than that using other coding schemes. We, however, often get the invalid solution consisting of some subtours. In this article, we propose a method of eliminating subtours using additional neurons. On the computer simulation it is shown that we get the optimum solution by means of taking only O(n2) additional neurons and trials.
Masaya OHTA Akio OGIHARA Kunio FUKUNAGA
This article deals with the binary neural network with negative self-feedback connections as a method for solving combinational optimization problems. Although the binary neural network has a high convergence speed, it hardly searches out the optimum solution, because the neuron is selected randomly at each state update. In thie article, an improvement using the negative self-feedback is proposed. First it is shown that the negative self-feedback can make some local minimums be unstable. Second a selection rule is proposed and its property is analyzed in detail. In the binary neural network with negative self-feedback, this selection rule is effective to escape a local minimum. In order to comfirm the effectiveness of this selection rule, some computer simulations are carried out for the N-Queens problem. For N=256, the network is not caught in any local minimum and provides the optimum solution within 2654 steps (about 10 minutes).