Relay Precoder Optimization in MIMO-Relay Networks With Imperfect CSI

In this paper, we consider robust joint designs of relay precoder and destination receive filters in a nonregenerative multiple-input multiple-output (MIMO) relay network. The network consists of multiple source-destination node pairs assisted by a MIMO-relay node. The channel state information (CSI) available at the relay node is assumed to be imperfect. We consider robust designs for two models of CSI error. The first model is a stochastic error (SE) model, where the probability distribution of the CSI error is Gaussian. This model is applicable when the imperfect CSI is mainly due to errors in channel estimation. For this model, we propose robust minimum sum mean square error (SMSE), MSE-balancing, and relay transmit power minimizing precoder designs. The next model for the CSI error is a norm-bounded error (NBE) model, where the CSI error can be specified by an uncertainty set. This model is applicable when the CSI error is dominated by quantization errors. In this case, we adopt a worst-case design approach. For this model, we propose a robust precoder design that minimizes total relay transmit power under constraints on MSEs at the destination nodes. We show that the proposed robust design problems can be reformulated as convex optimization problems that can be solved efficiently using interior-point methods. We demonstrate the robust performance of the proposed design through simulations.

An adaptive reliable transport protocol based on automatic reSend reQuest(ASQ) technique for wireless sensor networks

There are many wireless sensor network(WSN) applications which require reliable data transfer between the nodes. Several techniques including link level retransmission, error correction methods and hybrid Automatic Repeat re- Quest(ARQ) were introduced into the wireless sensor networks for ensuring reliability. In this paper, we use Automatic reSend request(ASQ) technique with regular acknowledgement to design reliable end-to-end communication protocol, called Adaptive Reliable Transport(ARTP) protocol, for WSNs. Besides ensuring reliability, objective of ARTP protocol is to ensure message stream FIFO at the receiver side instead of the byte stream FIFO used in TCP/IP protocol suite. To realize this objective, a new protocol stack has been used in the ARTP protocol. The ARTP protocol saves energy without affecting the throughput by sending three different types of acknowledgements, viz. ACK, NACK and FNACK with semantics different from that existing in the literature currently and adapting to the network conditions. Additionally, the protocol controls flow based on the receiver's feedback and congestion by holding ACK messages. To the best of our knowledge, there has been little or no attempt to build a receiver controlled regularly acknowledged reliable communication protocol. We have carried out extensive simulation studies of our protocol using Castalia simulator, and the study shows that our protocol performs better than related protocols in wireless/wire line networks, in terms of throughput and energy efficiency.

Performance improvement of short-length regular low-density parity-check codes with low-complexity post-processing

It is well known that extremely long low-density parity-check (LDPC) codes perform exceptionally well for error correction applications, short-length codes are preferable in practical applications. However, short-length LDPC codes suffer from performance degradation owing to graph-based impairments such as short cycles, trapping sets and stopping sets and so on in the bipartite graph of the LDPC matrix. In particular, performance degradation at moderate to high E-b/N-0 is caused by the oscillations in bit node a posteriori probabilities induced by short cycles and trapping sets in bipartite graphs. In this study, a computationally efficient algorithm is proposed to improve the performance of short-length LDPC codes at moderate to high E-b/N-0. This algorithm makes use of the information generated by the belief propagation (BP) algorithm in previous iterations before a decoding failure occurs. Using this information, a reliability-based estimation is performed on each bit node to supplement the BP algorithm. The proposed algorithm gives an appreciable coding gain as compared with BP decoding for LDPC codes of a code rate equal to or less than 1/2 rate coding. The coding gains are modest to significant in the case of optimised (for bipartite graph conditioning) regular LDPC codes, whereas the coding gains are huge in the case of unoptimised codes. Hence, this algorithm is useful for relaxing some stringent constraints on the graphical structure of the LDPC code and for developing hardware-friendly designs.

Construction of Singer Subgroup Orbit Codes Based on Cyclic Difference Sets

A recent approach for the construction of constant dimension subspace codes, designed for error correction in random networks, is to consider the codes as orbits of suitable subgroups of the general linear group. In particular, a cyclic orbit code is the orbit of a cyclic subgroup. Hence a possible method to construct large cyclic orbit codes with a given minimum subspace distance is to select a subspace such that the orbit of the Singer subgroup satisfies the distance constraint. In this paper we propose a method where some basic properties of difference sets are employed to select such a subspace, thereby providing a systematic way of constructing cyclic orbit codes with specified parameters. We also present an explicit example of such a construction.

On the Bounds of Certain Maximal Linear Codes in a Projective Space

The set of all subspaces of F-q(n) is denoted by P-q(n). The subspace distance d(S)(X, Y) = dim(X) + dim(Y)-2dim(X boolean AND Y) defined on P-q(n) turns it into a natural coding space for error correction in random network coding. A subset of P-q(n) is called a code and the subspaces that belong to the code are called codewords. Motivated by classical coding theory, a linear coding structure can be imposed on a subset of P-q(n). Braun et al. conjectured that the largest cardinality of a linear code, that contains F-q(n), is 2(n). In this paper, we prove this conjecture and characterize the maximal linear codes that contain F-q(n).

Ikasleen hizkuntza erroreak eta hutsegiteak : zuzentzeko proposamena

[Es]El presente trabajo se basa en las consultas que los profesores y profesoras de distintas asignaturas nos hacen al profesorado de lengua. Muchas veces los profesores debemos corregir no sólo el contenido de los trabajos de nuestros alumnos, sino también la lengua. La discusión no es nueva: ¿somos todos los profesores también profesores de lengua? Es un desafío del que difícilmente podemos escapar, ya que la lengua además de ser una materia de estudio también es el vehículo en el que se imparten los contenidos de todas las asignaturas. Con el presente trabajo pretendemos ayudar a los profesores que no imparten lengua como asignatura a corregir los trabajos de sus alumnos. Esta propuesta consta de tres ejes de actuación marcados por un orden de prioridad: prevenir, autocorregir y ayudar.

Solutions for New Terrestrial Broadcasting Systems Offering Simultaneously Stationary and Mobile Services

221 p.

基于RS编码及网格编码调制的光PPM通信纠错技术

分析了RS（Reed-Solomon）纠错码和网格编码调制（Trellis Coded Modulation，TCM）技术在光脉冲位置调制通信中的应用．在此基础上，提出了以RS码作为外码，以网格编码调制技术作为内码，用于光脉冲位置调制通信的新编码方案，能以几乎不减少通信速率的优势，提高传统RS码系统在时变带限光信道中的通信性能．模拟研究了在不同空间光信道条件下，传统RS码的符号正确传输率和误码率，并对网格编码调制的编码增益、RS码与网格编码调制级联时的编码增益进行了仿真研究，证实了本方案的有效性．

光栅位移测量系统的误差自修正方法研究

文中介绍的误差自修正方法是通过光栅位移测量系统中单片机对光栅传感器的多个零位信号进行计数,并根据测量值和系统设定值得到的误差函数自动进行误差修正。实验结果表明,该方法对光栅位移测量系统的误差既可自动进行有效的修正,又可提高系统的测量精度。

A meta-analytic approach to quantifying scientific uncertainty in stock assessments

Quantifying scientific uncertainty when setting total allowable catch limits for fish stocks is a major challenge, but it is a requirement in the United States since changes to national fisheries legislation. Multiple sources of error are readily identifiable, including estimation error, model specification error, forecast error, and errors associated with the definition and estimation of reference points. Our focus here, however, is to quantify the influence of estimation error and model specification error on assessment outcomes. These are fundamental sources of uncertainty in developing scientific advice concerning appropriate catch levels and although a study of these two factors may not be inclusive, it is feasible with available information. For data-rich stock assessments conducted on the U.S. west coast we report approximate coefficients of variation in terminal biomass estimates from assessments based on inversion of the assessment of the model’s Hessian matrix (i.e., the asymptotic standard error). To summarize variation “among” stock assessments, as a proxy for model specification error, we characterize variation among multiple historical assessments of the same stock. Results indicate that for 17 groundfish and coastal pelagic species, the mean coefficient of variation of terminal biomass is 18%. In contrast, the coefficient of variation ascribable to model specification error (i.e., pooled among-assessment variation) is 37%. We show that if a precautionary probability of overfishing equal to 0.40 is adopted by managers, and only model specification error is considered, a 9% reduction in the overfishing catch level is indicated.

Comparisons between gigabit NRZ, CAP and optical OFDM systems over FEC enhanced POF links using LEDs

Simulations have been performed to compare the link power budget and power dissipation of carrierless amplitude and phase modulation-64 (CAP-64) and 64-quadrature amplitude modulation-orthogonal frequency division multiplexing (64-QAM-OFDM) systems over feedforward error correction (FEC) enhanced plastic optical fibre (POF) links using light emitting diodes (LEDs). It is shown that CAP-64 outperforms 64-QAM-OFDM and supports record high 2.1Gb/s over 50m POF transmission. The CAP-64 and 64-QAM-OFDM links consume similar powers which are 2 (2.5) times of that of NRZ for the single POF link (twin POF links) case. © 2012 IEEE.

FEC-free 50 m 1.5 Gb/s plastic optical fibre link using CAP modulation for home networks

LED-based carrierless amplitude and phase modulation is investigated for a multi-gigabit plastic optical fibre link. An FPGA-based 1.5 Gbit/s error free transmission over 50 m standard SI-POF using CAP64 is achieved, providing 2.9 dB power margin without forward error correction. © 2012 OSA.

Mode division multiplexing exploring hollow-core photonic bandgap fibers

We review our recent exploratory investigations on mode division multiplexing using hollow-core photonic bandgap fibers (HC-PBGFs). Compared with traditional multimode fibers, HC-PBGFs have several attractive features such as ultra-low nonlinearities, low-loss transmission window around 2 μm etc. After having discussed the potential and challenges of using HC-PBGFs as transmission fibers for mode multiplexing applications, we will report a number of recent proof-of-concept results obtained in our group using direct detection receivers. The first one is the transmission of two 10.7 Gbit/s non-return to zero (NRZ) data signals over a 30 m 7-cell HC-PBGF using the offset mode launching method. In another experiment, a short piece of 19-cell HC-PBGF was used to transmit two 20 Gbit/s NRZ channels using a spatial light modulator for precise mode excitation. Bit-error-ratio (BER) performances below the forward-error-correction (FEC) threshold limit (3.3×10-3) are confirmed for both data channels when they propagate simultaneously. © 2013 IEEE.

FEC-free 50 m 1.5 Gb/s plastic optical fibre link using CAP modulation for home networks

LED-based carrierless amplitude and phase modulation is investigated for a multi-gigabit plastic optical fibre link. An FPGA-based 1.5 Gbit/s error free transmission over 50 m standard SI-POF using CAP64 is achieved, providing 2.9 dB power margin without forward error correction. © 2012 Optical Society of America.

A differential recursive scheme for suppression of Peak to average power ratio for OFDM

A differential recursive scheme for suppression of Peak to average power ratio (PAPR) for Orthogonal frequency division multiplexing (OFDM) signal is proposed in this thesis. The pseudo-randomized modulating vector for the subcarrier series is differentially phase-encoded between successive components in frequency domain first, and recursion manipulates several samples of Inverse fast Fourier transformation (IFFT) output in time domain. Theoretical analysis and experimental result exhibit advantage of differential recursive scheme over direct output scheme in PAPR suppression. And the overall block diagram of the scheme is also given.