Browsing by Author "Batovski, Dobri Atanassov"
Results Per Page
Sort Options

ItemConvergence acceleration of turbo decoding iterations with the Epsilon algorithm(Assumption University Press, 2009) Lwin, Nay Myo ; Batovski, Dobri Atanassov ; Assumption University. Vincent Mary School of Science and TechnologyThe series of soft values of consecutive iterations of turbo decoding are used for convergence acceleration with the Epsilon algorithm. It is shown that a certain improvement of the bit error rate (BER) can be obtained compared to the standard turbo decoding. Turbo codes for third generation communication systems are used for the computational experiments. BER results in case of correlated fading are presented as an illustration of the performance of the convergence acceleration approach.

Item

Item

Item

ItemDecoding acceleration of lowdensity paritycheck codes for mobile wirelessMAN(Assumption University Press, 2010) Watanyu Isarankura ; Batovski, Dobri Atanassov ; Assumption University. Vincent Mary School of Science and TechnologyThe lowdensity paritycheck (LDPC) codes have a relatively simple algorithm for error correction. The best performance of such codes is demonstrated for large frame sizes and a substantial number of iterations. The decoding delay depends on the number of iterations being performed with the received noisy data in order to obtain the best estimate to the transmitted data. A modification of the standard LDPC decoding algorithm is proposed, which is based on a statistical comparison of true and False convergence of an attempted decoding acceleration with the use of the Epsilon algorithm for convergence acceleration of the series of decoding iterations for the individual bits in each transmitted frame. Using the LDPC codec for Mobile WirelessMAN as an illustration, it is shown that the True convergence dominates over the False convergence which follows to a better bit error rate (BER) performance as compared to the standard (plain) scheme for a given number of iterations.

ItemEightchannel transmultiplexer with binary matrix sequences(Assumption University Press, 2010) Hossain, Syed Nabi ; Batovski, Dobri Atanassov ; Cooklev, Todor V ; Assumption University. Vincent Mary School of Science and TechnologyThe duals of finite impulse response filters constructed of binary matrix sequences are used to design an eightchannel transmultiplexer. The binary matrix sequences of analysis and synthesis filters are obtained from corresponding complementary sequences which satisfy the conditions for perfect reconstruction. The distorions of eight transmultiplexed images in the presence of channel noise are studied for the case of a simulated transmission over a Digital Video BroadcastingSatelliteSecond Generation (DVBS2) system.

Item

ItemGraphene and communications technology(Assumption University, 2012) Batovski, Dobri Atanassov ; Assumption University. Vincent Mary School of Science and Technology

Item

ItemLocal routing in multihop networks(Assumption University, 2009) Batovski, Dobri Atanassov ; Assumption University. Vincent Mary School of Science and Technology

Item

Item

Item

Item

Item

Item

ItemTopology control for long distance transmission in multihop ad hoc networks(Assumption University Press, 2010) Kitikun Poolsub ; Benjaporn Lapwila ; Batovski, Dobri Atanassov ; Assumption University. Vincent Mary School of Science and TechnologyThis contribution is concerned with the performance evaluation of topology control algorithms for indoor ad hoc networks in multistorey buildings. Several proposed topology control algorithms based on discrete sets are compared. The topology control algorithms operate with wireless links having variable transmission rates according to existing wireless communication standards. The maximum number of routing steps is limited to 15 hops. Computational experiments with a queuing analyzer for open networks are performed to extimate the connectivity between distant nodes in the network located at different vertical levels. The tradeoff between connectivity and delaythroughput is studied assuming that the algorithms are constrained to the selection of only five links by each node.