<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>Vol. 03, Issue 1, January 2008</title>
<link href="http://dspace.daffodilvarsity.edu.bd:8080/handle/123456789/1495" rel="alternate"/>
<subtitle/>
<id>http://dspace.daffodilvarsity.edu.bd:8080/handle/123456789/1495</id>
<updated>2026-04-14T18:16:19Z</updated>
<dc:date>2026-04-14T18:16:19Z</dc:date>
<entry>
<title>POWER ALLOCATION WITH AND WITHOUT SOFT HANDOVER ON THE DOWNLINK INTERFERENCE OF            WCDMA NETWORK</title>
<link href="http://dspace.daffodilvarsity.edu.bd:8080/handle/20.500.11948/469" rel="alternate"/>
<author>
<name>Rana, Md. Masud</name>
</author>
<author>
<name>Rahman, Md. Mostafizur</name>
</author>
<author>
<name>Nyeem, Hussein Md. Abu</name>
</author>
<author>
<name>Alam, Sk. Shariful</name>
</author>
<id>http://dspace.daffodilvarsity.edu.bd:8080/handle/20.500.11948/469</id>
<updated>2019-05-28T09:39:22Z</updated>
<published>2008-01-01T00:00:00Z</published>
<summary type="text">POWER ALLOCATION WITH AND WITHOUT SOFT HANDOVER ON THE DOWNLINK INTERFERENCE OF            WCDMA NETWORK
Rana, Md. Masud; Rahman, Md. Mostafizur; Nyeem, Hussein Md. Abu; Alam, Sk. Shariful
Power control is one of the technologies used to utilize the radio resources as efficient as possible in WCDMA network. The transmission power is adjusted to transmit with the lowest power level possible while the required received signal quality is maintained. Since there is large variation in channel quality over time, the power has to be adjusted to compensate for these variations. During moments of bad channel conditions a high transmission power has to be used which will to a greater extent interfere with other users in the system. This work emphasis relative down link power measurement at various distances and various angles under various radio environment conditions. Also calculate required the down link power by both with and without soft handover condition.
</summary>
<dc:date>2008-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>NATURAL CONVECTION IN SQUARE ENCLOSURE WITH  ADIABATIC CYLINDER AT CENTER AND DISCRETE               BOTTOM HEATING</title>
<link href="http://dspace.daffodilvarsity.edu.bd:8080/handle/20.500.11948/468" rel="alternate"/>
<author>
<name>Saha, Sumon</name>
</author>
<author>
<name>Saha, Goutam</name>
</author>
<author>
<name>Islam, Md. Quamrul</name>
</author>
<id>http://dspace.daffodilvarsity.edu.bd:8080/handle/20.500.11948/468</id>
<updated>2019-05-28T09:39:22Z</updated>
<published>2008-01-01T00:00:00Z</published>
<summary type="text">NATURAL CONVECTION IN SQUARE ENCLOSURE WITH  ADIABATIC CYLINDER AT CENTER AND DISCRETE               BOTTOM HEATING
Saha, Sumon; Saha, Goutam; Islam, Md. Quamrul
Natural convection in two-dimensional square enclosure containing adiabatic cylinder at the center has been studied numerically using finite element method. In the present study, top wall is considered adiabatic, two vertical walls are maintained at constant cold temperature, a constant heat flux is embedded at the bottom wall and the non-heated parts of the bottom wall are considered adiabatic. The aim of this work is to demonstrate the capabilities of this numerical methodology for handling such problems. The finite element formulations of the dimensionless governing equations with the associated boundary conditions are solved by a nonlinear coupled solution algorithm using three-nodded triangular element discretization scheme for all the field variables. The Grashof number is varied from 103 to 106 and Prandtl number is taken as 0.71. The effect of heat source length on the fluid flow and heat transfer process in the enclosure are analyzed. Results are presented in the form of streamline and isotherm plots.
</summary>
<dc:date>2008-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>ANALYSIS OF SHORTEST PATH PACKET TRACING OF                  ROUTERS</title>
<link href="http://dspace.daffodilvarsity.edu.bd:8080/handle/20.500.11948/467" rel="alternate"/>
<author>
<name>Haque, A.K.M Fazlul</name>
</author>
<author>
<name>Roksana, Mahdi</name>
</author>
<id>http://dspace.daffodilvarsity.edu.bd:8080/handle/20.500.11948/467</id>
<updated>2019-05-28T09:39:21Z</updated>
<published>2008-01-01T00:00:00Z</published>
<summary type="text">ANALYSIS OF SHORTEST PATH PACKET TRACING OF                  ROUTERS
Haque, A.K.M Fazlul; Roksana, Mahdi
In this paper, the shortest path in a packet switched network has been analyzed. A router receives a packet from a network and passes it to another network calculating the shortest path. However, the packets of a network use different routing protocols. A routing protocol is a combination of rules and procedures that lets routers informs each other of changes. It allows routers to share whatever they know about their neighborhood. Routing protocols are used to continuously update the routing tables that are consulted for forwarding and routing. The primary contribution of this paper is a simulation method of displaying the packet traces which finds the shortest path to route the packet through its destination. The simulation has been done by using Packet Tracer 4.01 software that allows us to stop time in our network and examine traffic in detail.
</summary>
<dc:date>2008-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>A FAST ADAPTIVE ECHO CANCELLATION TECHNIQUE WITH A LEAKY PROPORTIONATE NLMS ALGORITHM</title>
<link href="http://dspace.daffodilvarsity.edu.bd:8080/handle/20.500.11948/466" rel="alternate"/>
<author>
<name>Mitra, Abhijit</name>
</author>
<id>http://dspace.daffodilvarsity.edu.bd:8080/handle/20.500.11948/466</id>
<updated>2019-05-28T09:39:21Z</updated>
<published>2008-01-01T00:00:00Z</published>
<summary type="text">A FAST ADAPTIVE ECHO CANCELLATION TECHNIQUE WITH A LEAKY PROPORTIONATE NLMS ALGORITHM
Mitra, Abhijit
A modified version of proportionate&#13;
normalized least mean square (PNLMS) algorithm that&#13;
achieves faster convergence in time domain with a&#13;
marginal increment in implementation complexity&#13;
than the existing one is proposed. The proposed&#13;
algorithm, leaky PNLMS (LPNLMS), mainly differs&#13;
from PNLMS by virtue of a leaky factor which is&#13;
dependent on the algorithm step size parameter and&#13;
speeds up the convergence behaviour. We apply the&#13;
proposed algorithm in case of an adaptive echo&#13;
canceller. The performance of the proposed algorithm&#13;
is examined in the said application with respect to the&#13;
mean square error (MSE) and bit error rate (BER)&#13;
curves.
</summary>
<dc:date>2008-01-01T00:00:00Z</dc:date>
</entry>
</feed>
