Abstract

About a decade ago, a computer code was written to model neutrons from their “birth” to their final “death” in thermal neutron detectors (3He tubes): SrcSim had enough physics to track the neutrons in multiplying systems, appropriately increasing and decreasing the neutron population as they interacted by absorption, fission and leakage. The theory behind the algorithms assumed that all neutrons produced in a fission chain were all produced simultaneously, and then diffused to the neutron detectors. For cases where the diffusion times are long compared to the fission chains, SrcSim is very successful. Indeed, it works extraordinarily well for thermal neutron detectors and bare objects, because it takes tens of microseconds for fission neutrons to slow down to thermal energies, where they can be detected. Microseconds are a very long time compared to the lengths of the fission chains. However, this inherent assumption in the theory prevents its use to cases where either the fission chains are long compared to the neutron diffusion times (water-cooled nuclear reactors, or heavily moderated object, where the theory starts failing), or the fission neutrons can be detected shortly after they were produced (fast neutron detectors). For these cases, a new code needs to be written, where the underlying assumption is not made. The purpose of this report is to develop an algorithm to generate the arrival times of neutrons in fast neutron detectors, starting from a neutron source such as a spontaneous fission source (252Cf) or a multiplying source (Pu). This code will be an extension of SrcSim to cases where correlations between neutrons in the detectors are on the same or shorter time scales as the fission chains themselves.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.