New space-time trellis codes for two-antenna quasi-static channels

New space-time trellis codes with four- and eight-level phase-shift keying (PSK) and 16-phase quadrature amplitude modulation (QAM) for two transmit antennas in slow-fading channels are presented in this paper. Unlike most of the codes that are reported in the literature, the proposed codes are specifically designed to minimize the frame error probability from a union-bound perspective. The performance of the proposed codes with various memory orders and receive antennas is evaluated by simulation. It is shown that the proposed codes outperform previously known codes in all studied cases.

On the use of predictor-corrector method for coupled Monte Carlo burnup codes

This paper investigates the effect of the burnup coupling scheme on the numerical stability and accuracy of coupled Monte-Carlo depletion calculations. We show that in some cases, even the Predictor Corrector method with relatively short time steps can be numerically unstable. In addition, we present two possible extensions to the Euler predictor-corrector (PC) method, which is typically used in coupled burnup calculations. These modifications allow using longer time steps, while maintaining numerical stability and accuracy. © 2013 Elsevier Ltd. All rights reserved.

Modeling of SFR cores with Serpent-DYN3D codes sequence

DYN3D reactor dynamics nodal diffusion code was originally developed for the analysis of Light Water Reactors. In this paper, we demonstrate the feasibility of using DYN3D for modeling of fast spectrum reactors. A homogenized cross sections data library was generated using continuous energy Monte-Carlo code Serpent which provides significant modeling flexibility compared with traditional deterministic lattice transport codes and tolerable execution time. A representative sodium cooled fast reactor core was modeled with the Serpent-DYN3D code sequence and the results were compared with those produced by ERANOS code and with a 3D full core Monte-Carlo solution. Very good agreement between the codes was observed for the core integral parameters and power distribution suggesting that the DYN3D code with cross section library generated using Serpent can be reliably used for the analysis of fast reactors. © 2012 Elsevier Ltd. All rights reserved.

Comparison among MCNP-based depletion codes applied to burnup calculations of pebble-bed HTR lattices

The double-heterogeneity characterising pebble-bed high temperature reactors (HTRs) makes Monte Carlo based calculation tools the most suitable for detailed core analyses. These codes can be successfully used to predict the isotopic evolution during irradiation of the fuel of this kind of cores. At the moment, there are many computational systems based on MCNP that are available for performing depletion calculation. All these systems use MCNP to supply problem dependent fluxes and/or microscopic cross sections to the depletion module. This latter then calculates the isotopic evolution of the fuel resolving Bateman's equations. In this paper, a comparative analysis of three different MCNP-based depletion codes is performed: Montburns2.0, MCNPX2.6.0 and BGCore. Monteburns code can be considered as the reference code for HTR calculations, since it has been already verified during HTR-N and HTR-N1 EU project. All calculations have been performed on a reference model representing an infinite lattice of thorium-plutonium fuelled pebbles. The evolution of k-inf as a function of burnup has been compared, as well as the inventory of the important actinides. The k-inf comparison among the codes shows a good agreement during the entire burnup history with the maximum difference lower than 1%. The actinide inventory prediction agrees well. However significant discrepancy in Am and Cm concentrations calculated by MCNPX as compared to those of Monteburns and BGCore has been observed. This is mainly due to different Am-241 (n,γ) branching ratio utilized by the codes. The important advantage of BGCore is its significantly lower execution time required to perform considered depletion calculations. While providing reasonably accurate results BGCore runs depletion problem about two times faster than Monteburns and two to five times faster than MCNPX. © 2009 Elsevier B.V. All rights reserved.

Superposition codes for mismatched decoding

An achievable rate is given for discrete memoryless channels with a given (possibly suboptimal) decoding rule. The result is obtained using a refinement of the superposition coding ensemble. The rate is tight with respect to the ensemble average, and can be weakened to the LM rate of Hui and Csiszár-Körner, and to Lapidoth's rate based on parallel codebooks. © 2013 IEEE.

Second-order rate region of constant-composition codes for the multiple-access channel

This paper presents an achievable second-order rate region for the discrete memoryless multiple-access channel. The result is obtained using a random-coding ensemble in which each user's codebook contains codewords of a fixed composition. It is shown that this ensemble performs at least as well as i.i.d. random coding in terms of second-order asymptotics, and an example is given where a strict improvement is observed. © 2013 IEEE.

Monitoring and preventing numerical oscillations in 3D simulations with coupled Monte Carlo codes

Previous studies have reported that different schemes for coupling Monte Carlo (MC) neutron transport with burnup and thermal hydraulic feedbacks may potentially be numerically unstable. This issue can be resolved by application of implicit methods, such as the stochastic implicit mid-point (SIMP) methods. In order to assure numerical stability, the new methods do require additional computational effort. The instability issue however, is problem-dependent and does not necessarily occur in all cases. Therefore, blind application of the unconditionally stable coupling schemes, and thus incurring extra computational costs, may not always be necessary. In this paper, we attempt to develop an intelligent diagnostic mechanism, which will monitor numerical stability of the calculations and, if necessary, switch from simple and fast coupling scheme to more computationally expensive but unconditionally stable one. To illustrate this diagnostic mechanism, we performed a coupled burnup and TH analysis of a single BWR fuel assembly. The results indicate that the developed algorithm can be easily implemented in any MC based code for monitoring of numerical instabilities. The proposed monitoring method has negligible impact on the calculation time even for realistic 3D multi-region full core calculations. © 2014 Elsevier Ltd. All rights reserved.

Information sets and partial permutation decoding for codes from finite geometries

Mavron, Vassili; McDonough, T.P.; Key, J.D., (2006) 'Information sets and partial permutation decoding for codes from finite geometries', Finite Fields and their applications 12(2) pp.232-247 RAE2008