Hyperspectral super-resolution (HSR) aims at fusing a hyperspectral image (HSI) and a multispectral image (MSI) to produce a superresolution image (SRI). Recently, a coupled tensor factorization approach was proposed to handle this challenging problem, which admits a series of advantages over the classic matrix factorizationbased methods. In particular, modeling the HSI and MSI as lowrank tensors following the canonical polyadic decomposition (CPD) model, the approach is able to provably identify the SRI, under some mild conditions. However, the latent factors in the CPD model have no physical meaning, which makes utilizing prior information of spectral images as constraints or regularizations difficult-but using such information is often important in practice, especially when the data is noisy. In this work, we propose an alternative coupled tensor decomposition approach, where the HSI and MSI are assumed to follow the block-term decomposition (BTD) model. Notably, the new method also entails identifiability of the SRI under realistic conditions. More importantly, when modeling a spectral image as a BTD tensor, the latent factors have clear physical meaning, and thus prior knowledge about spectral images can be naturally incorporated. Simulations using real hyperspectral images are employed to showcase the effectiveness of the proposed approach with nonnegativity constraints.