NSST is a powerful transform coding tool that is reported to provide a significant coding gain. Recently, a simplified version of NSST was proposed in JVET-N0193 to limit the overall complexity by reducing the number of transform sets, as well as reducing the number of computed NSST coefficients. The solution is based on computing of the first N secondary transform coefficients and forcing the rest to be zero, where N depends on the considered block dimension. Despite this simplification, the design is reported still complex in terms of memory and computational power. This contribution proposes further simplification to this design by fixing N value to 8. It is reported that the present method halves both memory and number of operations for computing NSST.