The long-run impact of Information and Communication Technology on economic output: The case of Australia

This paper investigates the cointegration and causal relationships between Information and Communication Technology (ICT) and economic output in Australia using data for about five decades. The framework used in this paper is the single-sector aggregate production function, which is the first comprehensive approach of this kind to include ICT and non-ICT capital and other factors to examine long-run Granger causality. The empirical evidence points to a cointegration relationship between ICT capital and output, and implies that ICT capital Granger causes economic output and multifactor productivity, as does non-ICT capital.

On the contribution of information and communication technology to productivity growth in Australia

This paper revisits the so-called ‘ICT-productivity paradox’ from a long-run perspective by using annual Australian data for 1965–2013. It provides estimates of long-run and short-run elasticities of labour productivity with respect to ICT capital deepening, and explores the nature of long-run causality among productivity growth and ICT and non-ICT capital deepening. The estimates of long-run elasticities are derived by employing both time-series and panel data econometric techniques. The empirical results provide strong confirmatory evidence of the long-run impact of ICT capital deepening on labour productivity in Australia.

A simple non-linear D/A converter

A simple generalized technique for realizing a non-linear digital to analogue converter (N-DAC), based on the principles of ' segment of equal digital interval ' is described. The simplicity of the proposed technique is demonstrated by realizing an N-DAC having a square law transfer function.

Ion-regulatory proreins in neuronal development and communication

Brain function is critically dependent on the ionic homeostasis in both the extra- and intracellular compartment. The regulation of brain extracellular ionic composition mainly relies on active transport at blood brain and at blood cerebrospinal fluid interfaces whereas intracellular ion regulation is based on plasmalemmal transporters of neurons and glia. In addition, the latter mechanisms can generate physiologically as well as pathophysiologically significant extracellular ion transients. In this work I have studied molecular mechanisms and development of ion regulation and how these factors alter neuronal excitability and affect synaptic and non-synaptic transmission with a particular emphasis on intracellular pH and chloride (Cl-) regulation. Why is the regulation of acid-base equivalents (H+ and HCO3-) and Cl- of such interest and importance? First of all, GABAA-receptors are permeable to both HCO3- and Cl-. In the adult mammalian central nervous system (CNS) fast postsynaptic inhibition relies on GABAA-receptor mediated transmission. Today, excitatory effects of GABAA-receptors, both in mature neurons and during the early development, have been recognized and the significance of the dual actions of GABA on neuronal communication has become an interesting field of research. The transmembrane gradients of Cl- and HCO3- determine the reversal potential of GABAA-receptor mediated postsynaptic potentials and hence, the function of pH and Cl- regulatory proteins have profound consequences on GABAergic signaling and neuronal excitability. Secondly, perturbations in pH can cause a variety of changes in cellular function, many of them resulting from the interaction of protons with ionizable side chains of proteins. pH-mediated alterations of protein conformation in e.g. ion channels, transporters, and enzymes can powerfully modulate neurotransmission. In the context of pH homeostasis, the enzyme carbonic anhydrase (CA) needs to be taken into account in parallel with ion transporters: for CO2/HCO3- buffering to act in a fast manner, CO2 (de)hydration must be catalyzed by this enzyme. The acid-base equivalents that serve as substrates in the CO2 dehydration-hydration reaction are also engaged in many carrier and channel mediated ion movements. In such processes, CA activity is in key position to modulate transmembrane solute fluxes and their consequences. The bicarbonate transporters (BTs; SLC4) and the electroneutral cation-chloride cotransporters (CCCs; SLC12) belong the to large gene family of solute carriers (SLCs). In my work I have studied the physiological roles of the K+-Cl- cotransporter KCC2 (Slc12a5) and the Na+-driven Cl--HCO3- exchanger NCBE (Slc4a10) and the roles of these two ion transporters in the modualtion of neuronal communication and excitability in the rodent hippocampus. I have also examined the cellular localization and molecular basis of intracellular CA that has been shown to be essential for the generation of prolonged GABAergic excitation in the mature hippocampus. The results in my Thesis provide direct evidence for the view that the postnatal up-regulation of KCC2 accounts for the developmental shift from depolarizing to hyperpolarizing postsynaptic EGABA-A responses in rat hippocampal pyramidal neurons. The results also indicate that after KCC2 expression the developmental onset of excitatory GABAergic transmission upon intense GABAA-receptor stimulation depend on the expression of intrapyramidal CA, identified as the CA isoform VII. Studies on mice with targeted Slc4a10 gene disruption revealed an important role for NCBE in neuronal pH regulation and in pH-dependent modulation of neuronal excitability. Furthermore, this ion transporter is involved in the basolateral Na+ and HCO3- uptake in choroid plexus epithelial cells, and is thus likely to contribute to cerebrospinal fluid production.

Non-linear Transceiver Designs with Imperfect CSIT Using Convex Optimization

In this paper, we consider non-linear transceiver designs for multiuser multi-input multi-output (MIMO) down-link in the presence of imperfections in the channel state information at the transmitter (CSIT). The base station (BS) is equipped with multiple transmit antennas and each user terminal is equipped with multiple receive antennas. The BS employs Tomlinson-Harashima precoding (THP) for inter-user interference pre-cancellation at the transmitter. We investigate robust THP transceiver designs based on the minimization of BS transmit power with mean square error (MSE) constraints, and balancing of MSE among users with a constraint on the total BS transmit power. We show that these design problems can be solved by iterative algorithms, wherein each iteration involves a pair of convex optimization problems. The robustness of the proposed algorithms to imperfections in CSIT is illustrated through simulations.

A non-orthogonal cooperative multiple access (NCMA) protocol and low ML decoding complexity codes

A half-duplex constrained non-orthogonal cooperative multiple access (NCMA) protocol suitable for transmission of information from N users to a single destination in a wireless fading channel is proposed. Transmission in this protocol comprises of a broadcast phase and a cooperation phase. In the broadcast phase, each user takes turn broadcasting its data to all other users and the destination in an orthogonal fashion in time. In the cooperation phase, each user transmits a linear function of what it received from all other users as well as its own data. In contrast to the orthogonal extension of cooperative relay protocols to the cooperative multiple access channels wherein at any point of time, only one user is considered as a source and all the other users behave as relays and do not transmit their own data, the NCMA protocol relaxes the orthogonality built into the protocols and hence allows for a more spectrally efficient usage of resources. Code design criteria for achieving full diversity of N in the NCMA protocol is derived using pair wise error probability (PEP) analysis and it is shown that this can be achieved with a minimum total time duration of 2N - 1 channel uses. Explicit construction of full diversity codes is then provided for arbitrary number of users. Since the Maximum Likelihood decoding complexity grows exponentially with the number of users, the notion of g-group decodable codes is introduced for our setup and a set of necesary and sufficient conditions is also obtained.

Low-delay, high-rate, non-square STBCs from scaled complex orthogonal designs

Space-time block codes (STBCs) obtained from non-square complex orthogonal designs are bandwidth efficient compared to those from square real/complex orthogonal designs for colocated coherent MIMO systems and has other applications in (i) non-coherent MIMO systems with non-differential detection, (ii) Space-Time-Frequency codes for MIMO-OFDM systems and (iii) distributed space-time coding for relay channels. Liang (IEEE Trans. Inform. Theory, 2003) has constructed maximal rate non-square designs for any number of antennas, with rates given by [(a+1)/(2a)] when number of transmit antennas is 2a-1 or 2a. However, these designs have large delays. When large number of antennas are considered this rate is close to 1/2. Tarokh et al (IEEE Trans. Inform. Theory, 1999) have constructed rate 1/2 non-square CODs using the rate-1 real orthogonal designs for any number of antennas, where the decoding delay of these codes is less compared to the codes constructed by Liang for number of transmit antennas more than 5. In this paper, we construct a class of rate-1/2 codes for arbitrary number of antennas where the decoding delay is reduced by 50% when compared with the rate-1/2 codes given by Tarokh et al. It is also shown that even though scaling the variables helps to lower the delay it can not be used to increase the rate.

On the maximal rate of non-square STBCs from complex orthogonal designs

A Linear Processing Complex Orthogonal Design (LPCOD) is a p x n matrix epsilon, (p >= n) in k complex indeterminates x(1), x(2),..., x(k) such that (i) the entries of epsilon are complex linear combinations of 0, +/- x(i), i = 1,..., k and their conjugates, (ii) epsilon(H)epsilon = D, where epsilon(H) is the Hermitian (conjugate transpose) of epsilon and D is a diagonal matrix with the (i, i)-th diagonal element of the form l(1)((i))vertical bar x(1)vertical bar(2) + l(2)((i))vertical bar x(2)vertical bar(2)+...+ l(k)((i))vertical bar x(k)vertical bar(2) where l(j)((i)), i = 1, 2,..., n, j = 1, 2,...,k are strictly positive real numbers and the condition l(1)((i)) = l(2)((i)) = ... = l(k)((i)), called the equal-weights condition, holds for all values of i. For square designs it is known. that whenever a LPCOD exists without the equal-weights condition satisfied then there exists another LPCOD with identical parameters with l(1)((i)) = l(2)((i)) = ... = l(k)((i)) = 1. This implies that the maximum possible rate for square LPCODs without the equal-weights condition is the same as that or square LPCODs with equal-weights condition. In this paper, this result is extended to a subclass of non-square LPCODs. It is shown that, a set of sufficient conditions is identified such that whenever a non-square (p > n) LPCOD satisfies these sufficient conditions and do not satisfy the equal-weights condition, then there exists another LPCOD with the same parameters n, k and p in the same complex indeterminates with l(1)((i)) = l(2)((i)) = ... = l(k)((i)) = 1.

Stability of scheduled multi-access communication over quasi-static flat fading channels with random coding and independent decoding

The stability of scheduled multiaccess communication with random coding and independent decoding of messages is investigated. The number of messages that may be scheduled for simultaneous transmission is limited to a given maximum value, and the channels from transmitters to receiver are quasistatic, flat, and have independent fades. Requests for message transmissions are assumed to arrive according to an i.i.d. arrival process. Then, we show the following: (1) in the limit of large message alphabet size, the stability region has an interference limited information-theoretic capacity interpretation, (2) state-independent scheduling policies achieve this asymptotic stability region, and (3) in the asymptotic limit corresponding to immediate access, the stability region for non-idling scheduling policies is shown to be identical irrespective of received signal powers.

Natural modes of a coupled non-linear system

The natural modes of a non-linear system with two degrees of freedom are investigated. The system, which may contain either hard or soft springs, is shown to possess three modes of vibration one of which does not have any counterpart in the linear theory. The stability analysis indicates the existence of seven different modal stability patterns depending on the values of two parameters of non-linearity.

Estimation of signals in colored non gaussian noise based on Gaussian Mixture models

Non-Gaussianity of signals/noise often results in significant performance degradation for systems, which are designed using the Gaussian assumption. So non-Gaussian signals/noise require a different modelling and processing approach. In this paper, we discuss a new Bayesian estimation technique for non-Gaussian signals corrupted by colored non Gaussian noise. The method is based on using zero mean finite Gaussian Mixture Models (GMMs) for signal and noise. The estimation is done using an adaptive non-causal nonlinear filtering technique. The method involves deriving an estimator in terms of the GMM parameters, which are in turn estimated using the EM algorithm. The proposed filter is of finite length and offers computational feasibility. The simulations show that the proposed method gives a significant improvement compared to the linear filter for a wide variety of noise conditions, including impulsive noise. We also claim that the estimation of signal using the correlation with past and future samples leads to reduced mean squared error as compared to signal estimation based on past samples only.

A non-orthogonal distributed space-time coded protocol - Part 1:Signal model and design criteria

In this two-part series of papers, a generalized non-orthogonal amplify and forward (GNAF) protocol which generalizes several known cooperative diversity protocols is proposed. Transmission in the GNAF protocol comprises of two phases - the broadcast phase and the cooperation phase. In the broadcast phase, the source broadcasts its information to the relays as well as the destination. In the cooperation phase, the source and the relays together transmit a space-time code in a distributed fashion. The GNAF protocol relaxes the constraints imposed by the protocol of Jing and Hassibi on the code structure. In Part-I of this paper, a code design criteria is obtained and it is shown that the GNAF protocol is delay efficient and coding gain efficient as well. Moreover GNAF protocol enables the use of sphere decoders at the destination with a non-exponential Maximum likelihood (ML) decoding complexity. In Part-II, several low decoding complexity code constructions are studied and a lower bound on the Diversity-Multiplexing Gain tradeoff of the GNAF protocol is obtained.

Dynamic programming based optimum non-uniform samples for speech reconstruction and coding

Non-uniform sampling of a signal is formulated as an optimization problem which minimizes the reconstruction signal error. Dynamic programming (DP) has been used to solve this problem efficiently for a finite duration signal. Further, the optimum samples are quantized to realize a speech coder. The quantizer and the DP based optimum search for non-uniform samples (DP-NUS) can be combined in a closed-loop manner, which provides distinct advantage over the open-loop formulation. The DP-NUS formulation provides a useful control over the trade-off between bitrate and performance (reconstruction error). It is shown that 5-10 dB SNR improvement is possible using DP-NUS compared to extrema sampling approach. In addition, the close-loop DP-NUS gives a 4-5 dB improvement in reconstruction error.

Non-unitary-weight Space-Time Block Codes with Minimum Decoding Complexity

Space-Time Block Codes (STBCs) from Complex Orthogonal Designs (CODs) are single-symbol decodable/symbol-by-symbol decodable (SSD); however, SSD codes are obtainable from designs that are not CODs. Recently, two such classes of SSD codes have been studied: (i) Coordinate Interleaved Orthogonal Designs (CIODs) and (ii) Minimum-Decoding-Complexity (MDC) STBCs from Quasi-ODs (QODs). The class of CIODs have non-unitary weight matrices when written as a Linear Dispersion Code (LDC) proposed by Hassibi and Hochwald, whereas the other class of SSD codes including CODs have unitary weight matrices. In this paper, we construct a large class of SSD codes with nonunitary weight matrices. Also, we show that the class of CIODs is a special class of our construction.