Enabling Complexity-Performance Trade-Offs for Successive Cancellation Decoding of Polar Codes

Polar codes are one of the most recent advancements in coding theory and they have attracted significant interest. While they are provably capacity achieving over various channels, they have seen limited practical applications. Unfortunately, the successive nature of successive cancellation based decoders hinders fine-grained adaptation of the decoding complexity to design constraints and operating conditions. In this paper, we propose a systematic method for enabling complexity-performance trade-offs by constructing polar codes based on an optimization problem which minimizes the complexity under a suitably defined mutual information based performance constraint. Moreover, a low-complexity greedy algorithm is proposed in order to solve the optimization problem efficiently for very large code lengths.

Comparison of Parallelised R-matrix codes for electron impact excitation of Cr II

A comparison of collision strengths and effective collision strengths has been undertaken for the Cr II ion based on the model of Wasson et al [2010 A & A. 524 A35]. Calculations have been completed using the Breit-Pauli, RMATRX II and DARC suites of codes.

Minimal state-space realizations of 2D convolutional codes

In this thesis we consider two-dimensional (2D) convolutional codes. As happens in the one-dimensional (1D) case one of the major issues is obtaining minimal state-space realizations for these codes. It turns out that the problem of minimal realization of codes is not equivalent to the minimal realization of encoders. This is due to the fact that the same code may admit different encoders with different McMillan degrees. Here we focus on the study of minimality of the realizations of 2D convolutional codes by means of separable Roesser models. Such models can be regarded as a series connection between two 1D systems. As a first step we provide an algorithm to obtain a minimal realization of a 1D convolutional code starting from a minimal realization of an encoder of the code. Then, we restrict our study to two particular classes of 2D convolutional codes. The first class to be considered is the one of codes which admit encoders of type n 1. For these codes, minimal encoders (i.e., encoders for which a minimal realization is also minimal as a code realization) are characterized enabling the construction of minimal code realizations starting from such encoders. The second class of codes to be considered is the one constituted by what we have called composition codes. For a subclass of these codes, we propose a method to obtain minimal realizations by means of separable Roesser models.

Observed bodies generate object-based spatial codes

Contemporary studies of spatial and social cognition frequently use human figures as stimuli. The interpretation of such studies may be complicated by spatial compatibility effects that emerge when researchers employ spatial responses, and participants spontaneously code spatial relationships about an observed body. Yet, the nature of these spatial codes – whether they are location- or object-based, and coded from the perspective of the observer or the figure – has not been determined. Here, we investigated this issue by exploring spatial compatibility effects arising for objects held by a visually presented whole-bodied schematic human figure. In three experiments, participants responded to the colour of the object held in the figure’s left or right hand, using left or right key presses. Left-right compatibility effects were found relative to the participant’s egocentric perspective, rather than the figure’s. These effects occurred even when the figure was rotated by 90 degrees to the left or to the right, and the coloured objects were aligned with the participant’s midline. These findings are consistent with spontaneous spatial coding from the participant’s perspective and relative to the normal upright orientation of the body. This evidence for object-based spatial coding implies that the domain general cognitive mechanisms that result in spatial compatibility effects may contribute to certain spatial perspective-taking and social cognition phenomena.

Parallel decoding of turbo codes using multi-point trellis termination and collision-free interleavers

The UMTS turbo encoder is composed of parallel concatenation of two Recursive Systematic Convolutional (RSC) encoders which start and end at a known state. This trellis termination directly affects the performance of turbo codes. This paper presents performance analysis of multi-point trellis termination of turbo codes which is to terminate RSC encoders at more than one point of the current frame while keeping the interleaver length the same. For long interleaver lengths, this approach provides dividing a data frame into sub-frames which can be treated as independent blocks. A novel decoding architecture using multi-point trellis termination and collision-free interleavers is presented. Collision-free interleavers are used to solve memory collision problems encountered by parallel decoding of turbo codes. The proposed parallel decoding architecture reduces the decoding delay caused by the iterative nature and forward-backward metric computations of turbo decoding algorithms. Our simulations verified that this turbo encoding and decoding scheme shows Bit Error Rate (BER) performance very close to that of the UMTS turbo coding while providing almost %50 time saving for the 2-point termination and %80 time saving for the 5-point termination.

Increasing the speed of parallel decoding of turbo codes

Turbo codes experience a significant decoding delay because of the iterative nature of the decoding algorithms, the high number of metric computations and the complexity added by the (de)interleaver. The extrinsic information is exchanged sequentially between two Soft-Input Soft-Output (SISO) decoders. Instead of this sequential process, a received frame can be divided into smaller windows to be processed in parallel. In this paper, a novel parallel processing methodology is proposed based on the previous parallel decoding techniques. A novel Contention-Free (CF) interleaver is proposed as part of the decoding architecture which allows using extrinsic Log-Likelihood Ratios (LLRs) immediately as a-priori LLRs to start the second half of the iterative turbo decoding. The simulation case studies performed in this paper show that our parallel decoding method can provide %80 time saving compared to the standard decoding and %30 time saving compared to the previous parallel decoding methods at the expense of 0.3 dB Bit Error Rate (BER) performance degradation.

Desenvolvimento de uma linha de metropolitano ligeiro entre as linhas ferroviárias de Cascais e Sintra: "Metro de Oeiras"

Nos últimos anos tem-se constatado um agravamento da mobilidade em Agualva- Cacém e nas áreas envolventes ao eixo definido pela EN249-3. No desenvolvimento da linha de metro ligeiro considerou-se como objectivo prioritário a definição dum espaço canal e das respectivas infra-estrururas associadas, de forma a assegurar uma boa interligação das Linhas de Sintra e de Cascais e a conexão aos pólos tecnológicos TagusPark, Lagoas Park e Quinta da Fonte, abrangendo uma zona de influência significativa. A construção de “park & ride” junto às estações de metro ligeiro vai fomentar a transferência do transporte individual para o transporte colectivo contribuindo para a melhoria de qualidade de vida em zonas muito congestionadas e com elevados índices de poluição. Na elaboração do projecto foram superadas as dificuldades de inserção nas zonas com alta densidade e com orografia caracterizada por vales profundos. A linha tem uma extensão de 16,8 km em sítio próprio, com 23 estações e será explorada com 22 composições de 310 lugares, realizando o tempo de percurso de 25 minutos entre Oeiras e o Tagus Park ou entre Cacém e o Tagus Park. Para a concretização deste projecto foi estimado um investimento de 402 milhões de euros, incluindo a aquisição de material circulante em três fases. O custo da manutenção e exploração será de 12 milhões de euros/ano. A linha de metro ligeiro servirá cerca de 201 mil pessoas na sua área envolvente (a uma distância de 450m do eixo) e transportará 32 milhões de passageiros no Ano 0 e 54 milhões no Ano 30. O custo por passageiro transportado será de 0,74€ no Ano 0 e de 0,50€ no Ano 30.

Exploring the use of the Swiss medical tariffication codes (TARMED) in the establishment of the frequency of radiodiagnostic examinations.

In population surveys of the exposure to medical X-rays both the frequency of examinations and the effective dose per examination are required. The use of the Swiss medical tariffication system (TARMED) for establishing the frequency of X-ray medical examinations was explored. The method was tested for radiography examinations performed in 2008 at the Lausanne University Hospital. The annual numbers of radiographies determined from the "TARMED" database are in good agreement with the figures extracted from the local RIS (Radiology Information System). The "TARMED" is a reliable and fast method for establishing the frequency of radiography examination, if we respect the context in which the "TARMED" code is used. In addition, this billing context provides most valuable information on the average number of radiographs per examination as well as the age and sex distributions. Radiographies represent the major part of X-ray examinations and are performed by about 4,000 practices and hospitals in Switzerland. Therefore this method has the potential to drastically simplify the organisation of nationwide surveys. There are still some difficulties to overcome if the method is to be used to assess the frequency of computed tomography or fluoroscopy examinations; procedures that deliver most of the radiation dose to the population. This is due to the poor specificity of "TARMED" codes concerning these modalities. However, the use of CT and fluoroscopy installations is easier to monitor using conventional survey methods since there are fewer centres. Ways to overcome the "TARMED" limitations for these two modalities are still being explored.

Le supplément à tous les codes. Bulletin des lois usuelles, décrets, arrêtés, circulaires... ["puis" Revue sélectionnée, lois et décrets... ; Revue des lois et décrets]

1934/12 (A41,T19,N12).

Le supplément à tous les codes. Bulletin des lois usuelles, décrets, arrêtés, circulaires... ["puis" Revue sélectionnée, lois et décrets... ; Revue des lois et décrets]

1915/09 (T6,A27,N9)-1915/10 (T6,A27,N10).

Le supplément à tous les codes. Bulletin des lois usuelles, décrets, arrêtés, circulaires... ["puis" Revue sélectionnée, lois et décrets... ; Revue des lois et décrets]

1915/05 (T6,A27,N5).

Le supplément à tous les codes. Bulletin des lois usuelles, décrets, arrêtés, circulaires... ["puis" Revue sélectionnée, lois et décrets... ; Revue des lois et décrets]

1934/01 (A46,FASC1,N8962)-1934/02 (A46,FASC2,N8979).

Le supplément à tous les codes. Bulletin des lois usuelles, décrets, arrêtés, circulaires... ["puis" Revue sélectionnée, lois et décrets... ; Revue des lois et décrets]

1905/10 (A12,N10).

Le supplément à tous les codes. Bulletin des lois usuelles, décrets, arrêtés, circulaires... ["puis" Revue sélectionnée, lois et décrets... ; Revue des lois et décrets]

1931/09 (A43,FASC9,N8576)-1931/10 (A43,FASC10,N8598).