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.

Rewriting Schemes for Flash Memory

Flash memory is a leading storage media with excellent features such as random access and high storage density. However, it also faces significant reliability and endurance challenges. In flash memory, the charge level in the cells can be easily increased, but removing charge requires an expensive erasure operation. In this thesis we study rewriting schemes that enable the data stored in a set of cells to be rewritten by only increasing the charge level in the cells. We consider two types of modulation scheme; a convectional modulation based on the absolute levels of the cells, and a recently-proposed scheme based on the relative cell levels, called rank modulation. The contributions of this thesis to the study of rewriting schemes for rank modulation include the following: we

•propose a new method of rewriting in rank modulation, beyond the previously proposed method of “push-to-the-top”;

•study the limits of rewriting with the newly proposed method, and derive a tight upper bound of 1 bit per cell;

•extend the rank-modulation scheme to support rankings with repetitions, in order to improve the storage density;

•derive a tight upper bound of 2 bits per cell for rewriting in rank modulation with repetitions;

•construct an efficient rewriting scheme that asymptotically approaches the upper bound of 2 bit per cell.

The next part of this thesis studies rewriting schemes for a conventional absolute-levels modulation. The considered model is called “write-once memory” (WOM). We focus on WOM schemes that achieve the capacity of the model. In recent years several capacity-achieving WOM schemes were proposed, based on polar codes and randomness extractors. The contributions of this thesis to the study of WOM scheme include the following: we

•propose a new capacity-achievingWOM scheme based on sparse-graph codes, and show its attractive properties for practical implementation;

•improve the design of polarWOMschemes to remove the reliance on shared randomness and include an error-correction capability.

The last part of the thesis studies the local rank-modulation (LRM) scheme, in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. The LRM scheme is used to simulate a single conventional multi-level flash cell. The simulated cell is realized by a Gray code traversing all the relative-value states where, physically, the transition between two adjacent states in the Gray code is achieved by using a single “push-to-the-top” operation. The main results of the last part of the thesis are two constructions of Gray codes with asymptotically-optimal rate.

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码与网格编码调制级联时的编码增益进行了仿真研究，证实了本方案的有效性．

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

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

Elasticidade-PIB do Imposto de Renda Pessoa Física e Jurídica

O objetivo específico da presente dissertação é estimar a elasticidade-PIB do Imposto de Renda Pessoa Física (IRPF) e Imposto Renda Pessoa Jurídica (IRPJ) no Brasil entre 1986 e 2012. A pesquisa também incorpora em seus objetivos uma análise técnica a respeito da tributação e seus impactos sobre o sistema econômico, tanto a nível microeconômico e macroeconômico, além de abordar o IRPF e IRPJ em seu aspecto econômico e jurídico. No tratamento metodológico são utilizados modelos de Vetor de Correção de erros (VEC) para estimar as elasticidades-PIB do IRPF e IRPJ. Os resultados apontam uma elasticidade-PIB, tanto para IRPF quanto IRPJ, acima da unidade, na maioria dos modelos estimados, e existem períodos determinados que impactam consideravelmente sobre à arrecadação desses tributos.

Estímulos fiscais e a interação entre as políticas monetária e fiscal no Brasil

Este trabalho estima, utilizando dados trimestrais de 1999 a 2011, o impacto dinâmico de um estímulo fiscal no Brasil sobre as principais variáveis macroeconômicas Brasileiras. Na estimativa dos impactos permitiu-se que as expectativas dos agentes econômicas fossem afetadas pela existência e probabilidade de alternância de regimes (foram detectados dois regimes) na política monetária do país. Os parâmetros da regra da política monetária, nos dois regimes detectados, foram estimados através de um modelo - composto apenas pela equação da regra da política monetária - que permite uma mudança de regime Markoviana. Os parâmetros do único regime encontrado para a política fiscal foram estimados por um modelo Vetorial de Correção de Erros (Vector Error Correction Model - VEC), composto apenas pelas variáveis pertencentes à regra da política fiscal. Os parâmetros estimados, para os diversos regimes das políticas monetária e fiscal, foram utilizados como auxiliares na calibragem de um modelo de equilíbrio geral estocástico dinâmico (MEGED), com mudanças de regime, com rigidez nominal de preços e concorrência monopolística (como em Davig e Leeper (2011)). Após a calibragem do MEGED os impactos dinâmicos de um estímulo fiscal foram obtidos através de uma rotina numérica (desenvolvida por Davig e Leeper (2006)) que permite obter o equilíbrio dinâmico do modelo resolvendo um sistema de equações de diferenças de primeira ordem expectacionais dinâmicas não lineares. Obtivemos que a política fiscal foi passiva durante todo o período analisado e que a política monetária foi sempre ativa, porém sendo em determinados momentos menos ativa. Em geral, em ambas as combinações de regimes, um choque não antecipado dos gastos do governo leva ao aumento do hiato do produto, aumento dos juros reais, redução do consumo privado e (em contradição com o resultado convencional) redução da taxa de inflação.

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.