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.
Multicast services are used in emerging multimedia applications based on Quality of Service (QoS) development of multimedia group application and the construction of multicast routing tree is significant. Upper bound on the delay between sender and receiver is one of the common QoS constraints. Delay-constrained routing protocols are used to find paths subject to the delay constraint while efficiently...
In this paper, we propose a method on the training based on channel estimation issues for relay networks that employ amplify-and-forward (AF) transmission scheme. We have to point out that jointly estimating the channel from source to relay and relay to destination suffers from many drawbacks in fast fading case because the estimation of previous pilots is not suitable for current channel. In this...
Factorization of large integers gives a method to successfully attack on RSA cryptosystem algorithm. Williams p+1 gives us such algorithm to factorize the integer n; if there exists a prime divisor p, such that p+1 will have only a small prime divisors. In this paper we demonstrate this algorithm using matrices and show that the method can be generalized.
One of the weak points for LDPC encoding is the computational complexity in communication system. An efficient encoding was presented by Richardson who approached making codeword by using parity check matrices with low density. In this paper, we focus on computational complexity of Richardson's LDPC matrix which is composed by matrix A, B, C, D, E and T. We propose two schemes for low complexity encoding...
We propose a construction of Jacket matrices based on additive characters of the finite field Fq and q-ary m-sequences. This approach is a generalization of method of obtaining Hadamard matrices from binary PN-sequences.
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.