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.
In this paper, we study the problem of sum-rate maximization for an active channel subject to two constraints, one on the source total transmit power and one on the channel energy (or total power). Here, active channel refers to a parallel channel where not only can the source transmit power over different subchannels can be optimally calculated but also the gains of the subchannels can also be adjusted...
In this letter, we study the problem of joint power allocation and channel design for an active link which conveys information from a source to a destination through multiple orthogonal subchannels. In such a link, the power can be injected into the channel not only at the source but also at each subchannel. For such a parallel channel, we study the problem of sum-rate maximization under the assumption...
According to the U.S. Federal Standard coder for 2400 bps, a data frame containing 54 bits of encoded signals are transmitted every 22.5 (ms). In each frame, 25 bits encode the spectral features (10 Line Spectrum Frequencies (LSF)). This paper describes a method to reduce the transmission rate while preserving most of the quality and intelligibility. The performance of the proposed coder is at about...
This paper proposes a practical adaptive version of the algorithm SVD-QR-T, which was proposed in [11]. We call this new proposed algorithm ‘Adaptive SVD-QR-T FCM’, in which the fuzzy c-means (FCM) adaptively adjusts the number of clusters it uses, compared with the SVD-QR-T in which only two clusters are employed. The proposed algorithm selects a subset of channels in virtual multiple-input-multiple-output...
This paper proposes a practical adaptive version of the algorithm SVD-QR-T, which was proposed in [11]. We call this new proposed algorithm „Adaptive SVD-QR-T FCM', in which the fuzzy c-means (FCM) adaptively adjusts the number of clusters it uses, compared with the SVD-QR-T in which only two clusters are employed. The proposed algorithm selects a subset of channels in virtual multiple-input-multiple-output...
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.