@article {109,
	title = {A layered MIMO OFDM system with channel equalization},
	journal = {Journal of Digital Information Management},
	volume = {5},
	year = {2007},
	note = {Cited By (since 1996):1Export Date: 10 July 2014},
	month = {2007},
	pages = {361 - 363},
	abstract = {This paper proposes a simple and efficient method for layered MIMO-OFDM system with channel equalization. Temporal variations in the channel are due to Doppler spread, a sign of relative motion between transmitter and receiver. Results are simulated in both Rayleigh channel and additive white Gaussian noise (AWGN) channel. Decision feedback equalizer (DFE) with recursive least square (RLS) algonthm is used for channel equalization. Different type of Layered structure is applied to MIMO-OFDM system and their performance is evaluated. Different modulations schemes are used with same number of transmit and receive antennas. Simulation results are shown for both vertical and horizontal coded layered structure MIMO-OFDM systems with different modulation schemes and different number of transmit antennas.},
	keywords = {Graphsdecomposition algorithm, VDM, Vienna development method},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-49149122041\&partnerID=40\&md5=36ef5a9a09db5af4163b13d382aab433},
	author = {Noori, K. and Haider, S.A.}
}
@article {106,
	title = {VDM specification of an algorithm for graph decomposition},
	journal = {Journal of Digital Information Management},
	volume = {5},
	year = {2007},
	note = {Export Date: 10 July 2014},
	month = {2007},
	pages = {347 - 353},
	abstract = {Complex software systems need a precise specification of their intended behaviour. While graph theory plays an important role in several aspects of building such software systems, formal methods provide a rigorous mathematical framework within which a system can be described. In this paper, an algorithm for decomposing a graph into disjoint paths is presented. Such decompositions are useful, particularly in implementing software testing. VDM representation of the proposed algorithm facilitates automation of testing process without any ambiguity.},
	keywords = {Graphs decomposition algorithm, VDM, Vienna development method},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-49149094335\&partnerID=40\&md5=1cb50e54c6cd978239ea452ebecd006a},
	author = {Huq, A. and Ramachandran, N.T.}
}
